{"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/softplus-inverse","entry":"softplus_inverse","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":6,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":10,"n_places_pointer_only":7,"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":1,"ran_draft_wrong":2,"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":"2503.01822","arxiv_id_is_arxiv":true,"paper":"/paper/projecting-assumptions-the-duality-between","title":"Projecting Assumptions: The Duality Between Sparse Autoencoders and Concept Geometry","date":"2025-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EkdeepSLubana/spadeFormalGrammars","path":"sae/saes.py","file_url":"https://github.com/EkdeepSLubana/spadeFormalGrammars/blob/HEAD/sae/saes.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":"c22f704a96321b8f","code_sha256_prefix":"c22f704a96321b8f","mcp_get_code":{"code_sha256":"c22f704a96321b8f"}},{"arxiv_id":"2502.01171","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-scalable-density-functional","title":"Efficient and Scalable Density Functional Theory Hamiltonian Prediction through Adaptive Sparsity","date":"2025-02-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/sphnet","path":"src/models/SPHNet.py","file_url":"https://github.com/microsoft/sphnet/blob/HEAD/src/models/SPHNet.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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 divelab/AIRS, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"bc43b93c22207f08","code_sha256_prefix":"bc43b93c22207f08","mcp_get_code":{"code_sha256":"bc43b93c22207f08"}},{"arxiv_id":"2406.03794","arxiv_id_is_arxiv":true,"paper":"/paper/infusing-self-consistency-into-density","title":"Infusing Self-Consistency into Density Functional Theory Hamiltonian Prediction via Deep Equilibrium Models","date":"2024-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zun-wang/deqhnet","path":"src/QHNet/models/DEQHNet.py","file_url":"https://github.com/zun-wang/deqhnet/blob/HEAD/src/QHNet/models/DEQHNet.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zun-wang/deqhnet when it was checked","code_sha256":"bc43b93c22207f08","code_sha256_prefix":"bc43b93c22207f08","mcp_get_code":{"code_sha256":"bc43b93c22207f08"}},{"arxiv_id":"2312.16560","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-message-passing-a-general-framework","title":"Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreaching","date":"2023-12-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nec-research/adaptive-message-passing","path":"distribution.py","file_url":"https://github.com/nec-research/adaptive-message-passing/blob/HEAD/distribution.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, nec-research/adaptive-message-passing when it was checked","code_sha256":"e8c84302100af2af","code_sha256_prefix":"e8c84302100af2af","mcp_get_code":{"code_sha256":"e8c84302100af2af"}},{"arxiv_id":"2306.09549","arxiv_id_is_arxiv":true,"paper":"/paper/qh9-a-quantum-hamiltonian-prediction-1","title":"QH9: A Quantum Hamiltonian Prediction Benchmark for QM9 Molecules","date":"2023-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divelab/AIRS","path":"OpenDFT/QHBench/QH9/models/QHNet.py","file_url":"https://github.com/divelab/AIRS/blob/HEAD/OpenDFT/QHBench/QH9/models/QHNet.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, divelab/AIRS, is not in the permissive set Syntology serves inline","code_sha256":"bc43b93c22207f08","code_sha256_prefix":"bc43b93c22207f08","mcp_get_code":{"code_sha256":"bc43b93c22207f08"}},{"arxiv_id":"2306.04922","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-and-equivariant-graph-networks-for","title":"Efficient and Equivariant Graph Networks for Predicting Quantum Hamiltonian","date":"2023-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"bc43b93c22207f08","code_sha256_prefix":"bc43b93c22207f08","mcp_get_code":{"code_sha256":"bc43b93c22207f08"}},{"arxiv_id":"2209.10091","arxiv_id_is_arxiv":true,"paper":"/paper/variational-inference-for-infinitely-deep","title":"Variational Inference for Infinitely Deep Neural Networks","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anazaret/unbounded-depth-neural-networks","path":"src/models.py","file_url":"https://github.com/anazaret/unbounded-depth-neural-networks/blob/HEAD/src/models.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, anazaret/unbounded-depth-neural-networks when it was checked","code_sha256":"2741eba57a8334ef","code_sha256_prefix":"2741eba57a8334ef","mcp_get_code":{"code_sha256":"2741eba57a8334ef"}},{"arxiv_id":"2209.10091","arxiv_id_is_arxiv":true,"paper":"/paper/variational-inference-for-infinitely-deep","title":"Variational Inference for Infinitely Deep Neural Networks","date":"2022-09-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"anazaret/unbounded-depth-neural-networks","path":"src/models.py","file_url":"https://github.com/anazaret/unbounded-depth-neural-networks/blob/HEAD/src/models.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, anazaret/unbounded-depth-neural-networks when it was checked","code_sha256":"e8c84302100af2af","code_sha256_prefix":"e8c84302100af2af","mcp_get_code":{"code_sha256":"e8c84302100af2af"}},{"arxiv_id":"1902.08408","arxiv_id_is_arxiv":true,"paper":"/paper/physnet-a-neural-network-for-predicting","title":"PhysNet: A Neural Network for Predicting Energies, Forces, Dipole Moments and Partial Charges","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"MMunibas/PhysNet","path":"neural_network/layers/RBFLayer.py","file_url":"https://github.com/MMunibas/PhysNet/blob/HEAD/neural_network/layers/RBFLayer.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":"b924882256391469","code_sha256_prefix":"b924882256391469","mcp_get_code":{"code_sha256":"b924882256391469"}},{"arxiv_id":"1902.08408","arxiv_id_is_arxiv":true,"paper":"/paper/physnet-a-neural-network-for-predicting","title":"PhysNet: A Neural Network for Predicting Energies, Forces, Dipole Moments and Partial Charges","date":null,"month_inferred_from_arxiv_id":"2019-02","title_source":"archive","repo":"MeuwlyGroup/PhysNet","path":"neural_network/NeuralNetwork.py","file_url":"https://github.com/MeuwlyGroup/PhysNet/blob/HEAD/neural_network/NeuralNetwork.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":"b898cbbdb9862294","code_sha256_prefix":"b898cbbdb9862294","mcp_get_code":{"code_sha256":"b898cbbdb9862294"}}],"record_sha256":"6609ffc014446c59f6d33f95ba69c7ddc12d4832fade9114eca21af479684bf2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}