{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FSCHGZAVMQHIJDVEBVNZMGPJW3","short_pith_number":"pith:FSCHGZAV","schema_version":"1.0","canonical_sha256":"2c84736415640e848ea40d5b9619e9b6feb8e9f8fe126fabaca9a66ac2626a09","source":{"kind":"arxiv","id":"2111.15141","version":2},"attestation_state":"computed","paper":{"title":"Path Integral Sampler: a stochastic control approach for sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Qinsheng Zhang, Yongxin Chen","submitted_at":"2021-11-30T05:50:12Z","abstract_excerpt":"We present Path Integral Sampler~(PIS), a novel algorithm to draw samples from unnormalized probability density functions. The PIS is built on the Schr\\\"odinger bridge problem which aims to recover the most likely evolution of a diffusion process given its initial distribution and terminal distribution. The PIS draws samples from the initial distribution and then propagates the samples through the Schr\\\"odinger bridge to reach the terminal distribution. Applying the Girsanov theorem, with a simple prior diffusion, we formulate the PIS as a stochastic optimal control problem whose running cost "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2111.15141","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-11-30T05:50:12Z","cross_cats_sorted":[],"title_canon_sha256":"0ee3bbaf54256db1eef86884d405db95a8902fc998242d17e9c89e6cb6bd5d31","abstract_canon_sha256":"9a7234cb0365f526747a865857a91f2bc6aa68db8cfca5134ab78fd29ea0e21a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:03:27.744767Z","signature_b64":"vj6wVEdxfrmOzH9rq96gbpUHSXV9zKVSUKz/4akEtnhYciqfn2tIfcaUTEiOhrSOcXaMobrsh8Ku4jG8yaBPAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c84736415640e848ea40d5b9619e9b6feb8e9f8fe126fabaca9a66ac2626a09","last_reissued_at":"2026-07-05T04:03:27.744234Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:03:27.744234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Integral Sampler: a stochastic control approach for sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Qinsheng Zhang, Yongxin Chen","submitted_at":"2021-11-30T05:50:12Z","abstract_excerpt":"We present Path Integral Sampler~(PIS), a novel algorithm to draw samples from unnormalized probability density functions. The PIS is built on the Schr\\\"odinger bridge problem which aims to recover the most likely evolution of a diffusion process given its initial distribution and terminal distribution. The PIS draws samples from the initial distribution and then propagates the samples through the Schr\\\"odinger bridge to reach the terminal distribution. Applying the Girsanov theorem, with a simple prior diffusion, we formulate the PIS as a stochastic optimal control problem whose running cost "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2111.15141","kind":"arxiv","version":2},"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/2111.15141/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2111.15141","created_at":"2026-07-05T04:03:27.744292+00:00"},{"alias_kind":"arxiv_version","alias_value":"2111.15141v2","created_at":"2026-07-05T04:03:27.744292+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2111.15141","created_at":"2026-07-05T04:03:27.744292+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSCHGZAVMQHI","created_at":"2026-07-05T04:03:27.744292+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSCHGZAVMQHIJDVE","created_at":"2026-07-05T04:03:27.744292+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSCHGZAV","created_at":"2026-07-05T04:03:27.744292+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":9,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.31498","citing_title":"Scalable Inference-Time Annealing with Surrogate Likelihood Estimators","ref_index":51,"is_internal_anchor":false},{"citing_arxiv_id":"2602.10933","citing_title":"CMAD: Cooperative Multi-Agent Diffusion via Stochastic Optimal Control","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2605.16399","citing_title":"Stable and Near-Reversible Diffusion ODE Solvers for Image Editing","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2507.10797","citing_title":"Multi-Armed Sampling Problem and the End of Exploration","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2509.20599","citing_title":"Explicit and Effectively Symmetric Schemes for Neural SDEs on Lie Groups","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21456","citing_title":"Tempered Sequential Monte Carlo for Trajectory and Policy Optimization with Differentiable Dynamics","ref_index":112,"is_internal_anchor":false},{"citing_arxiv_id":"2605.08928","citing_title":"Learning Generative Dynamics with Soft Law Constraints: A McKean-Vlasov FBSDE Approach","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07959","citing_title":"Convergent Stochastic Training of Attention and Understanding LoRA","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2604.21456","citing_title":"Tempered Sequential Monte Carlo for Trajectory and Policy Optimization with Differentiable Dynamics","ref_index":112,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3","json":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3.json","graph_json":"https://pith.science/api/pith-number/FSCHGZAVMQHIJDVEBVNZMGPJW3/graph.json","events_json":"https://pith.science/api/pith-number/FSCHGZAVMQHIJDVEBVNZMGPJW3/events.json","paper":"https://pith.science/paper/FSCHGZAV"},"agent_actions":{"view_html":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3","download_json":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3.json","view_paper":"https://pith.science/paper/FSCHGZAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2111.15141&json=true","fetch_graph":"https://pith.science/api/pith-number/FSCHGZAVMQHIJDVEBVNZMGPJW3/graph.json","fetch_events":"https://pith.science/api/pith-number/FSCHGZAVMQHIJDVEBVNZMGPJW3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3/action/storage_attestation","attest_author":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3/action/author_attestation","sign_citation":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3/action/citation_signature","submit_replication":"https://pith.science/pith/FSCHGZAVMQHIJDVEBVNZMGPJW3/action/replication_record"}},"created_at":"2026-07-05T04:03:27.744292+00:00","updated_at":"2026-07-05T04:03:27.744292+00:00"}