{"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/timing","entry":"timing","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":3,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_violates":0,"ran_draft_wrong":3,"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":"2602.21788","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-21788","title":"Efficient Scaling of LLM Training with Flexible Context Parallelism","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"ivanniu/FCP","path":"scheduler.py","file_url":"https://github.com/ivanniu/FCP/blob/HEAD/scheduler.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, ivanniu/FCP when it was checked","code_sha256":"3b2b0b026933db79","code_sha256_prefix":"3b2b0b026933db79","mcp_get_code":{"code_sha256":"3b2b0b026933db79"}},{"arxiv_id":"2403.05026","arxiv_id_is_arxiv":true,"paper":"/paper/spectral-invariant-learning-for-dynamic-1","title":"Spectral Invariant Learning for Dynamic Graphs under Distribution Shifts","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/sild","path":"sild/utils/misc.py","file_url":"https://github.com/wondergo2017/sild/blob/HEAD/sild/utils/misc.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, wondergo2017/sild when it was checked","code_sha256":"5e4e8d3f54d33bac","code_sha256_prefix":"5e4e8d3f54d33bac","mcp_get_code":{"code_sha256":"5e4e8d3f54d33bac"}},{"arxiv_id":"2311.13613","arxiv_id_is_arxiv":true,"paper":"/paper/spanning-training-progress-temporal-dual","title":"Spanning Training Progress: Temporal Dual-Depth Scoring (TDDS) for Enhanced Dataset Pruning","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangxin-xd/Dataset-Pruning-TDDS","path":"utils.py","file_url":"https://github.com/zhangxin-xd/Dataset-Pruning-TDDS/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":"56c1ad0817555115","code_sha256_prefix":"56c1ad0817555115","mcp_get_code":{"code_sha256":"56c1ad0817555115"}},{"arxiv_id":"2002.05709","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-framework-for-contrastive-learning","title":"A Simple Framework for Contrastive Learning of Visual Representations","date":"2020-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AndrewAtanov/simclr-pytorch","path":"utils/utils.py","file_url":"https://github.com/AndrewAtanov/simclr-pytorch/blob/HEAD/utils/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":"7d95614711e96832","code_sha256_prefix":"7d95614711e96832","mcp_get_code":{"code_sha256":"7d95614711e96832"}},{"arxiv_id":"1910.03193","arxiv_id_is_arxiv":true,"paper":"/paper/deeponet-learning-nonlinear-operators-for","title":"DeepONet: Learning nonlinear operators for identifying differential equations based on the universal approximation theorem of operators","date":"2019-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pratikkakkar/deep-diff","path":"deepxde/maps/opnn.py","file_url":"https://github.com/pratikkakkar/deep-diff/blob/HEAD/deepxde/maps/opnn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5dd03692a81aa1da","code_sha256_prefix":"5dd03692a81aa1da","mcp_get_code":{"code_sha256":"5dd03692a81aa1da"}},{"arxiv_id":"1903.01287","arxiv_id_is_arxiv":true,"paper":"/paper/safety-verification-and-robustness-analysis","title":"Safety Verification and Robustness Analysis of Neural Networks via Quadratic Constraints and Semidefinite Programming","date":"2019-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arobey1/RobustNN","path":"src/utils.py","file_url":"https://github.com/arobey1/RobustNN/blob/HEAD/src/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":"56e27e3aa35366c2","code_sha256_prefix":"56e27e3aa35366c2","mcp_get_code":{"code_sha256":"56e27e3aa35366c2"}}],"record_sha256":"3502f59bf959fe65de527bf94b9fa543bc61977345ad3d4a159319ebfc1ef51c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}