{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6XTCRDECQMTOZ53IZALIV5OF22","short_pith_number":"pith:6XTCRDEC","canonical_record":{"source":{"id":"2604.04747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-06T15:13:24Z","cross_cats_sorted":[],"title_canon_sha256":"97cc7613beafb173aa37c4f11bb20ddd32be40c828a503f959b5836a1a7d1620","abstract_canon_sha256":"c55e42e3c889de9a594bd1643d9f0ebb52ef14cb2003af863601ac76d35d360a"},"schema_version":"1.0"},"canonical_sha256":"f5e6288c828326ecf768c8168af5c5d6963ddb5880eb15ba1d7789c1b7bf1614","source":{"kind":"arxiv","id":"2604.04747","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.04747","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2604.04747v2","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.04747","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"6XTCRDECQMTO","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"6XTCRDECQMTOZ53I","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"6XTCRDEC","created_at":"2026-05-21T01:04:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6XTCRDECQMTOZ53IZALIV5OF22","target":"record","payload":{"canonical_record":{"source":{"id":"2604.04747","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-06T15:13:24Z","cross_cats_sorted":[],"title_canon_sha256":"97cc7613beafb173aa37c4f11bb20ddd32be40c828a503f959b5836a1a7d1620","abstract_canon_sha256":"c55e42e3c889de9a594bd1643d9f0ebb52ef14cb2003af863601ac76d35d360a"},"schema_version":"1.0"},"canonical_sha256":"f5e6288c828326ecf768c8168af5c5d6963ddb5880eb15ba1d7789c1b7bf1614","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:04:25.414748Z","signature_b64":"lIff0lSWNYtqnhBIsHvE0C5vKqPfYgfijUXjc3E7Eg9MBFf0HwiG+Kb1k9JzXRtgt1gVpfjXGRenrDmlr/GeCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5e6288c828326ecf768c8168af5c5d6963ddb5880eb15ba1d7789c1b7bf1614","last_reissued_at":"2026-05-21T01:04:25.414268Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:04:25.414268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.04747","source_version":2,"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-21T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GfxKZupzY4bVgyBpfdfdu2koBBWA/p4ppRu/LXbB13STpCRZMv/l0pctFKf6yxR33G1VBd/7j6iowOB+UgffCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:29:13.273327Z"},"content_sha256":"b4ae82c8cebd705982c03359a41393cc397dec6caa6184b2825f8e1f2f125a85","schema_version":"1.0","event_id":"sha256:b4ae82c8cebd705982c03359a41393cc397dec6caa6184b2825f8e1f2f125a85"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6XTCRDECQMTOZ53IZALIV5OF22","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling limit and density conjecture for activated random walk on the complete graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The stationary number of sleeping particles in activated random walk on the complete graph has a Gumbel scaling limit for sink probabilities in the window exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}.","cross_cats":[],"primary_cat":"math.PR","authors_text":"Harley Kaufman, Josh Meisel, Matthew Junge","submitted_at":"2026-04-06T15:13:24Z","abstract_excerpt":"We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the stationary distribution has a Gumbel scaling limit for $\\exp(-n^{1/3}) \\ll q_n \\ll n^{-1/2}$. The particular scaling implies that $S_n$ is hyperuniform and thus the stationary configuration law has negative correlations and is not a product measure. We also prove that $S_n/n$ converges to $p$ if and only if $q_n = e^{-o(n)}$, and that, when $q_n=0$, the number"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that the number of sleeping particles S_n left by the stationary distribution has a Gumbel scaling limit for exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}. This implies that the stationary configuration law is not a product measure. We also prove that S_n/n converges to p if and only if q_n = e^{-o(n)}, and that, when q_n=0, the number of jumps to stabilization undergoes a phase transition at density p.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The proofs rely on the complete-graph mean-field structure and the precise asymptotic window for q_n; if the graph were not complete or the window violated, the Gumbel limit and the iff convergence statement would not necessarily hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Activated random walk on the complete graph with sink has Gumbel scaling for sleeping particles when exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}, density converges to p only for exponentially weak sinks, and jumps to stabilization phase-transition at density p when q_n=0.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The stationary number of sleeping particles in activated random walk on the complete graph has a Gumbel scaling limit for sink probabilities in the window exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"18b6bf056595b4bc693930cfaf9b2479ede7bb928cbf1ca8c1ab0e97dae062d9"},"source":{"id":"2604.04747","kind":"arxiv","version":2},"verdict":{"id":"3e0d3e4e-081b-4bc2-bc95-a2d85a5bbc70","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-10T19:57:55.501881Z","strongest_claim":"We show that the number of sleeping particles S_n left by the stationary distribution has a Gumbel scaling limit for exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}. This implies that the stationary configuration law is not a product measure. We also prove that S_n/n converges to p if and only if q_n = e^{-o(n)}, and that, when q_n=0, the number of jumps to stabilization undergoes a phase transition at density p.","one_line_summary":"Activated random walk on the complete graph with sink has Gumbel scaling for sleeping particles when exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}, density converges to p only for exponentially weak sinks, and jumps to stabilization phase-transition at density p when q_n=0.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The proofs rely on the complete-graph mean-field structure and the precise asymptotic window for q_n; if the graph were not complete or the window violated, the Gumbel limit and the iff convergence statement would not necessarily hold.","pith_extraction_headline":"The stationary number of sleeping particles in activated random walk on the complete graph has a Gumbel scaling limit for sink probabilities in the window exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.04747/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"3e0d3e4e-081b-4bc2-bc95-a2d85a5bbc70"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-21T01:04:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KGI4/qRHF+aUHECzy3f99Qkr7sgHGxbBC0Ty6XtbVrnvKINcbBVAt+1q5A3BKA9OxOESJc6x6d6vG985ChnACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T08:29:13.274145Z"},"content_sha256":"5f1e03ac559bedcf55ad7878d832b857ae276c56cb813afbc1462c1ca1264ee4","schema_version":"1.0","event_id":"sha256:5f1e03ac559bedcf55ad7878d832b857ae276c56cb813afbc1462c1ca1264ee4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6XTCRDECQMTOZ53IZALIV5OF22/bundle.json","state_url":"https://pith.science/pith/6XTCRDECQMTOZ53IZALIV5OF22/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6XTCRDECQMTOZ53IZALIV5OF22/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-05-22T08:29:13Z","links":{"resolver":"https://pith.science/pith/6XTCRDECQMTOZ53IZALIV5OF22","bundle":"https://pith.science/pith/6XTCRDECQMTOZ53IZALIV5OF22/bundle.json","state":"https://pith.science/pith/6XTCRDECQMTOZ53IZALIV5OF22/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6XTCRDECQMTOZ53IZALIV5OF22/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6XTCRDECQMTOZ53IZALIV5OF22","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":"c55e42e3c889de9a594bd1643d9f0ebb52ef14cb2003af863601ac76d35d360a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-06T15:13:24Z","title_canon_sha256":"97cc7613beafb173aa37c4f11bb20ddd32be40c828a503f959b5836a1a7d1620"},"schema_version":"1.0","source":{"id":"2604.04747","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.04747","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"arxiv_version","alias_value":"2604.04747v2","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.04747","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"pith_short_12","alias_value":"6XTCRDECQMTO","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"pith_short_16","alias_value":"6XTCRDECQMTOZ53I","created_at":"2026-05-21T01:04:25Z"},{"alias_kind":"pith_short_8","alias_value":"6XTCRDEC","created_at":"2026-05-21T01:04:25Z"}],"graph_snapshots":[{"event_id":"sha256:5f1e03ac559bedcf55ad7878d832b857ae276c56cb813afbc1462c1ca1264ee4","target":"graph","created_at":"2026-05-21T01:04:25Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We show that the number of sleeping particles S_n left by the stationary distribution has a Gumbel scaling limit for exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}. This implies that the stationary configuration law is not a product measure. We also prove that S_n/n converges to p if and only if q_n = e^{-o(n)}, and that, when q_n=0, the number of jumps to stabilization undergoes a phase transition at density p."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The proofs rely on the complete-graph mean-field structure and the precise asymptotic window for q_n; if the graph were not complete or the window violated, the Gumbel limit and the iff convergence statement would not necessarily hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Activated random walk on the complete graph with sink has Gumbel scaling for sleeping particles when exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}, density converges to p only for exponentially weak sinks, and jumps to stabilization phase-transition at density p when q_n=0."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The stationary number of sleeping particles in activated random walk on the complete graph has a Gumbel scaling limit for sink probabilities in the window exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}."}],"snapshot_sha256":"18b6bf056595b4bc693930cfaf9b2479ede7bb928cbf1ca8c1ab0e97dae062d9"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.04747/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study driven-dissipative activated random walk with sleep probability $p$ on an $n$-vertex complete graph with a sink that traps jumping particles with probability $q_n$. We show that the number of sleeping particles $S_n$ left by the stationary distribution has a Gumbel scaling limit for $\\exp(-n^{1/3}) \\ll q_n \\ll n^{-1/2}$. The particular scaling implies that $S_n$ is hyperuniform and thus the stationary configuration law has negative correlations and is not a product measure. We also prove that $S_n/n$ converges to $p$ if and only if $q_n = e^{-o(n)}$, and that, when $q_n=0$, the number","authors_text":"Harley Kaufman, Josh Meisel, Matthew Junge","cross_cats":[],"headline":"The stationary number of sleeping particles in activated random walk on the complete graph has a Gumbel scaling limit for sink probabilities in the window exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-06T15:13:24Z","title":"Scaling limit and density conjecture for activated random walk on the complete graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.04747","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T19:57:55.501881Z","id":"3e0d3e4e-081b-4bc2-bc95-a2d85a5bbc70","model_set":{"reader":"grok-4.3"},"one_line_summary":"Activated random walk on the complete graph with sink has Gumbel scaling for sleeping particles when exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}, density converges to p only for exponentially weak sinks, and jumps to stabilization phase-transition at density p when q_n=0.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The stationary number of sleeping particles in activated random walk on the complete graph has a Gumbel scaling limit for sink probabilities in the window exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}.","strongest_claim":"We show that the number of sleeping particles S_n left by the stationary distribution has a Gumbel scaling limit for exp(-n^{1/3}) ≪ q_n ≪ n^{-1/2}. This implies that the stationary configuration law is not a product measure. We also prove that S_n/n converges to p if and only if q_n = e^{-o(n)}, and that, when q_n=0, the number of jumps to stabilization undergoes a phase transition at density p.","weakest_assumption":"The proofs rely on the complete-graph mean-field structure and the precise asymptotic window for q_n; if the graph were not complete or the window violated, the Gumbel limit and the iff convergence statement would not necessarily hold."}},"verdict_id":"3e0d3e4e-081b-4bc2-bc95-a2d85a5bbc70"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b4ae82c8cebd705982c03359a41393cc397dec6caa6184b2825f8e1f2f125a85","target":"record","created_at":"2026-05-21T01:04:25Z","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":"c55e42e3c889de9a594bd1643d9f0ebb52ef14cb2003af863601ac76d35d360a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-04-06T15:13:24Z","title_canon_sha256":"97cc7613beafb173aa37c4f11bb20ddd32be40c828a503f959b5836a1a7d1620"},"schema_version":"1.0","source":{"id":"2604.04747","kind":"arxiv","version":2}},"canonical_sha256":"f5e6288c828326ecf768c8168af5c5d6963ddb5880eb15ba1d7789c1b7bf1614","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5e6288c828326ecf768c8168af5c5d6963ddb5880eb15ba1d7789c1b7bf1614","first_computed_at":"2026-05-21T01:04:25.414268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:04:25.414268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lIff0lSWNYtqnhBIsHvE0C5vKqPfYgfijUXjc3E7Eg9MBFf0HwiG+Kb1k9JzXRtgt1gVpfjXGRenrDmlr/GeCw==","signature_status":"signed_v1","signed_at":"2026-05-21T01:04:25.414748Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.04747","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b4ae82c8cebd705982c03359a41393cc397dec6caa6184b2825f8e1f2f125a85","sha256:5f1e03ac559bedcf55ad7878d832b857ae276c56cb813afbc1462c1ca1264ee4"],"state_sha256":"bb35db131ab35aa66970ba91dea620fc7922dd97786207e838eed72a5a9f86e1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFIW595j98dmru4/6/JZmchdBQ3y1H+tGi611SBP7ReD+WiGqB2ZY3Shj75WFJ63fpHgnckaRtqFXIP5ig4NBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T08:29:13.277688Z","bundle_sha256":"e70158c469003043cdbec5c17e481fe96d4c9e1132b9e65da7d26715787a6725"}}