{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:CWRG7XCJQ2AT5UW4VWB5E4QBTB","short_pith_number":"pith:CWRG7XCJ","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"},"canonical_sha256":"15a26fdc4986813ed2dcad83d27201984b40986e1b4eb9a0b4410d9fbd1f3c72","source":{"kind":"arxiv","id":"1606.02703","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02703","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02703v4","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02703","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"CWRG7XCJQ2AT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CWRG7XCJQ2AT5UW4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CWRG7XCJ","created_at":"2026-05-18T12:30:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:CWRG7XCJQ2AT5UW4VWB5E4QBTB","target":"record","payload":{"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"},"canonical_sha256":"15a26fdc4986813ed2dcad83d27201984b40986e1b4eb9a0b4410d9fbd1f3c72","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"},"source_kind":"arxiv","source_id":"1606.02703","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TXPBH5nap12e6BsIcpkPrzitDhOOtY7xNGwdGL8XYku9Tg4YTu8LDerfEv79m1its4wql2xY4NVvtkpORnn1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:39:45.220140Z"},"content_sha256":"b0fc18951632478d467ecd9af7709523543b007b43cfcd9193b12f972e44937a","schema_version":"1.0","event_id":"sha256:b0fc18951632478d467ecd9af7709523543b007b43cfcd9193b12f972e44937a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:CWRG7XCJQ2AT5UW4VWB5E4QBTB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5axb4qoRvU3An3CgZDeF01novcrstc3gy1nGVP4GQullTaXpmk6VUd/qIMaiXLPov7NvCHBGzFESLnHhHwyHCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:39:45.220507Z"},"content_sha256":"0193439b64fec53b8df19ba1eb748d5e7ba742787af4e8c035de5eedb646f80c","schema_version":"1.0","event_id":"sha256:0193439b64fec53b8df19ba1eb748d5e7ba742787af4e8c035de5eedb646f80c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/bundle.json","state_url":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T19:39:45Z","links":{"resolver":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB","bundle":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/bundle.json","state":"https://pith.science/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CWRG7XCJQ2AT5UW4VWB5E4QBTB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:CWRG7XCJQ2AT5UW4VWB5E4QBTB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b1a13d66f51b2014e0099bb2f4203e56b6bc427a5e532e7540a410a1d8565d33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T19:52:12Z","title_canon_sha256":"6691c767a699288f3762475b88b95e7c53852559e404c93e75697ec505d36fe8"},"schema_version":"1.0","source":{"id":"1606.02703","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.02703","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1606.02703v4","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.02703","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"CWRG7XCJQ2AT","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"CWRG7XCJQ2AT5UW4","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"CWRG7XCJ","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:0193439b64fec53b8df19ba1eb748d5e7ba742787af4e8c035de5eedb646f80c","target":"graph","created_at":"2026-05-17T23:43:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Richard Pymar, Stephen B. Connor","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T19:52:12Z","title":"Mixing times for exclusion processes on hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.02703","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0fc18951632478d467ecd9af7709523543b007b43cfcd9193b12f972e44937a","target":"record","created_at":"2026-05-17T23:43:54Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"b1a13d66f51b2014e0099bb2f4203e56b6bc427a5e532e7540a410a1d8565d33","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-06-08T19:52:12Z","title_canon_sha256":"6691c767a699288f3762475b88b95e7c53852559e404c93e75697ec505d36fe8"},"schema_version":"1.0","source":{"id":"1606.02703","kind":"arxiv","version":4}},"canonical_sha256":"15a26fdc4986813ed2dcad83d27201984b40986e1b4eb9a0b4410d9fbd1f3c72","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15a26fdc4986813ed2dcad83d27201984b40986e1b4eb9a0b4410d9fbd1f3c72","first_computed_at":"2026-05-17T23:43:54.371889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:54.371889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLeXD5zxW3/2J765ZTPMfVZBil4BoV82XNzz9W2fiTprKTQ7XvFLOBSkJ40iHqE3xrcglUu7EB/5SUo4UpraDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:54.372461Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.02703","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0fc18951632478d467ecd9af7709523543b007b43cfcd9193b12f972e44937a","sha256:0193439b64fec53b8df19ba1eb748d5e7ba742787af4e8c035de5eedb646f80c"],"state_sha256":"365e46daa8191a11c1618201a71a523cfc05a85aac1a170d44cdfb3072d5e4a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SkIUDLkJAGDr8qOF/gy7IDpajk3qZ1NbBmBiUWvAPFEJ7IAENCQjTG6OFoVSuOZtbycd7RxE2PmeskNCAZBLAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:39:45.222428Z","bundle_sha256":"6b76b79b2ca983f6062574ef911971743f93c452b0b7d6b12b776332acbfb4d0"}}