{"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/shape","entry":"shape","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":15,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":10,"n_papers_ran_instrument_only":2,"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":12,"n_samples_ran":10,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":2,"n_samples_unverified":2,"n_samples_fingerprinted":1,"n_places":15,"n_places_pointer_only":2,"n_places_pointer_only_link_open":1,"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":2,"ran_fixture":0,"ran":8,"unverified":2},"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":"2603.04805","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-04805","title":"Attention's Gravitational Field: A Power-Law Interpretation of Positional Correlation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"OpenNMT/OpenNMT-py","path":"onmt/modules/multi_headed_attn.py","file_url":"https://github.com/OpenNMT/OpenNMT-py/blob/HEAD/onmt/modules/multi_headed_attn.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"156ac72eda8c9323","code_sha256_prefix":"156ac72eda8c9323","mcp_get_code":{"code_sha256":"156ac72eda8c9323"}},{"arxiv_id":"2407.09809","arxiv_id_is_arxiv":true,"paper":"/paper/preserving-the-privacy-of-reward-functions-in","title":"Preserving the Privacy of Reward Functions in MDPs through Deception","date":"2024-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shshnkreddy/deceptiverl","path":"epic.py","file_url":"https://github.com/shshnkreddy/deceptiverl/blob/HEAD/epic.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, shshnkreddy/deceptiverl when it was checked","code_sha256":"8bf23ee16d057358","code_sha256_prefix":"8bf23ee16d057358","mcp_get_code":{"code_sha256":"8bf23ee16d057358"}},{"arxiv_id":"2308.13490","arxiv_id_is_arxiv":true,"paper":"/paper/tpugraphs-a-performance-prediction-dataset-on-1","title":"TpuGraphs: A Performance Prediction Dataset on Large Tensor Computational Graphs","date":"2023-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"google-research-datasets/tpu_graphs","path":"tpu_graphs/baselines/tiles/implicit.py","file_url":"https://github.com/google-research-datasets/tpu_graphs/blob/HEAD/tpu_graphs/baselines/tiles/implicit.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":"c8a97da4a2f4ae48","code_sha256_prefix":"c8a97da4a2f4ae48","mcp_get_code":{"code_sha256":"c8a97da4a2f4ae48"}},{"arxiv_id":"2110.04176","arxiv_id_is_arxiv":true,"paper":"/paper/lightweight-convolutional-neural-networks-by","title":"PHNNs: Lightweight Neural Networks via Parameterized Hypercomplex Convolutions","date":"2021-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispamm/hi2i","path":"htorch/quaternion.py","file_url":"https://github.com/ispamm/hi2i/blob/HEAD/htorch/quaternion.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":"a7e5a2da84b86174","code_sha256_prefix":"a7e5a2da84b86174","mcp_get_code":{"code_sha256":"a7e5a2da84b86174"}},{"arxiv_id":"2008.02840","arxiv_id_is_arxiv":true,"paper":"/paper/assisted-perception-optimizing-observations","title":"Assisted Perception: Optimizing Observations to Communicate State","date":"2020-08-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rddy/ASE","path":"sensei/gw_viz.py","file_url":"https://github.com/rddy/ASE/blob/HEAD/sensei/gw_viz.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":"f35cb9713634b966","code_sha256_prefix":"f35cb9713634b966","mcp_get_code":{"code_sha256":"f35cb9713634b966"}},{"arxiv_id":"2006.13900","arxiv_id_is_arxiv":true,"paper":"/paper/quantifying-differences-in-reward-functions","title":"Quantifying Differences in Reward Functions","date":"2020-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HumanCompatibleAI/evaluating-rewards","path":"src/evaluating_rewards/distances/tabular.py","file_url":"https://github.com/HumanCompatibleAI/evaluating-rewards/blob/HEAD/src/evaluating_rewards/distances/tabular.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from shshnkreddy/deceptiverl, and GitHub detected no licence in that repository when it was checked","code_sha256":"8bf23ee16d057358","code_sha256_prefix":"8bf23ee16d057358","mcp_get_code":{"code_sha256":"8bf23ee16d057358"}},{"arxiv_id":"1907.04502","arxiv_id_is_arxiv":true,"paper":"/paper/deepxde-a-deep-learning-library-for-solving","title":"DeepXDE: A deep learning library for solving differential equations","date":"2019-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PhysicsTeacher13/Deepxde","path":"deepxde/array_ops.py","file_url":"https://github.com/PhysicsTeacher13/Deepxde/blob/HEAD/deepxde/array_ops.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":"ad6ca018121d1980","code_sha256_prefix":"ad6ca018121d1980","mcp_get_code":{"code_sha256":"ad6ca018121d1980"}},{"arxiv_id":"1906.09444","arxiv_id_is_arxiv":true,"paper":"/paper/retrieving-sequential-information-for-non","title":"Retrieving Sequential Information for Non-Autoregressive Neural Machine Translation","date":"2019-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/BoN-NAT","path":"model.py","file_url":"https://github.com/ictnlp/BoN-NAT/blob/HEAD/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a6838819df62aca0","code_sha256_prefix":"a6838819df62aca0","mcp_get_code":{"code_sha256":"a6838819df62aca0"}},{"arxiv_id":"1904.09709","arxiv_id_is_arxiv":true,"paper":"/paper/stgan-a-unified-selective-transfer-network","title":"STGAN: A Unified Selective Transfer Network for Arbitrary Image Attribute Editing","date":"2019-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"csmliu/STGAN","path":"tflib/utils.py","file_url":"https://github.com/csmliu/STGAN/blob/HEAD/tflib/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":"554e9812968047de","code_sha256_prefix":"554e9812968047de","mcp_get_code":{"code_sha256":"554e9812968047de"}},{"arxiv_id":"1808.07699","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-neural-entity-linking","title":"End-to-End Neural Entity Linking","date":"2018-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dalab/end2end_neural_el","path":"code/model/util.py","file_url":"https://github.com/dalab/end2end_neural_el/blob/HEAD/code/model/util.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":"6cba6c8288c8fc1c","code_sha256_prefix":"6cba6c8288c8fc1c","mcp_get_code":{"code_sha256":"6cba6c8288c8fc1c"}},{"arxiv_id":"1710.09829","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-routing-between-capsules","title":"Dynamic Routing Between Capsules","date":"2017-10-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"naturomics/CapsLayer","path":"capslayer/ops/ops.py","file_url":"https://github.com/naturomics/CapsLayer/blob/HEAD/capslayer/ops/ops.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":"94a9d3fa58aca150","code_sha256_prefix":"94a9d3fa58aca150","mcp_get_code":{"code_sha256":"94a9d3fa58aca150"}},{"arxiv_id":"1611.06355","arxiv_id_is_arxiv":true,"paper":"/paper/invertible-conditional-gans-for-image-editing","title":"Invertible Conditional GANs for image editing","date":"2016-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nguyenquangduc2000/AttGAN","path":"tflib/utils.py","file_url":"https://github.com/nguyenquangduc2000/AttGAN/blob/HEAD/tflib/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":"554e9812968047de","code_sha256_prefix":"554e9812968047de","mcp_get_code":{"code_sha256":"554e9812968047de"}},{"arxiv_id":"1503.03832","arxiv_id_is_arxiv":true,"paper":"/paper/facenet-a-unified-embedding-for-face","title":"FaceNet: A Unified Embedding for Face Recognition and Clustering","date":"2015-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"M155K4R4/facenet","path":"fr_utils.py","file_url":"https://github.com/M155K4R4/facenet/blob/HEAD/fr_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":"70c5192cfae29a2a","code_sha256_prefix":"70c5192cfae29a2a","mcp_get_code":{"code_sha256":"70c5192cfae29a2a"}},{"arxiv_id":"1312.6114","arxiv_id_is_arxiv":true,"paper":"/paper/auto-encoding-variational-bayes","title":"Auto-Encoding Variational Bayes","date":"2013-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LynnHo/VAE-Tensorflow","path":"tflib/utils.py","file_url":"https://github.com/LynnHo/VAE-Tensorflow/blob/HEAD/tflib/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":"554e9812968047de","code_sha256_prefix":"554e9812968047de","mcp_get_code":{"code_sha256":"554e9812968047de"}},{"arxiv_id":"1202.1056","arxiv_id_is_arxiv":true,"paper":"/paper/building-a-framework-for-predictive-science","title":"Building a Framework for Predictive Science","date":null,"month_inferred_from_arxiv_id":"2012-02","title_source":"archive","repo":"vdods/vorpy","path":"vorpy/tensor.py","file_url":"https://github.com/vdods/vorpy/blob/HEAD/vorpy/tensor.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":"962f703d7a53bdd9","code_sha256_prefix":"962f703d7a53bdd9","mcp_get_code":{"code_sha256":"962f703d7a53bdd9"}}],"record_sha256":"9cc9f8eab854af805d6acdab1c9595bb8af36868cd2e842ca71509ad1bda2cb0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}