{"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/base-model","entry":"base_model","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":2,"n_papers_ran_no_instrument_failure":1,"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":6,"n_samples_ran":2,"n_samples_constructed":1,"n_samples_ran_checked":1,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":6,"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":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":4},"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":"2301.11113","arxiv_id_is_arxiv":true,"paper":"/paper/finding-regions-of-counterfactual","title":"Finding Regions of Counterfactual Explanations via Robust Optimization","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"donato-maragno/robust-ce","path":"rce/generate_ce.py","file_url":"https://github.com/donato-maragno/robust-ce/blob/HEAD/rce/generate_ce.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e508ba9860638bdd","code_sha256_prefix":"e508ba9860638bdd","mcp_get_code":{"code_sha256":"e508ba9860638bdd"}},{"arxiv_id":"2203.02721","arxiv_id_is_arxiv":true,"paper":"/paper/consistent-representation-learning-for","title":"Consistent Representation Learning for Continual Relation Extraction","date":"2022-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fd2014cl/RP-CRE","path":"model/memory_network/attention_memory_simplified.py","file_url":"https://github.com/fd2014cl/RP-CRE/blob/HEAD/model/memory_network/attention_memory_simplified.py","status":"ran","verification_level":1,"contract_check":null,"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, fd2014cl/RP-CRE when it was checked","code_sha256":"e1833fd60f20049a","code_sha256_prefix":"e1833fd60f20049a","mcp_get_code":{"code_sha256":"e1833fd60f20049a"}},{"arxiv_id":"2012.15000","arxiv_id_is_arxiv":true,"paper":"/paper/deepsphere-a-graph-based-spherical-cnn-1","title":"DeepSphere: a graph-based spherical CNN","date":"2020-12-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deepsphere/deepsphere-cosmo-tf1","path":"deepsphere/models.py","file_url":"https://github.com/deepsphere/deepsphere-cosmo-tf1/blob/HEAD/deepsphere/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bc9700d8a529944a","code_sha256_prefix":"bc9700d8a529944a","mcp_get_code":{"code_sha256":"bc9700d8a529944a"}},{"arxiv_id":"2006.15646","arxiv_id_is_arxiv":true,"paper":"/paper/characterizing-the-expressive-power-of","title":"Expressive Power of Invariant and Equivariant Graph Neural Networks","date":"2020-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlelarge/graph_neural_net","path":"models/blocks_emb.py","file_url":"https://github.com/mlelarge/graph_neural_net/blob/HEAD/models/blocks_emb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa2de678f6c52280","code_sha256_prefix":"aa2de678f6c52280","mcp_get_code":{"code_sha256":"aa2de678f6c52280"}},{"arxiv_id":"2006.15646","arxiv_id_is_arxiv":true,"paper":"/paper/characterizing-the-expressive-power-of","title":"Expressive Power of Invariant and Equivariant Graph Neural Networks","date":"2020-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlelarge/graph_neural_net","path":"models/blocks_emb.py","file_url":"https://github.com/mlelarge/graph_neural_net/blob/HEAD/models/blocks_emb.py","status":"unverified","verification_level":0,"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":"ca9b98d9883fa747","code_sha256_prefix":"ca9b98d9883fa747","mcp_get_code":{"code_sha256":"ca9b98d9883fa747"}},{"arxiv_id":"1606.09375","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-on-graphs-with","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","date":"2016-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mdeff/cnn_graph","path":"lib/models.py","file_url":"https://github.com/mdeff/cnn_graph/blob/HEAD/lib/models.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fcd0e1963d1c958e","code_sha256_prefix":"fcd0e1963d1c958e","mcp_get_code":{"code_sha256":"fcd0e1963d1c958e"}}],"record_sha256":"2c1d57be392482561846f7ded835e06104e4ab6144c6f8c3a643b46b06e48c2a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}