{"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/sigma","entry":"sigma","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":5,"n_places":8,"n_places_pointer_only":4,"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":2,"ran_violates":1,"ran_draft_wrong":2,"ran_fixture":0,"ran":3,"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":"2410.01091","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-private-marginal-reconstruction","title":"Efficient and Private Marginal Reconstruction with Local Non-Negativity","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bcmullins/efficient-marginal-reconstruction","path":"src/rem/reconstruction.py","file_url":"https://github.com/bcmullins/efficient-marginal-reconstruction/blob/HEAD/src/rem/reconstruction.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, bcmullins/efficient-marginal-reconstruction when it was checked","code_sha256":"201c3b66e5f17690","code_sha256_prefix":"201c3b66e5f17690","mcp_get_code":{"code_sha256":"201c3b66e5f17690"}},{"arxiv_id":"2401.11687","arxiv_id_is_arxiv":true,"paper":"/paper/tim-an-efficient-temporal-interaction-module","title":"TIM: An Efficient Temporal Interaction Module for Spiking Transformer","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BrainCog-X/Brain-Cog","path":"braincog/model_zoo/qsnn.py","file_url":"https://github.com/BrainCog-X/Brain-Cog/blob/HEAD/braincog/model_zoo/qsnn.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":"00a6c38b2c651cd6","code_sha256_prefix":"00a6c38b2c651cd6","mcp_get_code":{"code_sha256":"00a6c38b2c651cd6"}},{"arxiv_id":"2308.16004","arxiv_id_is_arxiv":true,"paper":"/paper/riemannian-optimistic-algorithms","title":"Riemannian Optimistic Algorithms","date":null,"month_inferred_from_arxiv_id":"2023-08","title_source":"archive","repo":"riemannianoco/dynamicreg","path":"rzs/parameter.py","file_url":"https://github.com/riemannianoco/dynamicreg/blob/HEAD/rzs/parameter.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, riemannianoco/dynamicreg when it was checked","code_sha256":"4258ae19590f8f0e","code_sha256_prefix":"4258ae19590f8f0e","mcp_get_code":{"code_sha256":"4258ae19590f8f0e"}},{"arxiv_id":"2304.09576","arxiv_id_is_arxiv":true,"paper":"/paper/leveraging-the-two-timescale-regime-to","title":"Leveraging the two timescale regime to demonstrate convergence of neural networks","date":"2023-04-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PierreMarion23/two-timescale-nn","path":"neural_network.py","file_url":"https://github.com/PierreMarion23/two-timescale-nn/blob/HEAD/neural_network.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":"cf410b074d17a11d","code_sha256_prefix":"cf410b074d17a11d","mcp_get_code":{"code_sha256":"cf410b074d17a11d"}},{"arxiv_id":"2010.09494","arxiv_id_is_arxiv":true,"paper":"/paper/stationary-activations-for-uncertainty","title":"Stationary Activations for Uncertainty Calibration in Deep Learning","date":"2020-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AaltoML/stationary-activations","path":"src/UCI_benchmark_classification.py","file_url":"https://github.com/AaltoML/stationary-activations/blob/HEAD/src/UCI_benchmark_classification.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"063c9e93b2268916","code_sha256_prefix":"063c9e93b2268916","mcp_get_code":{"code_sha256":"063c9e93b2268916"}},{"arxiv_id":"2008.10546","arxiv_id_is_arxiv":true,"paper":"/paper/sde-net-equipping-deep-neural-networks-with","title":"SDE-Net: Equipping Deep Neural Networks with Uncertainty Estimates","date":"2020-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Junghwan-brian/SDE-Net","path":"euler_maruyama_simulation.py","file_url":"https://github.com/Junghwan-brian/SDE-Net/blob/HEAD/euler_maruyama_simulation.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, Junghwan-brian/SDE-Net when it was checked","code_sha256":"b69484de1f3d70dd","code_sha256_prefix":"b69484de1f3d70dd","mcp_get_code":{"code_sha256":"b69484de1f3d70dd"}},{"arxiv_id":"1610.00161","arxiv_id_is_arxiv":true,"paper":"/paper/towards-deep-learning-with-segregated","title":"Towards deep learning with segregated dendrites","date":"2016-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jordan-g/segregated-dendrite-deep-learning","path":"deep_learning.py","file_url":"https://github.com/jordan-g/segregated-dendrite-deep-learning/blob/HEAD/deep_learning.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, jordan-g/segregated-dendrite-deep-learning, is not in the permissive set Syntology serves inline","code_sha256":"27dca041f3ececb1","code_sha256_prefix":"27dca041f3ececb1","mcp_get_code":{"code_sha256":"27dca041f3ececb1"}},{"arxiv_id":"1206.1901","arxiv_id_is_arxiv":true,"paper":"/paper/mcmc-using-hamiltonian-dynamics","title":"MCMC using Hamiltonian dynamics","date":null,"month_inferred_from_arxiv_id":"2012-06","title_source":"archive","repo":"ricvalp/aisampler","path":"aisampler/logistic_regression/densities.py","file_url":"https://github.com/ricvalp/aisampler/blob/HEAD/aisampler/logistic_regression/densities.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":"543ac1fdfab44708","code_sha256_prefix":"543ac1fdfab44708","mcp_get_code":{"code_sha256":"543ac1fdfab44708"}}],"record_sha256":"e94e929c6b6841807a7783c342e39552f63bfd558c2aa8888675170b18568806","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}