{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QX3RAMK647JEOLC6UI2PO4Q5JZ","short_pith_number":"pith:QX3RAMK6","schema_version":"1.0","canonical_sha256":"85f710315ee7d2472c5ea234f7721d4e4af5c7e26b2a589e0b2af8ed2ad24b8e","source":{"kind":"arxiv","id":"2006.09451","version":1},"attestation_state":"computed","paper":{"title":"Iterative trajectory reweighting for estimation of equilibrium and non-equilibrium observables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM","stat.CO"],"primary_cat":"physics.comp-ph","authors_text":"Daniel M. Zuckerman, Jeremy Copperman, John D. Russo","submitted_at":"2020-06-16T18:47:26Z","abstract_excerpt":"We present two algorithms by which a set of short, unbiased trajectories can be iteratively reweighted to obtain various observables. The first algorithm estimates the stationary (steady state) distribution of a system by iteratively reweighting the trajectories based on the average probability in each state. The algorithm applies to equilibrium or non-equilibrium steady states, exploiting the `left' stationarity of the distribution under dynamics -- i.e., in a discrete setting, when the column vector of probabilities is multiplied by the transition matrix expressed as a left stochastic matrix"},"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":"2006.09451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.comp-ph","submitted_at":"2020-06-16T18:47:26Z","cross_cats_sorted":["q-bio.QM","stat.CO"],"title_canon_sha256":"da93ef2414736c8c50bd8ff59310306a672be9d1d7499b3e6c3d01af23c268bb","abstract_canon_sha256":"a5b9e93202c8ece0941d0e11e9e1ca40655ccfb256ca19632192129e09e94b83"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:11:01.651284Z","signature_b64":"LWQfMHhJ0OrAglnk8ZuNAT4wHd0jf1dMVVk+fSVbVFf+3njMb+OzlERdcRDXVRygy26NpA5UW5QRBtoaZPQBAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85f710315ee7d2472c5ea234f7721d4e4af5c7e26b2a589e0b2af8ed2ad24b8e","last_reissued_at":"2026-07-05T01:11:01.650847Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:11:01.650847Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative trajectory reweighting for estimation of equilibrium and non-equilibrium observables","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.QM","stat.CO"],"primary_cat":"physics.comp-ph","authors_text":"Daniel M. Zuckerman, Jeremy Copperman, John D. Russo","submitted_at":"2020-06-16T18:47:26Z","abstract_excerpt":"We present two algorithms by which a set of short, unbiased trajectories can be iteratively reweighted to obtain various observables. The first algorithm estimates the stationary (steady state) distribution of a system by iteratively reweighting the trajectories based on the average probability in each state. The algorithm applies to equilibrium or non-equilibrium steady states, exploiting the `left' stationarity of the distribution under dynamics -- i.e., in a discrete setting, when the column vector of probabilities is multiplied by the transition matrix expressed as a left stochastic matrix"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2006.09451","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/2006.09451/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":"2006.09451","created_at":"2026-07-05T01:11:01.650909+00:00"},{"alias_kind":"arxiv_version","alias_value":"2006.09451v1","created_at":"2026-07-05T01:11:01.650909+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2006.09451","created_at":"2026-07-05T01:11:01.650909+00:00"},{"alias_kind":"pith_short_12","alias_value":"QX3RAMK647JE","created_at":"2026-07-05T01:11:01.650909+00:00"},{"alias_kind":"pith_short_16","alias_value":"QX3RAMK647JEOLC6","created_at":"2026-07-05T01:11:01.650909+00:00"},{"alias_kind":"pith_short_8","alias_value":"QX3RAMK6","created_at":"2026-07-05T01:11:01.650909+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.19452","citing_title":"Markov state models revisited: Principles and algorithms for unbiased observables","ref_index":30,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ","json":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ.json","graph_json":"https://pith.science/api/pith-number/QX3RAMK647JEOLC6UI2PO4Q5JZ/graph.json","events_json":"https://pith.science/api/pith-number/QX3RAMK647JEOLC6UI2PO4Q5JZ/events.json","paper":"https://pith.science/paper/QX3RAMK6"},"agent_actions":{"view_html":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ","download_json":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ.json","view_paper":"https://pith.science/paper/QX3RAMK6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2006.09451&json=true","fetch_graph":"https://pith.science/api/pith-number/QX3RAMK647JEOLC6UI2PO4Q5JZ/graph.json","fetch_events":"https://pith.science/api/pith-number/QX3RAMK647JEOLC6UI2PO4Q5JZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ/action/storage_attestation","attest_author":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ/action/author_attestation","sign_citation":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ/action/citation_signature","submit_replication":"https://pith.science/pith/QX3RAMK647JEOLC6UI2PO4Q5JZ/action/replication_record"}},"created_at":"2026-07-05T01:11:01.650909+00:00","updated_at":"2026-07-05T01:11:01.650909+00:00"}