{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WC6FUUAJZPWEEMGX65ZPJPWCUJ","short_pith_number":"pith:WC6FUUAJ","schema_version":"1.0","canonical_sha256":"b0bc5a5009cbec4230d7f772f4bec2a26d3d9335309897c1906ee9d821fbc9fd","source":{"kind":"arxiv","id":"1206.1416","version":2},"attestation_state":"computed","paper":{"title":"A derivation of the master equation from path entropy maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"Julian Lee, Steve Press\\'e","submitted_at":"2012-06-07T07:55:17Z","abstract_excerpt":"The master equation and, more generally, Markov processes are routinely used as models for stochastic processes. They are often justified on the basis of randomization and coarse-graining assumptions. Here instead, we derive n-th order Markov processes and the master equation as unique solutions to an inverse problem. In particular, we find that when the constraints are not enough to uniquely determine the stochastic model, the n-th order Markov process emerges as the unique maximum entropy solution to this otherwise under-determined problem. This gives a rigorous alternative for justifying su"},"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":"1206.1416","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2012-06-07T07:55:17Z","cross_cats_sorted":["math-ph","math.MP"],"title_canon_sha256":"3595050ee49b4b0259a66e281fc9646207aac3f752ecb2079eb2d9f472e5d344","abstract_canon_sha256":"28d3b3580707e9dd4dc843b010c72c8d912e350903e5a26901f051d73eeafbac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:46.915515Z","signature_b64":"ttUnS+lSgnUQARnjVen6+sAX1uvYtwc2dIUNcw613BSUdQfmxX47Oe99aJdOFa2Asv7IXBj3VUkWe3glZd/gDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0bc5a5009cbec4230d7f772f4bec2a26d3d9335309897c1906ee9d821fbc9fd","last_reissued_at":"2026-05-18T03:44:46.914838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:46.914838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A derivation of the master equation from path entropy maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP"],"primary_cat":"cond-mat.stat-mech","authors_text":"Julian Lee, Steve Press\\'e","submitted_at":"2012-06-07T07:55:17Z","abstract_excerpt":"The master equation and, more generally, Markov processes are routinely used as models for stochastic processes. They are often justified on the basis of randomization and coarse-graining assumptions. Here instead, we derive n-th order Markov processes and the master equation as unique solutions to an inverse problem. In particular, we find that when the constraints are not enough to uniquely determine the stochastic model, the n-th order Markov process emerges as the unique maximum entropy solution to this otherwise under-determined problem. This gives a rigorous alternative for justifying su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.1416","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":""},"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":"1206.1416","created_at":"2026-05-18T03:44:46.914952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.1416v2","created_at":"2026-05-18T03:44:46.914952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.1416","created_at":"2026-05-18T03:44:46.914952+00:00"},{"alias_kind":"pith_short_12","alias_value":"WC6FUUAJZPWE","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WC6FUUAJZPWEEMGX","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WC6FUUAJ","created_at":"2026-05-18T12:27:25.539911+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ","json":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ.json","graph_json":"https://pith.science/api/pith-number/WC6FUUAJZPWEEMGX65ZPJPWCUJ/graph.json","events_json":"https://pith.science/api/pith-number/WC6FUUAJZPWEEMGX65ZPJPWCUJ/events.json","paper":"https://pith.science/paper/WC6FUUAJ"},"agent_actions":{"view_html":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ","download_json":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ.json","view_paper":"https://pith.science/paper/WC6FUUAJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.1416&json=true","fetch_graph":"https://pith.science/api/pith-number/WC6FUUAJZPWEEMGX65ZPJPWCUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WC6FUUAJZPWEEMGX65ZPJPWCUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ/action/storage_attestation","attest_author":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ/action/author_attestation","sign_citation":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ/action/citation_signature","submit_replication":"https://pith.science/pith/WC6FUUAJZPWEEMGX65ZPJPWCUJ/action/replication_record"}},"created_at":"2026-05-18T03:44:46.914952+00:00","updated_at":"2026-05-18T03:44:46.914952+00:00"}