{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CWRG7XCJQ2AT5UW4VWB5E4QBTB","short_pith_number":"pith:CWRG7XCJ","schema_version":"1.0","canonical_sha256":"15a26fdc4986813ed2dcad83d27201984b40986e1b4eb9a0b4410d9fbd1f3c72","source":{"kind":"arxiv","id":"1606.02703","version":4},"attestation_state":"computed","paper":{"title":"Mixing times for exclusion processes on hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Richard Pymar, Stephen B. Connor","submitted_at":"2016-06-08T19:52:12Z","abstract_excerpt":"We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some natural class, the $\\varepsilon$-mixing time of the exclusion process on $G$ with any feasible number of particles can be upper-bounded by $CT_{\\text{EX}(2,G)}\\log(|V|/\\varepsilon)$, where $|V|$ is the number of vertices in $G$ and $T_{\\text{EX}(2,G)}$ is the 1/4-mixing time of the corresponding exclusion process with just two particles. Moreover we show this i"},"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":"1606.02703","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T19:52:12Z","cross_cats_sorted":[],"title_canon_sha256":"6691c767a699288f3762475b88b95e7c53852559e404c93e75697ec505d36fe8","abstract_canon_sha256":"b1a13d66f51b2014e0099bb2f4203e56b6bc427a5e532e7540a410a1d8565d33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.372461Z","signature_b64":"rLeXD5zxW3/2J765ZTPMfVZBil4BoV82XNzz9W2fiTprKTQ7XvFLOBSkJ40iHqE3xrcglUu7EB/5SUo4UpraDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15a26fdc4986813ed2dcad83d27201984b40986e1b4eb9a0b4410d9fbd1f3c72","last_reissued_at":"2026-05-17T23:43:54.371889Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.371889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing times for exclusion processes on hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Richard Pymar, Stephen B. Connor","submitted_at":"2016-06-08T19:52:12Z","abstract_excerpt":"We introduce a natural extension of the exclusion process to hypergraphs and prove an upper bound for its mixing time. In particular we show the existence of a constant $C$ such that for any connected, regular hypergraph $G$ within some natural class, the $\\varepsilon$-mixing time of the exclusion process on $G$ with any feasible number of particles can be upper-bounded by $CT_{\\text{EX}(2,G)}\\log(|V|/\\varepsilon)$, where $|V|$ is the number of vertices in $G$ and $T_{\\text{EX}(2,G)}$ is the 1/4-mixing time of the corresponding exclusion process with just two particles. Moreover we show this i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02703","kind":"arxiv","version":4},"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":"1606.02703","created_at":"2026-05-17T23:43:54.372007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.02703v4","created_at":"2026-05-17T23:43:54.372007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02703","created_at":"2026-05-17T23:43:54.372007+00:00"},{"alias_kind":"pith_short_12","alias_value":"CWRG7XCJQ2AT","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CWRG7XCJQ2AT5UW4","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CWRG7XCJ","created_at":"2026-05-18T12:30:09.641336+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/CWRG7XCJQ2AT5UW4VWB5E4QBTB","json":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB.json","graph_json":"https://pith.science/api/pith-number/CWRG7XCJQ2AT5UW4VWB5E4QBTB/graph.json","events_json":"https://pith.science/api/pith-number/CWRG7XCJQ2AT5UW4VWB5E4QBTB/events.json","paper":"https://pith.science/paper/CWRG7XCJ"},"agent_actions":{"view_html":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB","download_json":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB.json","view_paper":"https://pith.science/paper/CWRG7XCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.02703&json=true","fetch_graph":"https://pith.science/api/pith-number/CWRG7XCJQ2AT5UW4VWB5E4QBTB/graph.json","fetch_events":"https://pith.science/api/pith-number/CWRG7XCJQ2AT5UW4VWB5E4QBTB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/action/storage_attestation","attest_author":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/action/author_attestation","sign_citation":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/action/citation_signature","submit_replication":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/action/replication_record"}},"created_at":"2026-05-17T23:43:54.372007+00:00","updated_at":"2026-05-17T23:43:54.372007+00:00"}