{"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/logdet","entry":"logdet","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":4,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":3,"n_places":8,"n_places_pointer_only":4,"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":1,"ran_fixture":1,"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":"2603.01047","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01047","title":"Evaluating GFlowNet from partial episodes for stable and flexible policy-based training","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"niupuhua1234/Sub-EB","path":"gfn-subeb/data_dag/scores/base.py","file_url":"https://github.com/niupuhua1234/Sub-EB/blob/HEAD/gfn-subeb/data_dag/scores/base.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cb1419ec492cafd","code_sha256_prefix":"0cb1419ec492cafd","mcp_get_code":{"code_sha256":"0cb1419ec492cafd"}},{"arxiv_id":"2603.01047","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-01047","title":"Evaluating GFlowNet from partial episodes for stable and flexible policy-based training","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"niupuhua1234/Sub-EB","path":"gfn-subeb/data_dag/scores/base_torch.py","file_url":"https://github.com/niupuhua1234/Sub-EB/blob/HEAD/gfn-subeb/data_dag/scores/base_torch.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":"52ac2620e1dc4258","code_sha256_prefix":"52ac2620e1dc4258","mcp_get_code":{"code_sha256":"52ac2620e1dc4258"}},{"arxiv_id":"2602.08197","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-08197","title":"Interpretable Dynamic Network Modeling of Tensor Time Series via Kronecker Time-Varying Graphical Lasso","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"Higashiguchi-Shingo/KTVGL","path":"src/ktvgl/methods/kronecker_tvgl/kroneckergl.py","file_url":"https://github.com/Higashiguchi-Shingo/KTVGL/blob/HEAD/src/ktvgl/methods/kronecker_tvgl/kroneckergl.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, Higashiguchi-Shingo/KTVGL when it was checked","code_sha256":"5e1eeac923d86178","code_sha256_prefix":"5e1eeac923d86178","mcp_get_code":{"code_sha256":"5e1eeac923d86178"}},{"arxiv_id":"2410.00965","arxiv_id_is_arxiv":true,"paper":"/paper/a-data-driven-discovery-of-the-causal","title":"Causal Discovery in Astrophysics: Unraveling Supermassive Black Hole and Galaxy Coevolution","date":null,"month_inferred_from_arxiv_id":"2024-10","title_source":"archive","repo":"ZehaoJin/causalbh","path":"cal_bge_cpu.py","file_url":"https://github.com/ZehaoJin/causalbh/blob/HEAD/cal_bge_cpu.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC-BY-4.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"CC-BY-4.0, as GitHub detects it on this paper's repository, ZehaoJin/causalbh, is not in the permissive set Syntology serves inline","code_sha256":"0cb1419ec492cafd","code_sha256_prefix":"0cb1419ec492cafd","mcp_get_code":{"code_sha256":"0cb1419ec492cafd"}},{"arxiv_id":"2408.05885","arxiv_id_is_arxiv":true,"paper":"/paper/gflownet-training-by-policy-gradients","title":"GFlowNet Training by Policy Gradients","date":"2024-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niupuhua1234/gfn-pg","path":"gfn-pg/data_dag/scores/base.py","file_url":"https://github.com/niupuhua1234/gfn-pg/blob/HEAD/gfn-pg/data_dag/scores/base.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, niupuhua1234/gfn-pg when it was checked","code_sha256":"0cb1419ec492cafd","code_sha256_prefix":"0cb1419ec492cafd","mcp_get_code":{"code_sha256":"0cb1419ec492cafd"}},{"arxiv_id":"2408.05885","arxiv_id_is_arxiv":true,"paper":"/paper/gflownet-training-by-policy-gradients","title":"GFlowNet Training by Policy Gradients","date":"2024-08-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niupuhua1234/gfn-pg","path":"gfn-pg/data_dag/scores/base_torch.py","file_url":"https://github.com/niupuhua1234/gfn-pg/blob/HEAD/gfn-pg/data_dag/scores/base_torch.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, niupuhua1234/gfn-pg when it was checked","code_sha256":"52ac2620e1dc4258","code_sha256_prefix":"52ac2620e1dc4258","mcp_get_code":{"code_sha256":"52ac2620e1dc4258"}},{"arxiv_id":"2202.13903","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-structure-learning-with-generative","title":"Bayesian Structure Learning with Generative Flow Networks","date":"2022-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tristandeleu/jax-dag-gflownet","path":"dag_gflownet/scores/bge_score.py","file_url":"https://github.com/tristandeleu/jax-dag-gflownet/blob/HEAD/dag_gflownet/scores/bge_score.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0cb1419ec492cafd","code_sha256_prefix":"0cb1419ec492cafd","mcp_get_code":{"code_sha256":"0cb1419ec492cafd"}},{"arxiv_id":"1802.10031","arxiv_id_is_arxiv":true,"paper":"/paper/the-mirage-of-action-dependent-baselines-in","title":"The Mirage of Action-Dependent Baselines in Reinforcement Learning","date":"2018-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brain-research/mirage-rl","path":"lqg/lqr.py","file_url":"https://github.com/brain-research/mirage-rl/blob/HEAD/lqg/lqr.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b6aa5754504b157d","code_sha256_prefix":"b6aa5754504b157d","mcp_get_code":{"code_sha256":"b6aa5754504b157d"}}],"record_sha256":"db7483e326ed339b1d4f7c2b7fb53724bef075e561de55878614cb309d436fc0","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}