{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XLSJOCBQ2IQF6AZ5GVXQH3ZVQV","short_pith_number":"pith:XLSJOCBQ","schema_version":"1.0","canonical_sha256":"bae4970830d2205f033d356f03ef35854ee13b362551d0a54337685819c6f1c3","source":{"kind":"arxiv","id":"2501.15522","version":1},"attestation_state":"computed","paper":{"title":"Estimating Committor Functions via Deep Adaptive Sampling on Rare Transition Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-bio.QM"],"primary_cat":"stat.ML","authors_text":"Chao Yang, Kejun Tang, Weiqing Ren, Xiaoliang Wan, Xili Wang, Yueyang Wang","submitted_at":"2025-01-26T13:38:12Z","abstract_excerpt":"The committor functions are central to investigating rare but important events in molecular simulations. It is known that computing the committor function suffers from the curse of dimensionality. Recently, using neural networks to estimate the committor function has gained attention due to its potential for high-dimensional problems. Training neural networks to approximate the committor function needs to sample transition data from straightforward simulations of rare events, which is very inefficient. The scarcity of transition data makes it challenging to approximate the committor function. "},"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":"2501.15522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2025-01-26T13:38:12Z","cross_cats_sorted":["cs.LG","q-bio.QM"],"title_canon_sha256":"5b9373dce182223dcd3829d15c9623a5a4c7c7492ef8e84ba57ea76bf105589c","abstract_canon_sha256":"36e3db9f8c84a377ddf9825453fa75270d994618011646f83f5c1bd9dcaf7aee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:05:30.628217Z","signature_b64":"WPWecJoQBuCO4V+qp/qNzB+qnkeE9QnJlqLLP43K6DpqjitJWJ5buaUwlTKBFkheWtVUnnI7ea36h+xoLbnECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bae4970830d2205f033d356f03ef35854ee13b362551d0a54337685819c6f1c3","last_reissued_at":"2026-07-05T10:05:30.627549Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:05:30.627549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating Committor Functions via Deep Adaptive Sampling on Rare Transition Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","q-bio.QM"],"primary_cat":"stat.ML","authors_text":"Chao Yang, Kejun Tang, Weiqing Ren, Xiaoliang Wan, Xili Wang, Yueyang Wang","submitted_at":"2025-01-26T13:38:12Z","abstract_excerpt":"The committor functions are central to investigating rare but important events in molecular simulations. It is known that computing the committor function suffers from the curse of dimensionality. Recently, using neural networks to estimate the committor function has gained attention due to its potential for high-dimensional problems. Training neural networks to approximate the committor function needs to sample transition data from straightforward simulations of rare events, which is very inefficient. The scarcity of transition data makes it challenging to approximate the committor function. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.15522","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/2501.15522/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":"2501.15522","created_at":"2026-07-05T10:05:30.627648+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.15522v1","created_at":"2026-07-05T10:05:30.627648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.15522","created_at":"2026-07-05T10:05:30.627648+00:00"},{"alias_kind":"pith_short_12","alias_value":"XLSJOCBQ2IQF","created_at":"2026-07-05T10:05:30.627648+00:00"},{"alias_kind":"pith_short_16","alias_value":"XLSJOCBQ2IQF6AZ5","created_at":"2026-07-05T10:05:30.627648+00:00"},{"alias_kind":"pith_short_8","alias_value":"XLSJOCBQ","created_at":"2026-07-05T10:05:30.627648+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.08082","citing_title":"Commitment Before Realization: When Classifier-Free Guidance Becomes Unnecessary in Masked Diffusion Language Models","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV","json":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV.json","graph_json":"https://pith.science/api/pith-number/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/graph.json","events_json":"https://pith.science/api/pith-number/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/events.json","paper":"https://pith.science/paper/XLSJOCBQ"},"agent_actions":{"view_html":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV","download_json":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV.json","view_paper":"https://pith.science/paper/XLSJOCBQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.15522&json=true","fetch_graph":"https://pith.science/api/pith-number/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/graph.json","fetch_events":"https://pith.science/api/pith-number/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/action/storage_attestation","attest_author":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/action/author_attestation","sign_citation":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/action/citation_signature","submit_replication":"https://pith.science/pith/XLSJOCBQ2IQF6AZ5GVXQH3ZVQV/action/replication_record"}},"created_at":"2026-07-05T10:05:30.627648+00:00","updated_at":"2026-07-05T10:05:30.627648+00:00"}