{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TT6GBW75XGSJGQB6B32BLIIK6W","short_pith_number":"pith:TT6GBW75","canonical_record":{"source":{"id":"1705.07944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T18:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"66af8069362795e62fd6f91ecb51473e633d682560d926bc80bca1e4b4f8cecd","abstract_canon_sha256":"99b68e2ef9a96ed33f40019477360f74bc75d43c669e24171395b7cdd26b9030"},"schema_version":"1.0"},"canonical_sha256":"9cfc60dbfdb9a493403e0ef415a10af5ad2901f3833b30aa773ce804a5739451","source":{"kind":"arxiv","id":"1705.07944","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07944","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07944v2","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07944","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"TT6GBW75XGSJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TT6GBW75XGSJGQB6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TT6GBW75","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TT6GBW75XGSJGQB6B32BLIIK6W","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07944","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T18:44:35Z","cross_cats_sorted":[],"title_canon_sha256":"66af8069362795e62fd6f91ecb51473e633d682560d926bc80bca1e4b4f8cecd","abstract_canon_sha256":"99b68e2ef9a96ed33f40019477360f74bc75d43c669e24171395b7cdd26b9030"},"schema_version":"1.0"},"canonical_sha256":"9cfc60dbfdb9a493403e0ef415a10af5ad2901f3833b30aa773ce804a5739451","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:21.357828Z","signature_b64":"vWEB3r6WO/HYZr9E/zSHB6s+ga0LnR9vMZdBti5sn52DXaib8y5mUTMIhOMdF/93ymN9GtkVJ6ExvquRQzg/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cfc60dbfdb9a493403e0ef415a10af5ad2901f3833b30aa773ce804a5739451","last_reissued_at":"2026-05-18T00:26:21.357192Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:21.357192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07944","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-18T00:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"saoCD/iqkRZdZmzVasH0MRT2igN0KhUIv2UkrCc3Cclqm0SNg+tSMlpCYTj6Hzceja2fv92TlvWdl+otY9m0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:41:22.403967Z"},"content_sha256":"07d4876d2e5a7d38b7d924ee4be7a38f27da4c23041b09c27d654e71f7938dd2","schema_version":"1.0","event_id":"sha256:07d4876d2e5a7d38b7d924ee4be7a38f27da4c23041b09c27d654e71f7938dd2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TT6GBW75XGSJGQB6B32BLIIK6W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constraining the clustering transition for colorings of sparse random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan Frieze, Michael Anastos, Wesley Pegden","submitted_at":"2017-05-22T18:44:35Z","abstract_excerpt":"Let $\\Omega_q$ denote the set of proper $q$-colorings of the random graph $G_{n,m}, m=dn/2$ and let $H_q$ be the graph with vertex set $\\Omega_q$ and an edge $\\{\\sigma,\\tau\\}$ where $\\sigma,\\tau$ are mappings $[n]\\to[q]$ iff $h(\\sigma,\\tau)=1$. Here $h(\\sigma,\\tau)$ is the Hamming distance $|\\{v\\in [n]:\\sigma(v)\\neq\\tau(v)\\}|$. We show that w.h.p. $H_q$ contains a single giant component containing almost all colorings in $\\Omega_q$ if $d$ is sufficiently large and $q\\geq \\frac{cd}{\\log d}$ for a constant $c>3/2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07944","kind":"arxiv","version":2},"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-18T00:26:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rjJWdCYTb4hA5+Pyi/JE7AifTe6q5HQdp/LEALMwr5N/ZCzd1rVI4Br43QHCu/FFzLDqYi+Wvpx4eRd5CgSJAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T21:41:22.404644Z"},"content_sha256":"4d8b559ee68fd9c765b01c20763d9b16bc9035661a380ce30799824351bedb36","schema_version":"1.0","event_id":"sha256:4d8b559ee68fd9c765b01c20763d9b16bc9035661a380ce30799824351bedb36"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TT6GBW75XGSJGQB6B32BLIIK6W/bundle.json","state_url":"https://pith.science/pith/TT6GBW75XGSJGQB6B32BLIIK6W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TT6GBW75XGSJGQB6B32BLIIK6W/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-11T21:41:22Z","links":{"resolver":"https://pith.science/pith/TT6GBW75XGSJGQB6B32BLIIK6W","bundle":"https://pith.science/pith/TT6GBW75XGSJGQB6B32BLIIK6W/bundle.json","state":"https://pith.science/pith/TT6GBW75XGSJGQB6B32BLIIK6W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TT6GBW75XGSJGQB6B32BLIIK6W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TT6GBW75XGSJGQB6B32BLIIK6W","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":"99b68e2ef9a96ed33f40019477360f74bc75d43c669e24171395b7cdd26b9030","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T18:44:35Z","title_canon_sha256":"66af8069362795e62fd6f91ecb51473e633d682560d926bc80bca1e4b4f8cecd"},"schema_version":"1.0","source":{"id":"1705.07944","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07944","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07944v2","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07944","created_at":"2026-05-18T00:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"TT6GBW75XGSJ","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TT6GBW75XGSJGQB6","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TT6GBW75","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:4d8b559ee68fd9c765b01c20763d9b16bc9035661a380ce30799824351bedb36","target":"graph","created_at":"2026-05-18T00:26:21Z","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":"Let $\\Omega_q$ denote the set of proper $q$-colorings of the random graph $G_{n,m}, m=dn/2$ and let $H_q$ be the graph with vertex set $\\Omega_q$ and an edge $\\{\\sigma,\\tau\\}$ where $\\sigma,\\tau$ are mappings $[n]\\to[q]$ iff $h(\\sigma,\\tau)=1$. Here $h(\\sigma,\\tau)$ is the Hamming distance $|\\{v\\in [n]:\\sigma(v)\\neq\\tau(v)\\}|$. We show that w.h.p. $H_q$ contains a single giant component containing almost all colorings in $\\Omega_q$ if $d$ is sufficiently large and $q\\geq \\frac{cd}{\\log d}$ for a constant $c>3/2$.","authors_text":"Alan Frieze, Michael Anastos, Wesley Pegden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T18:44:35Z","title":"Constraining the clustering transition for colorings of sparse random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07944","kind":"arxiv","version":2},"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:07d4876d2e5a7d38b7d924ee4be7a38f27da4c23041b09c27d654e71f7938dd2","target":"record","created_at":"2026-05-18T00:26:21Z","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":"99b68e2ef9a96ed33f40019477360f74bc75d43c669e24171395b7cdd26b9030","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-22T18:44:35Z","title_canon_sha256":"66af8069362795e62fd6f91ecb51473e633d682560d926bc80bca1e4b4f8cecd"},"schema_version":"1.0","source":{"id":"1705.07944","kind":"arxiv","version":2}},"canonical_sha256":"9cfc60dbfdb9a493403e0ef415a10af5ad2901f3833b30aa773ce804a5739451","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cfc60dbfdb9a493403e0ef415a10af5ad2901f3833b30aa773ce804a5739451","first_computed_at":"2026-05-18T00:26:21.357192Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:21.357192Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vWEB3r6WO/HYZr9E/zSHB6s+ga0LnR9vMZdBti5sn52DXaib8y5mUTMIhOMdF/93ymN9GtkVJ6ExvquRQzg/BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:21.357828Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07944","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:07d4876d2e5a7d38b7d924ee4be7a38f27da4c23041b09c27d654e71f7938dd2","sha256:4d8b559ee68fd9c765b01c20763d9b16bc9035661a380ce30799824351bedb36"],"state_sha256":"a51a333f5e13b2b891995ac476ec8ae9476c478965534a8bc1482d3b63463499"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUO27lpjOEEFRK+TXFqtySVfUrtuzKlTH3VEHxapZM2JhVjSvWbXsyDFU8P/jCEASsdrxLB2fxxzargH927oBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T21:41:22.408596Z","bundle_sha256":"3cc0bbebf8951b3e4ad655ad094e7402650b0034254b26c520a60a56d1cf2b91"}}