{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TOUTXHTHK2Z7WPKH4QH5MNTRXW","short_pith_number":"pith:TOUTXHTH","canonical_record":{"source":{"id":"1906.01752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-04T23:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"76e7b33111f272d86584463dbd2a5c891eff2a42bb5ac951d4addea9294c71b1","abstract_canon_sha256":"039f24d3d9d6b306a27bae59589c110c533548a9336c6efc073206e1fe4a6cc3"},"schema_version":"1.0"},"canonical_sha256":"9ba93b9e6756b3fb3d47e40fd63671bdba70c08c40bb6186221f81fbacd9938b","source":{"kind":"arxiv","id":"1906.01752","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01752","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01752v1","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01752","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"TOUTXHTHK2Z7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TOUTXHTHK2Z7WPKH","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TOUTXHTH","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TOUTXHTHK2Z7WPKH4QH5MNTRXW","target":"record","payload":{"canonical_record":{"source":{"id":"1906.01752","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-04T23:14:05Z","cross_cats_sorted":[],"title_canon_sha256":"76e7b33111f272d86584463dbd2a5c891eff2a42bb5ac951d4addea9294c71b1","abstract_canon_sha256":"039f24d3d9d6b306a27bae59589c110c533548a9336c6efc073206e1fe4a6cc3"},"schema_version":"1.0"},"canonical_sha256":"9ba93b9e6756b3fb3d47e40fd63671bdba70c08c40bb6186221f81fbacd9938b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:06.382779Z","signature_b64":"Gpuv1x7TIaR7HbAwuaUMkIiOV7ZjCpBNq+iD83tZLh1w4C2aowEXFLeGCqapkBz5icwNDEQRxUMCsyzRc37PBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ba93b9e6756b3fb3d47e40fd63671bdba70c08c40bb6186221f81fbacd9938b","last_reissued_at":"2026-05-17T23:44:06.382210Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:06.382210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.01752","source_version":1,"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:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PWj7bpUvXRiP8ZyMSKZDrTb7F+seILciy8BogCrlWzdritTEEciB0u87KAa/TfhfyQOS3e2QZJIQPC6vy+oxDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:38:45.916677Z"},"content_sha256":"43a3961d8ed2bb8f594b0263f168d837303168d4274faf6e25b5507691f3eedf","schema_version":"1.0","event_id":"sha256:43a3961d8ed2bb8f594b0263f168d837303168d4274faf6e25b5507691f3eedf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TOUTXHTHK2Z7WPKH4QH5MNTRXW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The simple exclusion process on finite connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.PR","authors_text":"Nicolas Lanchier, Shiba Biswal","submitted_at":"2019-06-04T23:14:05Z","abstract_excerpt":"Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\\hbox{deg} (x)$ neighbors of its location uniformly at random at rate $\\rho_x$, and jumps to that vertex if and only if it is empty. Using standard probability techniques, we identify the set of invariant measures of this process to study the occupation time at each vertex. Our main result shows that, though the occupation time at vertex $x$ increases with $\\hbox{deg} (x) / \\rho_x$, the ratio of the occupation tim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01752","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"},"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:44:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOuIBHypQ+//X56Nu5CRWOnFrFtqgTZYT0W6DYRlJpscj9eIAGUtqvEkHIppKsPjWzKnzhZUJG+OtWo0UFTHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:38:45.917015Z"},"content_sha256":"fb29b39f96dd861eef3759f2ee3dc0831f3df743cf04895707a6ac8026c85cd2","schema_version":"1.0","event_id":"sha256:fb29b39f96dd861eef3759f2ee3dc0831f3df743cf04895707a6ac8026c85cd2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOUTXHTHK2Z7WPKH4QH5MNTRXW/bundle.json","state_url":"https://pith.science/pith/TOUTXHTHK2Z7WPKH4QH5MNTRXW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOUTXHTHK2Z7WPKH4QH5MNTRXW/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-05T11:38:45Z","links":{"resolver":"https://pith.science/pith/TOUTXHTHK2Z7WPKH4QH5MNTRXW","bundle":"https://pith.science/pith/TOUTXHTHK2Z7WPKH4QH5MNTRXW/bundle.json","state":"https://pith.science/pith/TOUTXHTHK2Z7WPKH4QH5MNTRXW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOUTXHTHK2Z7WPKH4QH5MNTRXW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TOUTXHTHK2Z7WPKH4QH5MNTRXW","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":"039f24d3d9d6b306a27bae59589c110c533548a9336c6efc073206e1fe4a6cc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-04T23:14:05Z","title_canon_sha256":"76e7b33111f272d86584463dbd2a5c891eff2a42bb5ac951d4addea9294c71b1"},"schema_version":"1.0","source":{"id":"1906.01752","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.01752","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"arxiv_version","alias_value":"1906.01752v1","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.01752","created_at":"2026-05-17T23:44:06Z"},{"alias_kind":"pith_short_12","alias_value":"TOUTXHTHK2Z7","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TOUTXHTHK2Z7WPKH","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TOUTXHTH","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:fb29b39f96dd861eef3759f2ee3dc0831f3df743cf04895707a6ac8026c85cd2","target":"graph","created_at":"2026-05-17T23:44:06Z","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":"Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\\hbox{deg} (x)$ neighbors of its location uniformly at random at rate $\\rho_x$, and jumps to that vertex if and only if it is empty. Using standard probability techniques, we identify the set of invariant measures of this process to study the occupation time at each vertex. Our main result shows that, though the occupation time at vertex $x$ increases with $\\hbox{deg} (x) / \\rho_x$, the ratio of the occupation tim","authors_text":"Nicolas Lanchier, Shiba Biswal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-04T23:14:05Z","title":"The simple exclusion process on finite connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.01752","kind":"arxiv","version":1},"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:43a3961d8ed2bb8f594b0263f168d837303168d4274faf6e25b5507691f3eedf","target":"record","created_at":"2026-05-17T23:44:06Z","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":"039f24d3d9d6b306a27bae59589c110c533548a9336c6efc073206e1fe4a6cc3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2019-06-04T23:14:05Z","title_canon_sha256":"76e7b33111f272d86584463dbd2a5c891eff2a42bb5ac951d4addea9294c71b1"},"schema_version":"1.0","source":{"id":"1906.01752","kind":"arxiv","version":1}},"canonical_sha256":"9ba93b9e6756b3fb3d47e40fd63671bdba70c08c40bb6186221f81fbacd9938b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ba93b9e6756b3fb3d47e40fd63671bdba70c08c40bb6186221f81fbacd9938b","first_computed_at":"2026-05-17T23:44:06.382210Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:06.382210Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gpuv1x7TIaR7HbAwuaUMkIiOV7ZjCpBNq+iD83tZLh1w4C2aowEXFLeGCqapkBz5icwNDEQRxUMCsyzRc37PBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:06.382779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.01752","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43a3961d8ed2bb8f594b0263f168d837303168d4274faf6e25b5507691f3eedf","sha256:fb29b39f96dd861eef3759f2ee3dc0831f3df743cf04895707a6ac8026c85cd2"],"state_sha256":"fc7470580b43ad57092d9be24891ecb00707bd2a1397feed0072f770faac41d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bPw8ijHcoLXcoqo05cFOrPpFmbg/OrSRKrbty5eAxh8gPlMC0+4w4L5hMTcjeaEQGgwrcnz0RLnQl5SeqjfsDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:38:45.918912Z","bundle_sha256":"86a63986117398bd097f7da6708e9d25d56f12b83ed960060034425f6f50e912"}}