{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:3EQCJ3G2JJ7YEREGIUIFMNY2PM","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":"189fe367fb6183e179bf23c0302197ffaf4c1c69657062f81718d8d65e857083","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-14T17:40:00Z","title_canon_sha256":"3152921f4ece93c008c1230b8a3b44255be131fb99d50dbb5568dfd47046efe9"},"schema_version":"1.0","source":{"id":"2604.13005","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.13005","created_at":"2026-06-25T01:18:38Z"},{"alias_kind":"arxiv_version","alias_value":"2604.13005v2","created_at":"2026-06-25T01:18:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13005","created_at":"2026-06-25T01:18:38Z"},{"alias_kind":"pith_short_12","alias_value":"3EQCJ3G2JJ7Y","created_at":"2026-06-25T01:18:38Z"},{"alias_kind":"pith_short_16","alias_value":"3EQCJ3G2JJ7YEREG","created_at":"2026-06-25T01:18:38Z"},{"alias_kind":"pith_short_8","alias_value":"3EQCJ3G2","created_at":"2026-06-25T01:18:38Z"}],"graph_snapshots":[{"event_id":"sha256:0480c5b3a7b1cb0fc47e3e3b7d7dc9a1eedf4fb045ce5e80d594e792b19a5f00","target":"graph","created_at":"2026-06-25T01:18:38Z","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":"every n-vertex graph G with no vertices of degree n-1 is uniquely determined by its Bell colouring graph B(G), and by its upper-Bell colouring graph B_{≥k}(G) if k≤n-2"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The graphs are finite and the uniqueness holds precisely when there are no vertices of degree n-1 (or the degree bound for the k-coloring case); if this degree condition fails the reconstruction may not be unique."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Graphs without vertices of degree n-1 are uniquely determined by their Bell colouring graphs, which encode partitions into independent sets."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Every n-vertex graph with no vertex of degree n-1 is uniquely determined by its Bell colouring graph."}],"snapshot_sha256":"9cf7d75216517f010be4863ea7517e4cf2a8643a084e7dd68a2f7a10c250a936"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.13005/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Bell colouring graph $\\mathcal{B}(G)$ of a graph $G$ is the graph whose vertices are the partitions of the vertex set of $G$ into independent sets, with an edge between two partitions if and only if one can be obtained from the other by changing the part of a single vertex of $G$. Given a natural number $k$, the Bell $k$-colouring graph $\\mathcal{B}_k(G)$ and the upper-Bell $k$-colouring graph $\\mathcal{B}_{\\geq k}(G)$ are the induced subgraphs of $\\mathcal{B}(G)$ consisting of all partitions with at most $k$ parts and at least $k$ parts, respectively. We determine precisely when two finit","authors_text":"Brian Hearn","cross_cats":[],"headline":"Every n-vertex graph with no vertex of degree n-1 is uniquely determined by its Bell colouring graph.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-14T17:40:00Z","title":"Reconstructing a graph from its Bell colouring graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.13005","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T14:45:16.129235Z","id":"93c1f11e-51a5-4039-9cbc-7ca078c17c11","model_set":{"reader":"grok-4.3"},"one_line_summary":"Graphs without vertices of degree n-1 are uniquely determined by their Bell colouring graphs, which encode partitions into independent sets.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Every n-vertex graph with no vertex of degree n-1 is uniquely determined by its Bell colouring graph.","strongest_claim":"every n-vertex graph G with no vertices of degree n-1 is uniquely determined by its Bell colouring graph B(G), and by its upper-Bell colouring graph B_{≥k}(G) if k≤n-2","weakest_assumption":"The graphs are finite and the uniqueness holds precisely when there are no vertices of degree n-1 (or the degree bound for the k-coloring case); if this degree condition fails the reconstruction may not be unique."}},"verdict_id":"93c1f11e-51a5-4039-9cbc-7ca078c17c11"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9a7e2387d76ed2e2eb795862b7e853195477bcfc0b15018f6a52e03d0603b8ef","target":"record","created_at":"2026-06-25T01:18:38Z","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":"189fe367fb6183e179bf23c0302197ffaf4c1c69657062f81718d8d65e857083","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-04-14T17:40:00Z","title_canon_sha256":"3152921f4ece93c008c1230b8a3b44255be131fb99d50dbb5568dfd47046efe9"},"schema_version":"1.0","source":{"id":"2604.13005","kind":"arxiv","version":2}},"canonical_sha256":"d92024ecda4a7f824486451056371a7b0efbe0947133e1a7a88c999ab063162e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d92024ecda4a7f824486451056371a7b0efbe0947133e1a7a88c999ab063162e","first_computed_at":"2026-06-25T01:18:38.087401Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-25T01:18:38.087401Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3aJwVGouZvUCU6jKWYnpDWzSDwTVu4t3E+kx1KpBVT4zSXGK0IBfF6hJkrVhUZc6qrrWAw0yKxNWtT8QnnAsCA==","signature_status":"signed_v1","signed_at":"2026-06-25T01:18:38.087891Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.13005","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a7e2387d76ed2e2eb795862b7e853195477bcfc0b15018f6a52e03d0603b8ef","sha256:0480c5b3a7b1cb0fc47e3e3b7d7dc9a1eedf4fb045ce5e80d594e792b19a5f00"],"state_sha256":"a13ce69f05b9fb00d1ff68c24a67eeecf3fe34e6b62630d7cc248401bb172d0f"}