{"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/he-orthogonal-init","entry":"he_orthogonal_init","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":7,"n_papers_ran_no_instrument_failure":3,"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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":7,"n_places_pointer_only":6,"n_places_pointer_only_link_open":2,"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":1,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":0,"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":"2608.30682","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30682","title":"Learning Materials Properties from Scarce Labels and Unlabeled Crystals","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"littlepeachs/SemiMat","path":"models/dense.py","file_url":"https://github.com/littlepeachs/SemiMat/blob/HEAD/models/dense.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from arthurkosmala/EwaldMP, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"c94ad99c5f6191c3","code_sha256_prefix":"c94ad99c5f6191c3","mcp_get_code":{"code_sha256":"c94ad99c5f6191c3"}},{"arxiv_id":"2410.07981","arxiv_id_is_arxiv":true,"paper":"/paper/molmix-a-simple-yet-effective-baseline-for","title":"MolMix: A Simple Yet Effective Baseline for Multimodal Molecular Representation Learning","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andreimano/MolMix","path":"layers/gemnet_layers/base_layers.py","file_url":"https://github.com/andreimano/MolMix/blob/HEAD/layers/gemnet_layers/base_layers.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from arthurkosmala/EwaldMP, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"c94ad99c5f6191c3","code_sha256_prefix":"c94ad99c5f6191c3","mcp_get_code":{"code_sha256":"c94ad99c5f6191c3"}},{"arxiv_id":"2410.06665","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-multi-permutation-equivariance","title":"Revisiting Multi-Permutation Equivariance through the Lens of Irreducible Representations","date":"2024-10-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yonatansverdlov/irreducible-representations-of-deep-weight-spaces","path":"graph_matching/net/layer_utils.py","file_url":"https://github.com/yonatansverdlov/irreducible-representations-of-deep-weight-spaces/blob/HEAD/graph_matching/net/layer_utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yonatansverdlov/irreducible-representations-of-deep-weight-spaces when it was checked","code_sha256":"1b69da670a8b4e1f","code_sha256_prefix":"1b69da670a8b4e1f","mcp_get_code":{"code_sha256":"1b69da670a8b4e1f"}},{"arxiv_id":"2406.14347","arxiv_id_is_arxiv":true,"paper":"/paper/nabla-2-dft-a-universal-quantum-chemistry","title":"$\\nabla^2$DFT: A Universal Quantum Chemistry Dataset of Drug-Like Molecules and a Benchmark for Neural Network Potentials","date":"2024-06-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AIRI-Institute/nablaDFT","path":"nablaDFT/gemnet_oc/initializers.py","file_url":"https://github.com/AIRI-Institute/nablaDFT/blob/HEAD/nablaDFT/gemnet_oc/initializers.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":"9bd42e6dd2f18137","code_sha256_prefix":"9bd42e6dd2f18137","mcp_get_code":{"code_sha256":"9bd42e6dd2f18137"}},{"arxiv_id":"2406.03141","arxiv_id_is_arxiv":true,"paper":"/paper/floating-anchor-diffusion-model-for-multi","title":"Floating Anchor Diffusion Model for Multi-motif Scaffolding","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aim-uofa/FADiff","path":"model/layers.py","file_url":"https://github.com/aim-uofa/FADiff/blob/HEAD/model/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aim-uofa/FADiff when it was checked","code_sha256":"e2f0fc69bf175683","code_sha256_prefix":"e2f0fc69bf175683","mcp_get_code":{"code_sha256":"e2f0fc69bf175683"}},{"arxiv_id":"2405.20313","arxiv_id_is_arxiv":true,"paper":"/paper/sequence-augmented-se-3-flow-matching-for","title":"Sequence-Augmented SE(3)-Flow Matching For Conditional Protein Backbone Generation","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dreamfold/foldflow","path":"foldflow/models/components/layers.py","file_url":"https://github.com/dreamfold/foldflow/blob/HEAD/foldflow/models/components/layers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, dreamfold/foldflow when it was checked","code_sha256":"e2f0fc69bf175683","code_sha256_prefix":"e2f0fc69bf175683","mcp_get_code":{"code_sha256":"e2f0fc69bf175683"}},{"arxiv_id":"2303.04791","arxiv_id_is_arxiv":true,"paper":"/paper/ewald-based-long-range-message-passing-for","title":"Ewald-based Long-Range Message Passing for Molecular Graphs","date":"2023-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arthurkosmala/EwaldMP","path":"ocpmodels/models/ewald_block.py","file_url":"https://github.com/arthurkosmala/EwaldMP/blob/HEAD/ocpmodels/models/ewald_block.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, arthurkosmala/EwaldMP (NOASSERTION)","code_sha256":"c94ad99c5f6191c3","code_sha256_prefix":"c94ad99c5f6191c3","mcp_get_code":{"code_sha256":"c94ad99c5f6191c3"}}],"record_sha256":"eb1d7a42aeec0fde0579293188a83dd92d4f71eee3c3b1f9d0d0400fc851549a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}