{"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/jsd","entry":"jsd","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":2,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":7,"n_places":8,"n_places_pointer_only":3,"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":1,"ran_violates":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":4,"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.03967","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-03967","title":"Information-Geometric Forward Policy Training in GFlowNets","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"rodsveiga/infogeometric_gflows","path":"gflows/utils.py","file_url":"https://github.com/rodsveiga/infogeometric_gflows/blob/HEAD/gflows/utils.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, rodsveiga/infogeometric_gflows when it was checked","code_sha256":"ede282cb4ee11a53","code_sha256_prefix":"ede282cb4ee11a53","mcp_get_code":{"code_sha256":"ede282cb4ee11a53"}},{"arxiv_id":"2601.19245","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-19245","title":"Beyond In-Domain Detection: SpikeScore for Cross-Domain Hallucination Detection","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"TianYaDY/SpikeScore","path":"metrics_score.py","file_url":"https://github.com/TianYaDY/SpikeScore/blob/HEAD/metrics_score.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":"b6e699e8f8f1fd8e","code_sha256_prefix":"b6e699e8f8f1fd8e","mcp_get_code":{"code_sha256":"b6e699e8f8f1fd8e"}},{"arxiv_id":"2404.00680","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-rank-patches-for-unbiased-image","title":"Learning to Rank Patches for Unbiased Image Redundancy Reduction","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"irslu/ltrp","path":"utils/ltrp_loss.py","file_url":"https://github.com/irslu/ltrp/blob/HEAD/utils/ltrp_loss.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, irslu/ltrp when it was checked","code_sha256":"067e18aafaabbacf","code_sha256_prefix":"067e18aafaabbacf","mcp_get_code":{"code_sha256":"067e18aafaabbacf"}},{"arxiv_id":"2402.03563","arxiv_id_is_arxiv":true,"paper":"/paper/distinguishing-the-knowable-from-the","title":"Distinguishing the Knowable from the Unknowable with Language Models","date":"2024-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gahdritz/llm_uncertainty","path":"lit-llama/utils.py","file_url":"https://github.com/gahdritz/llm_uncertainty/blob/HEAD/lit-llama/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6555dda0713b63e2","code_sha256_prefix":"6555dda0713b63e2","mcp_get_code":{"code_sha256":"6555dda0713b63e2"}},{"arxiv_id":"2305.04357","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-consistency-and-information-loss","title":"Quantifying Consistency and Information Loss for Causal Abstraction Learning","date":"2023-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FMZennaro/CausalAbstraction","path":"papers/2023-quantifying-consistency-and-infoloss/src/measuring.py","file_url":"https://github.com/FMZennaro/CausalAbstraction/blob/HEAD/papers/2023-quantifying-consistency-and-infoloss/src/measuring.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"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, FMZennaro/CausalAbstraction, is not in the permissive set Syntology serves inline","code_sha256":"f1e6db2f7279c4f4","code_sha256_prefix":"f1e6db2f7279c4f4","mcp_get_code":{"code_sha256":"f1e6db2f7279c4f4"}},{"arxiv_id":"2104.06486","arxiv_id_is_arxiv":true,"paper":"/paper/ms2-multi-document-summarization-of-medical","title":"MS2: Multi-Document Summarization of Medical Studies","date":"2021-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/mslr-shared-task","path":"ms2/evaluation/utils.py","file_url":"https://github.com/allenai/mslr-shared-task/blob/HEAD/ms2/evaluation/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b39ea742ad05097","code_sha256_prefix":"4b39ea742ad05097","mcp_get_code":{"code_sha256":"4b39ea742ad05097"}},{"arxiv_id":"1909.09849","arxiv_id_is_arxiv":true,"paper":"/paper/190909849","title":"Multiagent Evaluation under Incomplete Information","date":"2019-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/InfoGainalpharank","path":"src/acquisition/functions.py","file_url":"https://github.com/microsoft/InfoGainalpharank/blob/HEAD/src/acquisition/functions.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":"7aa5cfcba664b38c","code_sha256_prefix":"7aa5cfcba664b38c","mcp_get_code":{"code_sha256":"7aa5cfcba664b38c"}},{"arxiv_id":"1901.01216","arxiv_id_is_arxiv":true,"paper":"/paper/transfer-learning-from-language-models-to","title":"Transfer learning from language models to image caption generators: Better models may not transfer better","date":"2019-01-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mtanti/mtanti-phd","path":"experiments/thesis/imageimportance_experiment.py","file_url":"https://github.com/mtanti/mtanti-phd/blob/HEAD/experiments/thesis/imageimportance_experiment.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":"596bef484c52bbc6","code_sha256_prefix":"596bef484c52bbc6","mcp_get_code":{"code_sha256":"596bef484c52bbc6"}}],"record_sha256":"7911977f1f2a4d59c5ef5b0d801c4e467e6653907e3d8e84384469be2a194477","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}