{"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/cal-acc","entry":"cal_acc","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":10,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":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":11,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":4,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":11,"n_places_pointer_only":8,"n_places_pointer_only_link_open":0,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":1,"ran":4,"unverified":3},"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":"2605.01369","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01369","title":"MU-SHOT-Fi: Self-Supervised Multi-User Wi-Fi Sensing with Source-free Unsupervised Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"AhmedRadwan02/mu-shot-fi","path":"WiDAR/SHOT/uda_widar.py","file_url":"https://github.com/AhmedRadwan02/mu-shot-fi/blob/HEAD/WiDAR/SHOT/uda_widar.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AhmedRadwan02/mu-shot-fi when it was checked","code_sha256":"f0a06f57198b0601","code_sha256_prefix":"f0a06f57198b0601","mcp_get_code":{"code_sha256":"f0a06f57198b0601"}},{"arxiv_id":"2605.01369","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-01369","title":"MU-SHOT-Fi: Self-Supervised Multi-User Wi-Fi Sensing with Source-free Unsupervised Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"AhmedRadwan02/mu-shot-fi","path":"WiMANS/SHOT/uda_wimans.py","file_url":"https://github.com/AhmedRadwan02/mu-shot-fi/blob/HEAD/WiMANS/SHOT/uda_wimans.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AhmedRadwan02/mu-shot-fi when it was checked","code_sha256":"fdb2ddfee9ce35ae","code_sha256_prefix":"fdb2ddfee9ce35ae","mcp_get_code":{"code_sha256":"fdb2ddfee9ce35ae"}},{"arxiv_id":"2411.16061","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-spike-driven-transformer-with","title":"Scaling Spike-driven Transformer with Efficient Spike Firing Approximation Training","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biclab/spike-driven-transformer-v3","path":"SDT_V3/Classification/Model_Base/engine_finetune.py","file_url":"https://github.com/biclab/spike-driven-transformer-v3/blob/HEAD/SDT_V3/Classification/Model_Base/engine_finetune.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, biclab/spike-driven-transformer-v3 when it was checked","code_sha256":"57f12d460f0917e9","code_sha256_prefix":"57f12d460f0917e9","mcp_get_code":{"code_sha256":"57f12d460f0917e9"}},{"arxiv_id":"2407.18899","arxiv_id_is_arxiv":true,"paper":"/paper/learn-from-the-learnt-source-free-active","title":"Learn from the Learnt: Source-Free Active Domain Adaptation via Contrastive Sampling and Visual Persistence","date":"2024-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lyumengyao/lftl","path":"mining/contrastive_sampling.py","file_url":"https://github.com/lyumengyao/lftl/blob/HEAD/mining/contrastive_sampling.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","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, lyumengyao/lftl when it was checked","code_sha256":"e5b1dfbb42d000c2","code_sha256_prefix":"e5b1dfbb42d000c2","mcp_get_code":{"code_sha256":"e5b1dfbb42d000c2"}},{"arxiv_id":"2403.10834","arxiv_id_is_arxiv":true,"paper":"/paper/sf-da-2-source-free-domain-adaptation-through","title":"SF(DA)$^2$: Source-free Domain Adaptation Through the Lens of Data Augmentation","date":"2024-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shinyflight/sfda2","path":"tar_adaptation.py","file_url":"https://github.com/shinyflight/sfda2/blob/HEAD/tar_adaptation.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, shinyflight/sfda2 (NOASSERTION)","code_sha256":"d6d96524f26e5205","code_sha256_prefix":"d6d96524f26e5205","mcp_get_code":{"code_sha256":"d6d96524f26e5205"}},{"arxiv_id":"2401.12794","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-llms-via-uncertainty","title":"Benchmarking LLMs via Uncertainty Quantification","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"smartyfh/llm-uncertainty-bench","path":"uncertainty_quantification_via_cp.py","file_url":"https://github.com/smartyfh/llm-uncertainty-bench/blob/HEAD/uncertainty_quantification_via_cp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1a38d8124050f460","code_sha256_prefix":"1a38d8124050f460","mcp_get_code":{"code_sha256":"1a38d8124050f460"}},{"arxiv_id":"2302.01516","arxiv_id_is_arxiv":true,"paper":"/paper/class-overwhelms-mutual-conditional-blended","title":"Class Overwhelms: Mutual Conditional Blended-Target Domain Adaptation","date":"2023-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation","path":"models/evaluation.py","file_url":"https://github.com/Pengchengpcx/Class-overwhelms-Mutual-Conditional-Blended-Target-Domain-Adaptation/blob/HEAD/models/evaluation.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":"96d1a27e3ffdf6f9","code_sha256_prefix":"96d1a27e3ffdf6f9","mcp_get_code":{"code_sha256":"96d1a27e3ffdf6f9"}},{"arxiv_id":"2211.06612","arxiv_id_is_arxiv":true,"paper":"/paper/divide-and-contrast-source-free-domain","title":"Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyezhang/dac","path":"VisDA/target.py","file_url":"https://github.com/zyezhang/dac/blob/HEAD/VisDA/target.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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, zyezhang/dac, is not in the permissive set Syntology serves inline","code_sha256":"bd79f7cd617a9c3c","code_sha256_prefix":"bd79f7cd617a9c3c","mcp_get_code":{"code_sha256":"bd79f7cd617a9c3c"}},{"arxiv_id":"2205.04183","arxiv_id_is_arxiv":true,"paper":"/paper/local-prediction-aggregation-a-frustratingly","title":"Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Albert0147/AaD_SFDA","path":"tar_adaptation.py","file_url":"https://github.com/Albert0147/AaD_SFDA/blob/HEAD/tar_adaptation.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Albert0147/AaD_SFDA when it was checked","code_sha256":"d1a7084d06a46573","code_sha256_prefix":"d1a7084d06a46573","mcp_get_code":{"code_sha256":"d1a7084d06a46573"}},{"arxiv_id":"2007.07453","arxiv_id_is_arxiv":true,"paper":"/paper/graph-based-social-relation-reasoning","title":"Graph-Based Social Relation Reasoning","date":"2020-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Li-Wanhua/GR2N","path":"GRRN/SR_train.py","file_url":"https://github.com/Li-Wanhua/GR2N/blob/HEAD/GRRN/SR_train.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Li-Wanhua/GR2N when it was checked","code_sha256":"92213c8608122436","code_sha256_prefix":"92213c8608122436","mcp_get_code":{"code_sha256":"92213c8608122436"}},{"arxiv_id":"1910.11424","arxiv_id_is_arxiv":true,"paper":"/paper/capacity-bandwidth-and-compositionality-in","title":"Capacity, Bandwidth, and Compositionality in Emergent Language Learning","date":"2019-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"backpropper/cbc-emecom","path":"utils.py","file_url":"https://github.com/backpropper/cbc-emecom/blob/HEAD/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":"044cf2a3ac20b2b7","code_sha256_prefix":"044cf2a3ac20b2b7","mcp_get_code":{"code_sha256":"044cf2a3ac20b2b7"}}],"record_sha256":"c83495584c07a8afaaacd99dcb2fdbce61d49c94111c8f98575684bb676fb12a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}