{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BRRZGLHRGL4NGRU3L75GHSHTWF","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":"05fb26ec74f49ff6159bd0c637f8074d4590bfce5044956bafb00f3eb2de3be7","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T18:06:24Z","title_canon_sha256":"3d553bf2f5b95fda895c1cd7a75d742d6ee3a18b1b27388442414a40482ed803"},"schema_version":"1.0","source":{"id":"2605.16511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16511","created_at":"2026-05-20T00:02:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16511v1","created_at":"2026-05-20T00:02:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16511","created_at":"2026-05-20T00:02:26Z"},{"alias_kind":"pith_short_12","alias_value":"BRRZGLHRGL4N","created_at":"2026-05-20T00:02:26Z"},{"alias_kind":"pith_short_16","alias_value":"BRRZGLHRGL4NGRU3","created_at":"2026-05-20T00:02:26Z"},{"alias_kind":"pith_short_8","alias_value":"BRRZGLHR","created_at":"2026-05-20T00:02:26Z"}],"graph_snapshots":[{"event_id":"sha256:e51096302e52bff79bc90dba73a6319fb394d33db4fbaff500df55cecc5604d7","target":"graph","created_at":"2026-05-20T00:02:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T19:33:23.088657Z","status":"skipped","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:21:56.964687Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2605.16511/integrity.json","findings":[],"snapshot_sha256":"964bd8188cd54c04d62a5e11005bd46f6383a36f92bf9f6e87f6ce3d34ddf4a5","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A sequence $D = \\{d_1,...d_n\\}$ is a feasible degree sequence if there is a graph on $\\{1,...,n\\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence. We consider sequences $\\{D_\\ell\\}_{\\ell \\geq 1}$ of feasible degree sequences which have a giant component. We show that with high probability this giant component is unique, and bound its diameter and the mixing time of the random walk on it. We also bound the size and diameter of the other components and show that many of these bounds are tight.","authors_text":"Bruce Reed, Corrine Yap, Louigi Addario-Berry","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T18:06:24Z","title":"Diameters and mixing times for giant components of random graphs with given degrees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.16511","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:eabbeaca41ff75d1aa9ee6a016f5a0493856db75e8df2d9c9e40cb354093a130","target":"record","created_at":"2026-05-20T00:02:26Z","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":"05fb26ec74f49ff6159bd0c637f8074d4590bfce5044956bafb00f3eb2de3be7","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-15T18:06:24Z","title_canon_sha256":"3d553bf2f5b95fda895c1cd7a75d742d6ee3a18b1b27388442414a40482ed803"},"schema_version":"1.0","source":{"id":"2605.16511","kind":"arxiv","version":1}},"canonical_sha256":"0c63932cf132f8d3469b5ffa63c8f3b17f0c52a8281f58c6aee40822ea9cc5e1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c63932cf132f8d3469b5ffa63c8f3b17f0c52a8281f58c6aee40822ea9cc5e1","first_computed_at":"2026-05-20T00:02:26.530677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:02:26.530677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PQhDHkXpQKnhquqwoN6ExKBIpg9RJTUPzBQq5tDX0lhSOwmAV3vx5M+IcaIqUW5tIe0Cbk4WNfce3rS2k1f/Dw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:02:26.531536Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eabbeaca41ff75d1aa9ee6a016f5a0493856db75e8df2d9c9e40cb354093a130","sha256:e51096302e52bff79bc90dba73a6319fb394d33db4fbaff500df55cecc5604d7"],"state_sha256":"716da46577cd05908d59e12d347e3ad2fca66454f263db0e360e91adf56dcbb8"}