{"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/mkdirs","entry":"mkdirs","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":4,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":5,"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":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":"2410.04010","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-fine-tuning-for-large-language","title":"Hyperbolic Fine-tuning for Large Language Models","date":"2024-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"marlin-codes/hyplora","path":"utils/token_frequency_distribution.py","file_url":"https://github.com/marlin-codes/hyplora/blob/HEAD/utils/token_frequency_distribution.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, marlin-codes/hyplora when it was checked","code_sha256":"edf7c9e239eadabf","code_sha256_prefix":"edf7c9e239eadabf","mcp_get_code":{"code_sha256":"edf7c9e239eadabf"}},{"arxiv_id":"2407.01290","arxiv_id_is_arxiv":true,"paper":"/paper/hypformer-exploring-efficient-hyperbolic","title":"Hypformer: Exploring Efficient Hyperbolic Transformer Fully in Hyperbolic Space","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Graph-and-Geometric-Learning/hyperbolic-transformer","path":"large/logger.py","file_url":"https://github.com/Graph-and-Geometric-Learning/hyperbolic-transformer/blob/HEAD/large/logger.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5c5f4efd8c517968","code_sha256_prefix":"5c5f4efd8c517968","mcp_get_code":{"code_sha256":"5c5f4efd8c517968"}},{"arxiv_id":"2406.10426","arxiv_id_is_arxiv":true,"paper":"/paper/towards-neural-scaling-laws-for-foundation","title":"Towards Neural Scaling Laws for Foundation Models on Temporal Graphs","date":"2024-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benjaminnNgo/ScalingTGNs","path":"script/gclstm_foundation_model.py","file_url":"https://github.com/benjaminnNgo/ScalingTGNs/blob/HEAD/script/gclstm_foundation_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"520dfca725ed1118","code_sha256_prefix":"520dfca725ed1118","mcp_get_code":{"code_sha256":"520dfca725ed1118"}},{"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/data_util.py","file_url":"https://github.com/wondergo2017/sild/blob/HEAD/sild/utils/data_util.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":"520dfca725ed1118","code_sha256_prefix":"520dfca725ed1118","mcp_get_code":{"code_sha256":"520dfca725ed1118"}},{"arxiv_id":"2311.11114","arxiv_id_is_arxiv":true,"paper":"/paper/environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/DIDA","path":"DIDA/utils/data_util.py","file_url":"https://github.com/wondergo2017/DIDA/blob/HEAD/DIDA/utils/data_util.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/DIDA when it was checked","code_sha256":"520dfca725ed1118","code_sha256_prefix":"520dfca725ed1118","mcp_get_code":{"code_sha256":"520dfca725ed1118"}},{"arxiv_id":"2311.11114","arxiv_id_is_arxiv":true,"paper":"/paper/environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wondergo2017/DIDA","path":"DIDA/utils/util.py","file_url":"https://github.com/wondergo2017/DIDA/blob/HEAD/DIDA/utils/util.py","status":"ran","verification_level":1,"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, wondergo2017/DIDA when it was checked","code_sha256":"01f2dcc14868226d","code_sha256_prefix":"01f2dcc14868226d","mcp_get_code":{"code_sha256":"01f2dcc14868226d"}},{"arxiv_id":"2005.07150","arxiv_id_is_arxiv":true,"paper":"/paper/named-entity-recognition-as-dependency","title":"Named Entity Recognition as Dependency Parsing","date":"2020-05-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"juntaoy/biaffine-ner","path":"util.py","file_url":"https://github.com/juntaoy/biaffine-ner/blob/HEAD/util.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":"e9675d534fa5b1ba","code_sha256_prefix":"e9675d534fa5b1ba","mcp_get_code":{"code_sha256":"e9675d534fa5b1ba"}},{"arxiv_id":"1806.07366","arxiv_id_is_arxiv":true,"paper":"/paper/neural-ordinary-differential-equations","title":"Neural Ordinary Differential Equations","date":"2018-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/numerics_independent_neural_odes","path":"models/models.py","file_url":"https://github.com/boschresearch/numerics_independent_neural_odes/blob/HEAD/models/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, boschresearch/numerics_independent_neural_odes, is not in the permissive set Syntology serves inline","code_sha256":"f81cc7d6c4c87870","code_sha256_prefix":"f81cc7d6c4c87870","mcp_get_code":{"code_sha256":"f81cc7d6c4c87870"}}],"record_sha256":"cf748050b031f3e8fc7b931fea0d928294c9246034833db276f277bddea0e39e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}