{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/get-continuity-loss","entry":"get_continuity_loss","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":2,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":0,"by_status":{"ran_honours":1,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":0,"unverified":1},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2503.06202","paper":"/paper/breaking-free-from-mmi-a-new-frontier-in","title":"Breaking Free from MMI: A New Frontier in Rationalization by Probing Input Utilization","date":"2025-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jugechengzi/Rationalization-N2R","path":"metric.py","file_url":"https://github.com/jugechengzi/Rationalization-N2R/blob/HEAD/metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c92373379a9ed7e6","mcp_get_code":{"code_sha256":"c92373379a9ed7e6"}},{"arxiv_id":"2410.06003","paper":"/paper/is-the-mmi-criterion-necessary-for","title":"Is the MMI Criterion Necessary for Interpretability? Degenerating Non-causal Features to Plain Noise for Self-Rationalization","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jugechengzi/Rationalization-MRD","path":"metric.py","file_url":"https://github.com/jugechengzi/Rationalization-MRD/blob/HEAD/metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c92373379a9ed7e6","mcp_get_code":{"code_sha256":"c92373379a9ed7e6"}},{"arxiv_id":"2312.04103","paper":"/paper/enhancing-the-rationale-input-alignment-for","title":"Enhancing the Rationale-Input Alignment for Self-explaining Rationalization","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jugechengzi/dar","path":"metric.py","file_url":"https://github.com/jugechengzi/dar/blob/HEAD/metric.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c92373379a9ed7e6","mcp_get_code":{"code_sha256":"c92373379a9ed7e6"}},{"arxiv_id":"2309.13391","paper":"/paper/d-separation-for-causal-self-explanation-1","title":"D-Separation for Causal Self-Explanation","date":"2023-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jugechengzi/rationalization-mcd","path":"train_util.py","file_url":"https://github.com/jugechengzi/rationalization-mcd/blob/HEAD/train_util.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c92373379a9ed7e6","mcp_get_code":{"code_sha256":"c92373379a9ed7e6"}},{"arxiv_id":"1910.12853","paper":"/paper/a-game-theoretic-approach-to-class-wise","title":"A Game Theoretic Approach to Class-wise Selective Rationalization","date":"2019-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"code-terminator/classwise_rationale","path":"core/metric.py","file_url":"https://github.com/code-terminator/classwise_rationale/blob/HEAD/core/metric.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"a7eb8a5f953da68c","mcp_get_code":{"code_sha256":"a7eb8a5f953da68c"}}]}