{"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/check-symmetric","entry":"check_symmetric","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":1,"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":2,"ran_draft_wrong":0,"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":"2406.13828","arxiv_id_is_arxiv":true,"paper":"/paper/neuro-symbolic-training-for-reasoning-over","title":"Neuro-symbolic Training for Reasoning over Spatial Language","date":"2024-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"premsrit/SPARTUNQChain","path":"utils.py","file_url":"https://github.com/premsrit/SPARTUNQChain/blob/HEAD/utils.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, premsrit/SPARTUNQChain when it was checked","code_sha256":"cc414746f937cc4c","code_sha256_prefix":"cc414746f937cc4c","mcp_get_code":{"code_sha256":"cc414746f937cc4c"}},{"arxiv_id":"2203.09137","arxiv_id_is_arxiv":true,"paper":"/paper/global-convergence-of-maml-and-theory","title":"Global Convergence of MAML and Theory-Inspired Neural Architecture Search for Few-Shot Learning","date":"2022-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YiteWang/MetaNTK-NAS","path":"lib/procedures/ntk_opacus.py","file_url":"https://github.com/YiteWang/MetaNTK-NAS/blob/HEAD/lib/procedures/ntk_opacus.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"99af528f6bc21a28","code_sha256_prefix":"99af528f6bc21a28","mcp_get_code":{"code_sha256":"99af528f6bc21a28"}},{"arxiv_id":"2108.03225","arxiv_id_is_arxiv":true,"paper":"/paper/glass-geometric-latent-augmentation-for-shape","title":"GLASS: Geometric Latent Augmentation for Shape Spaces","date":"2021-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sanjeevmk/glass","path":"Src/Hessian_bottomk.py","file_url":"https://github.com/sanjeevmk/glass/blob/HEAD/Src/Hessian_bottomk.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":"cd56d2b59e5b89fc","code_sha256_prefix":"cd56d2b59e5b89fc","mcp_get_code":{"code_sha256":"cd56d2b59e5b89fc"}},{"arxiv_id":"2105.14937","arxiv_id_is_arxiv":true,"paper":"/paper/safe-pontryagin-differentiable-programming","title":"Safe Pontryagin Differentiable Programming","date":"2021-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wanxinjin/safe-pdp","path":"SafePDP/SafePDP.py","file_url":"https://github.com/wanxinjin/safe-pdp/blob/HEAD/SafePDP/SafePDP.py","status":"ran_violates","verification_level":2,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2869210c23b21867","code_sha256_prefix":"2869210c23b21867","mcp_get_code":{"code_sha256":"2869210c23b21867"}},{"arxiv_id":"1803.06272","arxiv_id_is_arxiv":true,"paper":"/paper/graph-partition-neural-networks-for-semi","title":"Graph Partition Neural Networks for Semi-Supervised Classification","date":"2018-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/graph-partition-neural-network-samples","path":"gpnn/utils/spectral_graph_partition.py","file_url":"https://github.com/Microsoft/graph-partition-neural-network-samples/blob/HEAD/gpnn/utils/spectral_graph_partition.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":"13b061acfb93da40","code_sha256_prefix":"13b061acfb93da40","mcp_get_code":{"code_sha256":"13b061acfb93da40"}}],"record_sha256":"7efe44f62b4d90360633406726fc8940689d55d1c5213009668aa00f5eae08c4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}