{"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/integrate","entry":"integrate","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":4,"n_papers_ran_no_instrument_failure":4,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":8,"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":0,"ran_fixture":0,"ran":3,"unverified":3},"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":"2306.10161","arxiv_id_is_arxiv":true,"paper":"/paper/building-the-bridge-of-schrodinger-a-1","title":"Building the Bridge of Schrödinger: A Continuous Entropic Optimal Transport Benchmark","date":"2023-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngushchin/entropicotbenchmark","path":"baselines/EntropicNeuralOptimalTransport/src/enot.py","file_url":"https://github.com/ngushchin/entropicotbenchmark/blob/HEAD/baselines/EntropicNeuralOptimalTransport/src/enot.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":"3add5b29ad2cbd24","code_sha256_prefix":"3add5b29ad2cbd24","mcp_get_code":{"code_sha256":"3add5b29ad2cbd24"}},{"arxiv_id":"2301.13510","arxiv_id_is_arxiv":true,"paper":"/paper/monocular-scene-reconstruction-with-3d-sdf","title":"3D Former: Monocular Scene Reconstruction with 3D SDF Transformers","date":"2023-01-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alibaba-damo-academy/former3d","path":"former3d/tsdf_fusion.py","file_url":"https://github.com/alibaba-damo-academy/former3d/blob/HEAD/former3d/tsdf_fusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, alibaba-damo-academy/former3d, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"fecd5f220c505215","code_sha256_prefix":"fecd5f220c505215","mcp_get_code":{"code_sha256":"fecd5f220c505215"}},{"arxiv_id":"2211.01156","arxiv_id_is_arxiv":true,"paper":"/paper/entropic-neural-optimal-transport-via-1","title":"Entropic Neural Optimal Transport via Diffusion Processes","date":"2022-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ngushchin/entropicneuraloptimaltransport","path":"src/enot.py","file_url":"https://github.com/ngushchin/entropicneuraloptimaltransport/blob/HEAD/src/enot.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":"3add5b29ad2cbd24","code_sha256_prefix":"3add5b29ad2cbd24","mcp_get_code":{"code_sha256":"3add5b29ad2cbd24"}},{"arxiv_id":"2205.14568","arxiv_id_is_arxiv":true,"paper":"/paper/calibrated-predictive-distributions-via","title":"Towards Instance-Wise Calibration: Local Amortized Diagnostics and Reshaping of Conditional Densities (LADaR)","date":"2022-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lee-group-cmu/cal-pit","path":"src/calpit/nn/umnn/NeuralIntegral.py","file_url":"https://github.com/lee-group-cmu/cal-pit/blob/HEAD/src/calpit/nn/umnn/NeuralIntegral.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":"f10bf9b7644b9a05","code_sha256_prefix":"f10bf9b7644b9a05","mcp_get_code":{"code_sha256":"f10bf9b7644b9a05"}},{"arxiv_id":"2205.14568","arxiv_id_is_arxiv":true,"paper":"/paper/calibrated-predictive-distributions-via","title":"Towards Instance-Wise Calibration: Local Amortized Diagnostics and Reshaping of Conditional Densities (LADaR)","date":"2022-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lee-group-cmu/cal-pit","path":"src/calpit/nn/umnn/ParallelNeuralIntegral.py","file_url":"https://github.com/lee-group-cmu/cal-pit/blob/HEAD/src/calpit/nn/umnn/ParallelNeuralIntegral.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":"84a59e5fddc7a99f","code_sha256_prefix":"84a59e5fddc7a99f","mcp_get_code":{"code_sha256":"84a59e5fddc7a99f"}},{"arxiv_id":"2112.00236","arxiv_id_is_arxiv":true,"paper":"/paper/vortx-volumetric-3d-reconstruction-with","title":"VoRTX: Volumetric 3D Reconstruction With Transformers for Voxelwise View Selection and Fusion","date":"2021-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noahstier/vortx","path":"vortx/tsdf_fusion.py","file_url":"https://github.com/noahstier/vortx/blob/HEAD/vortx/tsdf_fusion.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 alibaba-damo-academy/former3d, and MIT, as GitHub detects it on that repository, is in the permissive set, but a licence decision keeps the body a pointer: its licence file names an outside party, so it may cover vendored code rather than the repository owner's files (recorded as pointer:licence_names_third_party_corporation)","code_sha256":"fecd5f220c505215","code_sha256_prefix":"fecd5f220c505215","mcp_get_code":{"code_sha256":"fecd5f220c505215"}},{"arxiv_id":"1805.07411","arxiv_id_is_arxiv":true,"paper":"/paper/discovery-of-nonlinear-multiscale-systems","title":"Discovery of Nonlinear Multiscale Systems: Sampling Strategies and Embeddings","date":null,"month_inferred_from_arxiv_id":"2018-05","title_source":"archive","repo":"kpchamp/MultiscaleDiscovery","path":"utils/utils.py","file_url":"https://github.com/kpchamp/MultiscaleDiscovery/blob/HEAD/utils/utils.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":"51ec96927f21771b","code_sha256_prefix":"51ec96927f21771b","mcp_get_code":{"code_sha256":"51ec96927f21771b"}},{"arxiv_id":"1703.04247","arxiv_id_is_arxiv":true,"paper":"/paper/deepfm-a-factorization-machine-based-neural","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","date":"2017-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"baiyimeng/umc","path":"calib/ParallelNeuralIntegral.py","file_url":"https://github.com/baiyimeng/umc/blob/HEAD/calib/ParallelNeuralIntegral.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":"152b5034b4ef794e","code_sha256_prefix":"152b5034b4ef794e","mcp_get_code":{"code_sha256":"152b5034b4ef794e"}}],"record_sha256":"8646cc6145722ae501d919a4786ef08948e3004c2b4ba9ed51e0bd771901a6eb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}