{"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/kronecker","entry":"kronecker","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":6,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":6,"n_places_pointer_only":2,"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":2,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":2,"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":"2103.16178","arxiv_id_is_arxiv":true,"paper":"/paper/learnable-graph-matching-incorporating-graph","title":"Learnable Graph Matching: Incorporating Graph Partitioning with Deep Feature Learning for Multiple Object Tracking","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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":"fafc95a7ac88ef36","code_sha256_prefix":"fafc95a7ac88ef36","mcp_get_code":{"code_sha256":"fafc95a7ac88ef36"}},{"arxiv_id":"2009.13075","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-image-deraining-using","title":"Semi-Supervised Image Deraining using Gaussian Processes","date":"2020-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rajeevyasarla/Syn2Real","path":"GP.py","file_url":"https://github.com/rajeevyasarla/Syn2Real/blob/HEAD/GP.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fafc95a7ac88ef36","code_sha256_prefix":"fafc95a7ac88ef36","mcp_get_code":{"code_sha256":"fafc95a7ac88ef36"}},{"arxiv_id":"2009.01269","arxiv_id_is_arxiv":true,"paper":"/paper/can-single-neurons-solve-mnist-the","title":"Can Single Neurons Solve MNIST? The Computational Power of Biological Dendritic Trees","date":null,"month_inferred_from_arxiv_id":"2020-09","title_source":"archive","repo":"ilennaj/ktree","path":"custompackage/load_architecture.py","file_url":"https://github.com/ilennaj/ktree/blob/HEAD/custompackage/load_architecture.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, ilennaj/ktree when it was checked","code_sha256":"e6f0de3ea55ece55","code_sha256_prefix":"e6f0de3ea55ece55","mcp_get_code":{"code_sha256":"e6f0de3ea55ece55"}},{"arxiv_id":"2004.04197","arxiv_id_is_arxiv":true,"paper":"/paper/quantum-approximate-optimization-of-non","title":"Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor","date":null,"month_inferred_from_arxiv_id":"2020-04","title_source":"archive","repo":"CDL-Quantum/Hackathon2020","path":"QBC/quantum_aware_optims.py","file_url":"https://github.com/CDL-Quantum/Hackathon2020/blob/HEAD/QBC/quantum_aware_optims.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":"bcb2a85323de4b3a","code_sha256_prefix":"bcb2a85323de4b3a","mcp_get_code":{"code_sha256":"bcb2a85323de4b3a"}},{"arxiv_id":"2002.08376","arxiv_id_is_arxiv":true,"paper":"/paper/a-differentiable-programming-method-for","title":"A differentiable programming method for quantum control","date":null,"month_inferred_from_arxiv_id":"2020-02","title_source":"archive","repo":"frankschae/A-differentiable-programming-method-for-quantum-control","path":"spin_chain/GHZ/spinchain.py","file_url":"https://github.com/frankschae/A-differentiable-programming-method-for-quantum-control/blob/HEAD/spin_chain/GHZ/spinchain.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":"5ed591024be2e265","code_sha256_prefix":"5ed591024be2e265","mcp_get_code":{"code_sha256":"5ed591024be2e265"}},{"arxiv_id":"1503.05671","arxiv_id_is_arxiv":true,"paper":"/paper/optimizing-neural-networks-with-kronecker","title":"Optimizing Neural Networks with Kronecker-factored Approximate Curvature","date":"2015-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tfjgeorge/nngeometry","path":"nngeometry/object/pspace.py","file_url":"https://github.com/tfjgeorge/nngeometry/blob/HEAD/nngeometry/object/pspace.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8f96d29b7dd6bd0b","code_sha256_prefix":"8f96d29b7dd6bd0b","mcp_get_code":{"code_sha256":"8f96d29b7dd6bd0b"}}],"record_sha256":"78fbc7498d816452a093f5e56c7e5af63151665fe559274bc2ff0707153d1bc4","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}