{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:P6N5R2L3AZTHGMN2KDLULLKJJH","short_pith_number":"pith:P6N5R2L3","schema_version":"1.0","canonical_sha256":"7f9bd8e97b06667331ba50d745ad4949c7c5ca09fd6a8a2d497236938e728bd1","source":{"kind":"arxiv","id":"1806.09227","version":1},"attestation_state":"computed","paper":{"title":"Restricted permutations for the simple exclusion process in discrete time over graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"J. Ricardo G. Mendon\\c{c}a","submitted_at":"2018-06-24T22:43:55Z","abstract_excerpt":"Exclusion processes became paradigmatic models of nonequilibrium interacting particle systems of wide range applicability both across the natural and the applied, social and technological sciences. Usually they are defined as a continuous-time stochastic process, but in many situations it would be desirable to have a discrete-time version of them. There is no generally applicable formalism for exclusion processes in discrete-time. In this paper we define the symmetric simple exclusion process in discrete time over graphs by means of restricted permutations over the labels of the vertices of th"},"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":"1806.09227","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.stat-mech","submitted_at":"2018-06-24T22:43:55Z","cross_cats_sorted":[],"title_canon_sha256":"dc5c7bca85360ab282ed269a4b9840ddd4b8003ef7efd78aacf1e539579c63a5","abstract_canon_sha256":"f2abe69e89f6d078b810631a6fc40cd1d93ed7fa11eb8863dd116e124708223f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:29.944371Z","signature_b64":"vWONOGsFtShGo8h6a99iUnO8L59I8hJQgHSj/QZlTlcl1vzCRj+oJ2+Nb6rcjGBjpIWTvalVtURauI0SnhwLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f9bd8e97b06667331ba50d745ad4949c7c5ca09fd6a8a2d497236938e728bd1","last_reissued_at":"2026-05-18T00:12:29.943861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:29.943861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Restricted permutations for the simple exclusion process in discrete time over graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cond-mat.stat-mech","authors_text":"J. Ricardo G. Mendon\\c{c}a","submitted_at":"2018-06-24T22:43:55Z","abstract_excerpt":"Exclusion processes became paradigmatic models of nonequilibrium interacting particle systems of wide range applicability both across the natural and the applied, social and technological sciences. Usually they are defined as a continuous-time stochastic process, but in many situations it would be desirable to have a discrete-time version of them. There is no generally applicable formalism for exclusion processes in discrete-time. In this paper we define the symmetric simple exclusion process in discrete time over graphs by means of restricted permutations over the labels of the vertices of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.09227","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":""},"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":"1806.09227","created_at":"2026-05-18T00:12:29.943947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.09227v1","created_at":"2026-05-18T00:12:29.943947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.09227","created_at":"2026-05-18T00:12:29.943947+00:00"},{"alias_kind":"pith_short_12","alias_value":"P6N5R2L3AZTH","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"P6N5R2L3AZTHGMN2","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"P6N5R2L3","created_at":"2026-05-18T12:32:43.782077+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/P6N5R2L3AZTHGMN2KDLULLKJJH","json":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH.json","graph_json":"https://pith.science/api/pith-number/P6N5R2L3AZTHGMN2KDLULLKJJH/graph.json","events_json":"https://pith.science/api/pith-number/P6N5R2L3AZTHGMN2KDLULLKJJH/events.json","paper":"https://pith.science/paper/P6N5R2L3"},"agent_actions":{"view_html":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH","download_json":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH.json","view_paper":"https://pith.science/paper/P6N5R2L3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.09227&json=true","fetch_graph":"https://pith.science/api/pith-number/P6N5R2L3AZTHGMN2KDLULLKJJH/graph.json","fetch_events":"https://pith.science/api/pith-number/P6N5R2L3AZTHGMN2KDLULLKJJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH/action/storage_attestation","attest_author":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH/action/author_attestation","sign_citation":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH/action/citation_signature","submit_replication":"https://pith.science/pith/P6N5R2L3AZTHGMN2KDLULLKJJH/action/replication_record"}},"created_at":"2026-05-18T00:12:29.943947+00:00","updated_at":"2026-05-18T00:12:29.943947+00:00"}