{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/safe-divide","entry":"safe_divide","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":19,"n_papers_ran":19,"n_papers_ran_no_instrument_failure":18,"n_papers_ran_instrument_only":1,"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":14,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":13,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":11,"n_places":19,"n_places_pointer_only":9,"n_places_pointer_only_link_open":2,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":3,"ran_violates":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":9,"unverified":0},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2608.10042","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-10042","title":"UserToolBench: A User-Profile-Hidden Benchmark for Personalized Decision Making in Tool-Use LLMs","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"xxy212/UserToolBench","path":"utb/evaluation/stats/stats_score.py","file_url":"https://github.com/xxy212/UserToolBench/blob/HEAD/utb/evaluation/stats/stats_score.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, xxy212/UserToolBench when it was checked","code_sha256":"628a065a6f5ccc29","code_sha256_prefix":"628a065a6f5ccc29","mcp_get_code":{"code_sha256":"628a065a6f5ccc29"}},{"arxiv_id":"2602.22101","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-22101","title":"On Imbalanced Regression with Hoeffding Trees","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"marinaAlchirch/DSFA_2026","path":"src/bayes/utils.py","file_url":"https://github.com/marinaAlchirch/DSFA_2026/blob/HEAD/src/bayes/utils.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, marinaAlchirch/DSFA_2026 when it was checked","code_sha256":"1837ac6a208950c7","code_sha256_prefix":"1837ac6a208950c7","mcp_get_code":{"code_sha256":"1837ac6a208950c7"}},{"arxiv_id":"2503.02130","arxiv_id_is_arxiv":true,"paper":"/paper/forgetting-transformer-softmax-attention-with","title":"Forgetting Transformer: Softmax Attention with a Forget Gate","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhixuan-lin/forgetting-transformer","path":"src/forgetting_transformer/utils.py","file_url":"https://github.com/zhixuan-lin/forgetting-transformer/blob/HEAD/src/forgetting_transformer/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e9970b6ad2c69c84","code_sha256_prefix":"e9970b6ad2c69c84","mcp_get_code":{"code_sha256":"e9970b6ad2c69c84"}},{"arxiv_id":"2406.16708","arxiv_id_is_arxiv":true,"paper":"/paper/causalformer-an-interpretable-transformer-for","title":"CausalFormer: An Interpretable Transformer for Temporal Causal Discovery","date":"2024-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lingbai-kong/causalformer","path":"model/NonParamRP.py","file_url":"https://github.com/lingbai-kong/causalformer/blob/HEAD/model/NonParamRP.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, lingbai-kong/causalformer, is not in the permissive set Syntology serves inline","code_sha256":"507e144112f81dc6","code_sha256_prefix":"507e144112f81dc6","mcp_get_code":{"code_sha256":"507e144112f81dc6"}},{"arxiv_id":"2405.10288","arxiv_id_is_arxiv":true,"paper":"/paper/timeline-based-sentence-decomposition-with-in","title":"Timeline-based Sentence Decomposition with In-Context Learning for Temporal Fact Extraction","date":"2024-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jianhaochen-nju/tsdre","path":"scoring.py","file_url":"https://github.com/jianhaochen-nju/tsdre/blob/HEAD/scoring.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, jianhaochen-nju/tsdre when it was checked","code_sha256":"c7d79bbef4cfaa4d","code_sha256_prefix":"c7d79bbef4cfaa4d","mcp_get_code":{"code_sha256":"c7d79bbef4cfaa4d"}},{"arxiv_id":"2403.09274","arxiv_id_is_arxiv":true,"paper":"/paper/eventrpg-event-data-augmentation-with","title":"EventRPG: Event Data Augmentation with Relevance Propagation Guidance","date":"2024-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"myuansun/EventRPG","path":"snn_utils/layers.py","file_url":"https://github.com/myuansun/EventRPG/blob/HEAD/snn_utils/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wjNam/Relative_Attributing_Propagation, and GitHub detected no licence in that repository when it was checked","code_sha256":"251e368f5f9b12f5","code_sha256_prefix":"251e368f5f9b12f5","mcp_get_code":{"code_sha256":"251e368f5f9b12f5"}},{"arxiv_id":"2402.03348","arxiv_id_is_arxiv":true,"paper":"/paper/respect-the-model-fine-grained-and-robust-1","title":"Respect the model: Fine-grained and Robust Explanation with Sharing Ratio Decomposition","date":"2024-01-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Sangyu-Han/SharingRatioDecomposition","path":"modules/layers.py","file_url":"https://github.com/Sangyu-Han/SharingRatioDecomposition/blob/HEAD/modules/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from wjNam/Relative_Attributing_Propagation, and GitHub detected no licence in that repository when it was checked","code_sha256":"251e368f5f9b12f5","code_sha256_prefix":"251e368f5f9b12f5","mcp_get_code":{"code_sha256":"251e368f5f9b12f5"}},{"arxiv_id":"2310.06000","arxiv_id_is_arxiv":true,"paper":"/paper/incentivizing-data-sharing-for-energy","title":"Towards Replication-Robust Data Markets","date":"2023-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tdfalc/regression-markets","path":"regression_markets/common/utils.py","file_url":"https://github.com/tdfalc/regression-markets/blob/HEAD/regression_markets/common/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, tdfalc/regression-markets when it was checked","code_sha256":"2b3dde6b80403131","code_sha256_prefix":"2b3dde6b80403131","mcp_get_code":{"code_sha256":"2b3dde6b80403131"}},{"arxiv_id":"2310.04519","arxiv_id_is_arxiv":true,"paper":"/paper/spade-sparsity-guided-debugging-for-deep","title":"SPADE: Sparsity-Guided Debugging for Deep Neural Networks","date":"2023-10-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ist-daslab/spade","path":"src/LRP/layers.py","file_url":"https://github.com/ist-daslab/spade/blob/HEAD/src/LRP/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ist-daslab/spade when it was checked","code_sha256":"251e368f5f9b12f5","code_sha256_prefix":"251e368f5f9b12f5","mcp_get_code":{"code_sha256":"251e368f5f9b12f5"}},{"arxiv_id":"2210.08495","arxiv_id_is_arxiv":true,"paper":"/paper/pareto-set-learning-for-expensive-multi","title":"Pareto Set Learning for Expensive Multi-Objective Optimization","date":"2022-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xi-l/psl-mobo","path":"mobo/utils.py","file_url":"https://github.com/xi-l/psl-mobo/blob/HEAD/mobo/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9ab0a7cfcf1659be","code_sha256_prefix":"9ab0a7cfcf1659be","mcp_get_code":{"code_sha256":"9ab0a7cfcf1659be"}},{"arxiv_id":"2208.11342","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-transferable-forensic-features","title":"Discovering Transferable Forensic Features for CNN-generated Images Detection","date":"2022-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sutd-visual-computing-group/transferable-forensic-features","path":"src/lrp/ef_lrp_general.py","file_url":"https://github.com/sutd-visual-computing-group/transferable-forensic-features/blob/HEAD/src/lrp/ef_lrp_general.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a215b24b1c0382ec","code_sha256_prefix":"a215b24b1c0382ec","mcp_get_code":{"code_sha256":"a215b24b1c0382ec"}},{"arxiv_id":"2205.09671","arxiv_id_is_arxiv":true,"paper":"/paper/a-graph-transformer-for-whole-slide-image","title":"A graph-transformer for whole slide image classification","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vkola-lab/tmi2022","path":"models/layers.py","file_url":"https://github.com/vkola-lab/tmi2022/blob/HEAD/models/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"507e144112f81dc6","code_sha256_prefix":"507e144112f81dc6","mcp_get_code":{"code_sha256":"507e144112f81dc6"}},{"arxiv_id":"2201.04676","arxiv_id_is_arxiv":true,"paper":"/paper/uniformer-unified-transformer-for-efficient-1","title":"UniFormer: Unified Transformer for Efficient Spatiotemporal Representation Learning","date":"2022-01-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"towhee-io/towhee","path":"towhee/models/uniformer/uniformer.py","file_url":"https://github.com/towhee-io/towhee/blob/HEAD/towhee/models/uniformer/uniformer.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"507e144112f81dc6","code_sha256_prefix":"507e144112f81dc6","mcp_get_code":{"code_sha256":"507e144112f81dc6"}},{"arxiv_id":"2112.01640","arxiv_id_is_arxiv":true,"paper":"/paper/longchecker-improving-scientific-claim","title":"MultiVerS: Improving scientific claim verification with weak supervision and full-document context","date":"2021-12-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dwadden/longchecker","path":"multivers/metrics.py","file_url":"https://github.com/dwadden/longchecker/blob/HEAD/multivers/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b999fdcde5c96886","code_sha256_prefix":"b999fdcde5c96886","mcp_get_code":{"code_sha256":"b999fdcde5c96886"}},{"arxiv_id":"2111.10367","arxiv_id_is_arxiv":true,"paper":"/paper/slue-new-benchmark-tasks-for-spoken-language","title":"SLUE: New Benchmark Tasks for Spoken Language Understanding Evaluation on Natural Speech","date":"2021-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"asappresearch/slue-toolkit","path":"slue_toolkit/eval/eval_utils_ner.py","file_url":"https://github.com/asappresearch/slue-toolkit/blob/HEAD/slue_toolkit/eval/eval_utils_ner.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"815aaded7a9eae16","code_sha256_prefix":"815aaded7a9eae16","mcp_get_code":{"code_sha256":"815aaded7a9eae16"}},{"arxiv_id":"2109.12072","arxiv_id_is_arxiv":true,"paper":"/paper/sd-qa-spoken-dialectal-question-answering-for","title":"SD-QA: Spoken Dialectal Question Answering for the Real World","date":"2021-09-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ffaisal93/sd-qa","path":"baselines/tydiqa/eval_utils.py","file_url":"https://github.com/ffaisal93/sd-qa/blob/HEAD/baselines/tydiqa/eval_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"999c2750713a6692","code_sha256_prefix":"999c2750713a6692","mcp_get_code":{"code_sha256":"999c2750713a6692"}},{"arxiv_id":"1904.00605","arxiv_id_is_arxiv":true,"paper":"/paper/relative-attributing-propagation-interpreting","title":"Relative Attributing Propagation: Interpreting the Comparative Contributions of Individual Units in Deep Neural Networks","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wjNam/Relative_Attributing_Propagation","path":"modules/layers.py","file_url":"https://github.com/wjNam/Relative_Attributing_Propagation/blob/HEAD/modules/layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, wjNam/Relative_Attributing_Propagation when it was checked","code_sha256":"251e368f5f9b12f5","code_sha256_prefix":"251e368f5f9b12f5","mcp_get_code":{"code_sha256":"251e368f5f9b12f5"}},{"arxiv_id":"1803.09196","arxiv_id_is_arxiv":true,"paper":"/paper/learning-type-aware-embeddings-for-fashion","title":"Learning Type-Aware Embeddings for Fashion Compatibility","date":"2018-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"owj0421/DeepFashion","path":"src/models/loss.py","file_url":"https://github.com/owj0421/DeepFashion/blob/HEAD/src/models/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6e063d74f933e308","code_sha256_prefix":"6e063d74f933e308","mcp_get_code":{"code_sha256":"6e063d74f933e308"}},{"arxiv_id":"2023.findings-acl.888","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2023.findings-acl.888","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"posuer/Check-COVID","path":"fact-checking-system/evaluate/lib/metrics.py","file_url":"https://github.com/posuer/Check-COVID/blob/HEAD/fact-checking-system/evaluate/lib/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"585307173c703a97","code_sha256_prefix":"585307173c703a97","mcp_get_code":{"code_sha256":"585307173c703a97"}}],"record_sha256":"832f99d49ccf28b0fbb79de9aaae590f86b89d2aa0326d07f2136bde5b698e5e","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}