{"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/to-percent","entry":"to_percent","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":7,"n_papers_ran_no_instrument_failure":6,"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":7,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":8,"n_places_pointer_only":2,"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":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":4,"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":"2608.08459","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-08459","title":"Beyond Tables: Doc2DB-Bench for Relationally Faithful Document-to-Database Construction","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"SetonLiang/Doc2DB-Bench","path":"data_construction/src/parameters.py","file_url":"https://github.com/SetonLiang/Doc2DB-Bench/blob/HEAD/data_construction/src/parameters.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, SetonLiang/Doc2DB-Bench when it was checked","code_sha256":"f2b61c886c7b81d3","code_sha256_prefix":"f2b61c886c7b81d3","mcp_get_code":{"code_sha256":"f2b61c886c7b81d3"}},{"arxiv_id":"2408.01952","arxiv_id_is_arxiv":true,"paper":"/paper/2408-01952","title":"CACE-Net: Co-guidance Attention and Contrastive Enhancement for Effective Audio-Visual Event Localization","date":"2024-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brain-cog-lab/cace-net","path":"CACE/plt_fig.py","file_url":"https://github.com/brain-cog-lab/cace-net/blob/HEAD/CACE/plt_fig.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":"8788abf86694000a","code_sha256_prefix":"8788abf86694000a","mcp_get_code":{"code_sha256":"8788abf86694000a"}},{"arxiv_id":"2405.02421","arxiv_id_is_arxiv":true,"paper":"/paper/what-does-the-knowledge-neuron-thesis-have-to","title":"What does the Knowledge Neuron Thesis Have to do with Knowledge?","date":"2024-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frankniujc/kn_thesis","path":"kn_code/plot.py","file_url":"https://github.com/frankniujc/kn_thesis/blob/HEAD/kn_code/plot.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":"407c255c5fd63c76","code_sha256_prefix":"407c255c5fd63c76","mcp_get_code":{"code_sha256":"407c255c5fd63c76"}},{"arxiv_id":"2402.08349","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-the-data-model-robustness-of-text","title":"Evaluating the Data Model Robustness of Text-to-SQL Systems Based on Real User Queries","date":"2024-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jf87/footballdb","path":"src/analysis/plotting/plot.py","file_url":"https://github.com/jf87/footballdb/blob/HEAD/src/analysis/plotting/plot.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dcb1b56c0ef097c2","code_sha256_prefix":"dcb1b56c0ef097c2","mcp_get_code":{"code_sha256":"dcb1b56c0ef097c2"}},{"arxiv_id":"2106.06039","arxiv_id_is_arxiv":true,"paper":"/paper/neural-higher-order-pattern-motif-prediction","title":"Neural Predicting Higher-order Patterns in Temporal Networks","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-COM/Neural_Higher-order_Pattern-Motif_Prediction_in_Temporal_Networks","path":"histogram.py","file_url":"https://github.com/Graph-COM/Neural_Higher-order_Pattern-Motif_Prediction_in_Temporal_Networks/blob/HEAD/histogram.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":"97cb7fae2bdc893a","code_sha256_prefix":"97cb7fae2bdc893a","mcp_get_code":{"code_sha256":"97cb7fae2bdc893a"}},{"arxiv_id":"2008.10518","arxiv_id_is_arxiv":true,"paper":"/paper/screwnet-category-independent-articulation","title":"ScrewNet: Category-Independent Articulation Model Estimation From Depth Images Using Screw Theory","date":"2020-08-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Pearl-UTexas/ScrewNet","path":"evaluate_model.py","file_url":"https://github.com/Pearl-UTexas/ScrewNet/blob/HEAD/evaluate_model.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, Pearl-UTexas/ScrewNet when it was checked","code_sha256":"a0a783a022c05de5","code_sha256_prefix":"a0a783a022c05de5","mcp_get_code":{"code_sha256":"a0a783a022c05de5"}},{"arxiv_id":"1907.09356","arxiv_id_is_arxiv":true,"paper":"/paper/decentralized-deep-learning-with-arbitrary","title":"Decentralized Deep Learning with Arbitrary Communication Compression","date":"2019-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/ChocoSGD","path":"convex_code/utils.py","file_url":"https://github.com/epfml/ChocoSGD/blob/HEAD/convex_code/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":"438c8b99e9634673","code_sha256_prefix":"438c8b99e9634673","mcp_get_code":{"code_sha256":"438c8b99e9634673"}},{"arxiv_id":"1809.07599","arxiv_id_is_arxiv":true,"paper":"/paper/sparsified-sgd-with-memory","title":"Sparsified SGD with Memory","date":"2018-09-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/sparsifiedSGD","path":"utils.py","file_url":"https://github.com/epfml/sparsifiedSGD/blob/HEAD/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":"438c8b99e9634673","code_sha256_prefix":"438c8b99e9634673","mcp_get_code":{"code_sha256":"438c8b99e9634673"}}],"record_sha256":"45af4825437fcad7791d0c7f45662c3629617e9c15ec96562bcd00af08a5af95","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}