{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","short_pith_number":"pith:SWVCSM5Z","canonical_record":{"source":{"id":"2607.07840","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-08T18:18:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fa6bdca69ffb6285112c9f244c49626f38cec6d24e3f7e488782b537080d2e4e","abstract_canon_sha256":"c02e00ec46636eee05af4e22cae78af1b3fd88e9b6ae55e10efd4d3351cc3ae5"},"schema_version":"1.0"},"canonical_sha256":"95aa2933b9a3ef65e95c843a20277724ce20f1cd2a233d9fb4b1ac3db4d1e5ec","source":{"kind":"arxiv","id":"2607.07840","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07840","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07840v1","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07840","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"SWVCSM5ZUPXW","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"SWVCSM5ZUPXWL2K4","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"SWVCSM5Z","created_at":"2026-07-10T00:19:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","target":"record","payload":{"canonical_record":{"source":{"id":"2607.07840","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-08T18:18:41Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"fa6bdca69ffb6285112c9f244c49626f38cec6d24e3f7e488782b537080d2e4e","abstract_canon_sha256":"c02e00ec46636eee05af4e22cae78af1b3fd88e9b6ae55e10efd4d3351cc3ae5"},"schema_version":"1.0"},"canonical_sha256":"95aa2933b9a3ef65e95c843a20277724ce20f1cd2a233d9fb4b1ac3db4d1e5ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-10T00:19:02.787159Z","signature_b64":"6nlujv0zsCAJZmhbcXVT4UPThVkm823PG3n98LtP+o/CO7NsCzDfd+7VZ405d4vQqQAFuDgx6V6Aazxsl0TCDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95aa2933b9a3ef65e95c843a20277724ce20f1cd2a233d9fb4b1ac3db4d1e5ec","last_reissued_at":"2026-07-10T00:19:02.786752Z","signature_status":"signed_v1","first_computed_at":"2026-07-10T00:19:02.786752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.07840","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T00:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mU0XhEhYVQjEQLk79CA4ZJo9CsFbis4umc9Bm867D2jNiyVUCBuMy+5ce0/jMumnUVwFnhjG9hEHf6MznR2JAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:17:24.954558Z"},"content_sha256":"8783689faf3ba345da77fd0397c4db5731b323d4b820d5b7c6c1dc555aa49f47","schema_version":"1.0","event_id":"sha256:8783689faf3ba345da77fd0397c4db5731b323d4b820d5b7c6c1dc555aa49f47"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GradInf: Gradient Estimation as Probabilistic Inference","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.PL","authors_text":"Alexander K. Lew, Feras A. Saad, Gaurav Arya, Mathieu Huot, Moritz Schauer","submitted_at":"2026-07-08T18:18:41Z","abstract_excerpt":"Gradient estimation -- the task of computing the gradient of the expected value of a probabilistic program -- has diverse applications in scientific computing, but is notoriously difficult because of issues such as high-dimensional integration, discrete random choices, and complex stochastic dependencies. This article introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs. Gradient inference rests on a formal reduction from a gradient estimation problem to a closely related probabilistic inference problem, whose solution c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07840","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.07840/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T00:19:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Hn7AgLcJ33sbDQly6nr0ShqLYb5qsGTRAT4iN2AjWHgQ0WFshPAKRML4h88zuCMQl8ACI0IKwT6aB6TzRJkDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:17:24.955081Z"},"content_sha256":"761e88e0a280f070f41191393c456fd98b04351dbbf3a33b214a2234e81c2054","schema_version":"1.0","event_id":"sha256:761e88e0a280f070f41191393c456fd98b04351dbbf3a33b214a2234e81c2054"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","target":"integrity","payload":{"note":"Identifier '10.5555/3455716.3455848' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Shakir Mohamed, Mihaela Rosca, Michael Figurnov, and Andriy Mnih. 2020. Monte Carlo Gradient Estimation in Machine Learning.Journal of Machine Learning Research21, 132 (2020), 1–62. https://doi.org/10.5555/3455716.3455848","arxiv_id":"2607.07840","detector":"doi_compliance","evidence":{"doi":"10.5555/3455716.3455848","arxiv_id":null,"ref_index":66,"raw_excerpt":"Shakir Mohamed, Mihaela Rosca, Michael Figurnov, and Andriy Mnih. 2020. Monte Carlo Gradient Estimation in Machine Learning.Journal of Machine Learning Research21, 132 (2020), 1–62. https://doi.org/10.5555/3455716.3455848","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":66,"audited_at":"2026-07-10T16:58:12.036822Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3455716.3455848","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"46482f79f97dcaffc843163fc41b18022064552abc083a584aee403c146155e9","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12026,"payload_sha256":"8e5a05fd0d20ad7dc0c8e5d36df219c55629fe01344c3ba3948847cffd024d7f","signature_b64":"9ZTckfgjcJR9gq8KVuiE1Wy4gQ9aq7Ad3UL5hz5KjJBiFEqfLvGxmz9+tA8Y2oCW7XA6zakwv8m+EVx/rNh1AA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T16:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cwF08OR58CSaiRmXGBoUgJ+sNfOFVgSKp+Hri5+J2w4aLykYwOyGZCPGn4XawYlMz0RKRR/RKGgWUdH76UXxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:17:24.958835Z"},"content_sha256":"92fc529a56a6b99e124bad50f44fa633ed3d7da3391f1ed5d14d11d453b45910","schema_version":"1.0","event_id":"sha256:92fc529a56a6b99e124bad50f44fa633ed3d7da3391f1ed5d14d11d453b45910"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","target":"integrity","payload":{"note":"Identifier '10.5555/3545946.3598851' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Ayush Chopra, Alexander Rodríguez, Jayakumar Subramanian, Arnau Quera-Bofarull, Balaji Krishnamurthy, B. Aditya Prakash, and Ramesh Raskar. 2023. Differentiable Agent-based Epidemiology. InProceedings of the 2023 International Conference on","arxiv_id":"2607.07840","detector":"doi_compliance","evidence":{"doi":"10.5555/3545946.3598851","arxiv_id":null,"ref_index":19,"raw_excerpt":"Ayush Chopra, Alexander Rodríguez, Jayakumar Subramanian, Arnau Quera-Bofarull, Balaji Krishnamurthy, B. Aditya Prakash, and Ramesh Raskar. 2023. Differentiable Agent-based Epidemiology. InProceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 1848–1857. https://doi.org/10.55","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":19,"audited_at":"2026-07-10T16:58:12.036822Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3545946.3598851","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"7098e0a5266a0ead387d91da43b4afcfbf1fe85945cc45fd375be927dc0fce6f","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12025,"payload_sha256":"501fb188b660a2455da422da2a4d10a20f4af5350960514d60ca7436970840d1","signature_b64":"QVZGNU201pKb+esWyF39CG2YOcT7YGja47tBCWYRAuv3j74mZ9Aqre050qHUMmpB4I91g91L8dunv1J6K27SDQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T16:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tme9tbOvKu0r+eCdsUsHngbf40tfleJvBt1g7IWAvoKbuJ1QLaZYaHHixQlfz2f0g0sVn9nW9CTscvuR+2dbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:17:24.959237Z"},"content_sha256":"3f77d606cc46914c6db3e61c51e679e25fb50315a9671c2053b8afddeae6fc6b","schema_version":"1.0","event_id":"sha256:3f77d606cc46914c6db3e61c51e679e25fb50315a9671c2053b8afddeae6fc6b"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","target":"integrity","payload":{"note":"Identifier '10.5555/3322706.3322734' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Eli Bingham, Jonathan P. Chen, Martin Jankowiak, Fritz Obermeyer, Neeraj Pradhan, Theofanis Karaletsos, Rohit Singh, Paul Szerlip, Paul Horsfall, and Noah D. Goodman. 2019. Pyro: Deep Universal Probabilistic Programming. Journal of Machine ","arxiv_id":"2607.07840","detector":"doi_compliance","evidence":{"doi":"10.5555/3322706.3322734","arxiv_id":null,"ref_index":14,"raw_excerpt":"Eli Bingham, Jonathan P. Chen, Martin Jankowiak, Fritz Obermeyer, Neeraj Pradhan, Theofanis Karaletsos, Rohit Singh, Paul Szerlip, Paul Horsfall, and Noah D. Goodman. 2019. Pyro: Deep Universal Probabilistic Programming. Journal of Machine Learning Research20, 28 (2019), 1–6. https://doi.org/10.5555/3322706.3322734","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":14,"audited_at":"2026-07-10T16:58:12.036822Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3322706.3322734","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"da4b473ef4a6009040f4811f16142e6c28496e9b70e402ea17b893ddba2db9f3","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12024,"payload_sha256":"65f561d796340ec1b74ead5a913abb9ecdeaeb6cd4020332ca616c868950bcd7","signature_b64":"xME5DyCUD/qEC5PLn1bFL2OgJzntWiVsUpktQ6E74x/Na8JRyj/cL13qOYCicbnw562pEkVm0fghqbdy7gIyCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T16:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1FE5bSlmqTMWNgtthD8t6FKF/B4JcqnbZ7EFlUQLPzZQMGH3gBx8WsRyYW7D92fqRcfna97xYRPm8YxJAOZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:17:24.959620Z"},"content_sha256":"83f5eeaa0e327fda1a68e9c7e9f3f6da68eef0496800361f759dc9d2ab85035d","schema_version":"1.0","event_id":"sha256:83f5eeaa0e327fda1a68e9c7e9f3f6da68eef0496800361f759dc9d2ab85035d"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","target":"integrity","payload":{"note":"Identifier '10.5555/3600270.3601028' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"Gaurav Arya, Moritz Schauer, Frank Schäfer, and Christopher Rackauckas. 2022. Automatic Differentiation of Programs with Discrete Randomness. InProceedings of the 36th International Conference on Neural Information Processing Systems (Advan","arxiv_id":"2607.07840","detector":"doi_compliance","evidence":{"doi":"10.5555/3600270.3601028","arxiv_id":null,"ref_index":6,"raw_excerpt":"Gaurav Arya, Moritz Schauer, Frank Schäfer, and Christopher Rackauckas. 2022. Automatic Differentiation of Programs with Discrete Randomness. InProceedings of the 36th International Conference on Neural Information Processing Systems (Advances in Neural Information Processing Systems, Vol. 35). Curran Associates, Inc., Red Hook, NY, Article 758, 13 pages. https://doi.org/10.5555/3600270.3601028","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"]},"severity":"critical","ref_index":6,"audited_at":"2026-07-10T16:58:12.036822Z","event_type":"pith.integrity.v1","detected_doi":"10.5555/3600270.3601028","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"5c736670c2f769fc223b2580466c583b12e7b8c2db4e3dab80591e30abbb20fd","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.0.0","detected_arxiv_id":null,"integrity_event_id":12023,"payload_sha256":"b6a5dbb451a550d36910c179b4ed9f39cf4e51580defebb15f731a47bc4b44b5","signature_b64":"oL/EQm1jGC0ULvJeieuXRM7pJfpq0a7Ef1E5RNGg0DHImCrDaSZo187xFdSCvdPoEfX4DUUpNKckkY4PqM/ODA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-10T16:59:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kQxcio+NbJvmu1WGc3RuC07is01G/E9a1VD9aSUr3vJfDxfBu1bcCqp0RNZ0jiJOS3CBSNflO7K2EA9sFrRMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T00:17:24.959997Z"},"content_sha256":"de9e63f5bf07b1c0b1f6cd140fc89422a148dd04430ffc857e04aac55a9216d9","schema_version":"1.0","event_id":"sha256:de9e63f5bf07b1c0b1f6cd140fc89422a148dd04430ffc857e04aac55a9216d9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SWVCSM5ZUPXWL2K4QQ5CAJ3XET/bundle.json","state_url":"https://pith.science/pith/SWVCSM5ZUPXWL2K4QQ5CAJ3XET/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SWVCSM5ZUPXWL2K4QQ5CAJ3XET/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-24T00:17:24Z","links":{"resolver":"https://pith.science/pith/SWVCSM5ZUPXWL2K4QQ5CAJ3XET","bundle":"https://pith.science/pith/SWVCSM5ZUPXWL2K4QQ5CAJ3XET/bundle.json","state":"https://pith.science/pith/SWVCSM5ZUPXWL2K4QQ5CAJ3XET/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SWVCSM5ZUPXWL2K4QQ5CAJ3XET/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SWVCSM5ZUPXWL2K4QQ5CAJ3XET","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"c02e00ec46636eee05af4e22cae78af1b3fd88e9b6ae55e10efd4d3351cc3ae5","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-08T18:18:41Z","title_canon_sha256":"fa6bdca69ffb6285112c9f244c49626f38cec6d24e3f7e488782b537080d2e4e"},"schema_version":"1.0","source":{"id":"2607.07840","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.07840","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"arxiv_version","alias_value":"2607.07840v1","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.07840","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"pith_short_12","alias_value":"SWVCSM5ZUPXW","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"pith_short_16","alias_value":"SWVCSM5ZUPXWL2K4","created_at":"2026-07-10T00:19:02Z"},{"alias_kind":"pith_short_8","alias_value":"SWVCSM5Z","created_at":"2026-07-10T00:19:02Z"}],"graph_snapshots":[{"event_id":"sha256:761e88e0a280f070f41191393c456fd98b04351dbbf3a33b214a2234e81c2054","target":"graph","created_at":"2026-07-10T00:19:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.07840/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Gradient estimation -- the task of computing the gradient of the expected value of a probabilistic program -- has diverse applications in scientific computing, but is notoriously difficult because of issues such as high-dimensional integration, discrete random choices, and complex stochastic dependencies. This article introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs. Gradient inference rests on a formal reduction from a gradient estimation problem to a closely related probabilistic inference problem, whose solution c","authors_text":"Alexander K. Lew, Feras A. Saad, Gaurav Arya, Mathieu Huot, Moritz Schauer","cross_cats":["cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-08T18:18:41Z","title":"GradInf: Gradient Estimation as Probabilistic Inference"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.07840","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8783689faf3ba345da77fd0397c4db5731b323d4b820d5b7c6c1dc555aa49f47","target":"record","created_at":"2026-07-10T00:19:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"c02e00ec46636eee05af4e22cae78af1b3fd88e9b6ae55e10efd4d3351cc3ae5","cross_cats_sorted":["cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2026-07-08T18:18:41Z","title_canon_sha256":"fa6bdca69ffb6285112c9f244c49626f38cec6d24e3f7e488782b537080d2e4e"},"schema_version":"1.0","source":{"id":"2607.07840","kind":"arxiv","version":1}},"canonical_sha256":"95aa2933b9a3ef65e95c843a20277724ce20f1cd2a233d9fb4b1ac3db4d1e5ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95aa2933b9a3ef65e95c843a20277724ce20f1cd2a233d9fb4b1ac3db4d1e5ec","first_computed_at":"2026-07-10T00:19:02.786752Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-10T00:19:02.786752Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6nlujv0zsCAJZmhbcXVT4UPThVkm823PG3n98LtP+o/CO7NsCzDfd+7VZ405d4vQqQAFuDgx6V6Aazxsl0TCDQ==","signature_status":"signed_v1","signed_at":"2026-07-10T00:19:02.787159Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.07840","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:3f77d606cc46914c6db3e61c51e679e25fb50315a9671c2053b8afddeae6fc6b","sha256:83f5eeaa0e327fda1a68e9c7e9f3f6da68eef0496800361f759dc9d2ab85035d","sha256:92fc529a56a6b99e124bad50f44fa633ed3d7da3391f1ed5d14d11d453b45910","sha256:de9e63f5bf07b1c0b1f6cd140fc89422a148dd04430ffc857e04aac55a9216d9"]}],"invalid_events":[],"applied_event_ids":["sha256:8783689faf3ba345da77fd0397c4db5731b323d4b820d5b7c6c1dc555aa49f47","sha256:761e88e0a280f070f41191393c456fd98b04351dbbf3a33b214a2234e81c2054"],"state_sha256":"6b165042544e9c6f98be20aeadd4b776779d68dd7b32e8b0c0932eb03364003b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9/xwfHMqg+A2G8jz/4JTV32MRJYC0wwvonjijaEcDp4bdj8pHzfkc/9MBjGBhOzF6qQK/x9hADzS6JuMXqYwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T00:17:24.963856Z","bundle_sha256":"ef5cb9d12f23968dea40a3db34a49b37a2a6822ce90a44728fe331f0e7aae70e"}}