{"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/logistic","entry":"logistic","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":13,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":12,"n_papers_ran_instrument_only":0,"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":13,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":12,"n_places":13,"n_places_pointer_only":6,"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":4,"ran_violates":6,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":1},"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":"2607.14607","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-14607","title":"Auditing Fairness-Privacy Trade-offs: Subpopulation-Level Effects of Fairness-Enhancing Algorithms","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"jjgold012/lab-project-fairness","path":"fairness_project/solver.py","file_url":"https://github.com/jjgold012/lab-project-fairness/blob/HEAD/fairness_project/solver.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, jjgold012/lab-project-fairness when it was checked","code_sha256":"36a1468d01fa52b5","code_sha256_prefix":"36a1468d01fa52b5","mcp_get_code":{"code_sha256":"36a1468d01fa52b5"}},{"arxiv_id":"2604.24827","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-24827","title":"Incompressible Knowledge Probes: Estimating Black-Box LLM Parameter Counts via Factual Capacity","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"19PINE-AI/ikp","path":"src/calibration.py","file_url":"https://github.com/19PINE-AI/ikp/blob/HEAD/src/calibration.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, 19PINE-AI/ikp when it was checked","code_sha256":"d89e5cb204b2aca6","code_sha256_prefix":"d89e5cb204b2aca6","mcp_get_code":{"code_sha256":"d89e5cb204b2aca6"}},{"arxiv_id":"2602.01483","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-01483","title":"Causal Preference Elicitation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"csiro-funml/CaPE","path":"inference/candidate_selection.py","file_url":"https://github.com/csiro-funml/CaPE/blob/HEAD/inference/candidate_selection.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c6072629f9307bf4","code_sha256_prefix":"c6072629f9307bf4","mcp_get_code":{"code_sha256":"c6072629f9307bf4"}},{"arxiv_id":"2601.21696","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-21696","title":"Independent Component Discovery in Temporal Count Data","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"lindermanlab/ssm","path":"ssm/emissions.py","file_url":"https://github.com/lindermanlab/ssm/blob/HEAD/ssm/emissions.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e236f0c0749c0118","code_sha256_prefix":"e236f0c0749c0118","mcp_get_code":{"code_sha256":"e236f0c0749c0118"}},{"arxiv_id":"2601.13885","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-13885","title":"Confident Rankings with Fewer Items: Adaptive LLM Evaluation with Continuous Scores","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"trismik/continuous-cat","path":"src/continuous_cat/ranker.py","file_url":"https://github.com/trismik/continuous-cat/blob/HEAD/src/continuous_cat/ranker.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, trismik/continuous-cat (NOASSERTION)","code_sha256":"78bccdbf5e2e2b21","code_sha256_prefix":"78bccdbf5e2e2b21","mcp_get_code":{"code_sha256":"78bccdbf5e2e2b21"}},{"arxiv_id":"2403.14606","arxiv_id_is_arxiv":true,"paper":"/paper/the-elements-of-differentiable-programming","title":"The Elements of Differentiable Programming","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"diffprog/code","path":"control_flows/plot_soft_comparison.py","file_url":"https://github.com/diffprog/code/blob/HEAD/control_flows/plot_soft_comparison.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8e99ad829bc70d6d","code_sha256_prefix":"8e99ad829bc70d6d","mcp_get_code":{"code_sha256":"8e99ad829bc70d6d"}},{"arxiv_id":"2204.01819","arxiv_id_is_arxiv":true,"paper":"/paper/achieving-long-term-fairness-in-sequential","title":"Achieving Long-Term Fairness in Sequential Decision Making","date":"2022-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yaoweihu/Achieving-Long-term-Fairness","path":"src/fair_model.py","file_url":"https://github.com/yaoweihu/Achieving-Long-term-Fairness/blob/HEAD/src/fair_model.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, yaoweihu/Achieving-Long-term-Fairness when it was checked","code_sha256":"d47d2823041d8099","code_sha256_prefix":"d47d2823041d8099","mcp_get_code":{"code_sha256":"d47d2823041d8099"}},{"arxiv_id":"2011.00379","arxiv_id_is_arxiv":true,"paper":"/paper/fair-classification-with-group-dependent","title":"Fair Classification with Group-Dependent Label Noise","date":"2020-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Faldict/fair-classification-with-noisy-labels","path":"PeerLoss.py","file_url":"https://github.com/Faldict/fair-classification-with-noisy-labels/blob/HEAD/PeerLoss.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, Faldict/fair-classification-with-noisy-labels when it was checked","code_sha256":"602ea0b622c9258a","code_sha256_prefix":"602ea0b622c9258a","mcp_get_code":{"code_sha256":"602ea0b622c9258a"}},{"arxiv_id":"2007.01162","arxiv_id_is_arxiv":true,"paper":"/paper/tilted-empirical-risk-minimization","title":"Tilted Empirical Risk Minimization","date":"2020-07-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"istaustria-cvml/flea","path":"src/FLEA.py","file_url":"https://github.com/istaustria-cvml/flea/blob/HEAD/src/FLEA.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3592d26743a212ca","code_sha256_prefix":"3592d26743a212ca","mcp_get_code":{"code_sha256":"3592d26743a212ca"}},{"arxiv_id":"2003.05033","arxiv_id_is_arxiv":true,"paper":"/paper/kale-when-energy-based-learning-meets","title":"Generalized Energy Based Models","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/GeneralizedEBM","path":"compute.py","file_url":"https://github.com/MichaelArbel/GeneralizedEBM/blob/HEAD/compute.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f82f297375e8ab15","code_sha256_prefix":"f82f297375e8ab15","mcp_get_code":{"code_sha256":"f82f297375e8ab15"}},{"arxiv_id":"1909.13082","arxiv_id_is_arxiv":true,"paper":"/paper/wasserstein-2-generative-networks","title":"Wasserstein-2 Generative Networks","date":"2019-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lit-leo/inner-convex-nn","path":"icnn_fixed/lib/bundle_entropy_dual.py","file_url":"https://github.com/lit-leo/inner-convex-nn/blob/HEAD/icnn_fixed/lib/bundle_entropy_dual.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":"99b488c1fe141b25","code_sha256_prefix":"99b488c1fe141b25","mcp_get_code":{"code_sha256":"99b488c1fe141b25"}},{"arxiv_id":"1506.05843","arxiv_id_is_arxiv":true,"paper":"/paper/dependent-multinomial-models-made-easy-stick","title":"Dependent Multinomial Models Made Easy: Stick Breaking with the Pólya-Gamma Augmentation","date":"2015-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HIPS/pgmult","path":"pgmult/utils.py","file_url":"https://github.com/HIPS/pgmult/blob/HEAD/pgmult/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":"cf4bb5e9f8634ad2","code_sha256_prefix":"cf4bb5e9f8634ad2","mcp_get_code":{"code_sha256":"cf4bb5e9f8634ad2"}},{"arxiv_id":"1506.02640","arxiv_id_is_arxiv":true,"paper":"/paper/you-only-look-once-unified-real-time-object","title":"You Only Look Once: Unified, Real-Time Object Detection","date":"2015-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Banus/caffe-demo","path":"yolo_detection.py","file_url":"https://github.com/Banus/caffe-demo/blob/HEAD/yolo_detection.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Banus/caffe-demo (NOASSERTION)","code_sha256":"74cfca8abd2312c1","code_sha256_prefix":"74cfca8abd2312c1","mcp_get_code":{"code_sha256":"74cfca8abd2312c1"}}],"record_sha256":"a59d176378d07b933f582f8ff979eff78349bf07d182008bb2f18c332408c733","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}