{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:URJC2NXJPGLUJIBCILZNJREKBP","short_pith_number":"pith:URJC2NXJ","schema_version":"1.0","canonical_sha256":"a4522d36e9799744a02242f2d4c48a0bee22ddea23e7eadec63819b42813c32f","source":{"kind":"arxiv","id":"2504.20978","version":3},"attestation_state":"computed","paper":{"title":"Coloring graphs as complete graph invariants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Howard W. Levinson, Sara Krehbiel, Shamil Asgarli","submitted_at":"2025-04-29T17:49:06Z","abstract_excerpt":"We investigate the extent to which the $k$-coloring graph $\\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect colorings that differ on exactly one vertex. There are nonisomorphic graphs $G_1$ and $G_2$ with isomorphic coloring graphs, so $\\mathcal{C}_{k}(G)$ is not a complete invariant in general. However, for color palettes with surplus colors (when the number of colors $k$ is greater than the chromatic number), we prove that the coloring graph is a complete invari"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2504.20978","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T17:49:06Z","cross_cats_sorted":[],"title_canon_sha256":"facee5c0bdd0dbf7ed198d211fe4f629576399e9dcb1dc8a6a9a745cb400af45","abstract_canon_sha256":"f80629fc1a8d92719c7a3a665317ff6b07c5895b70eb66f2442884b8abe152f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:28.896601Z","signature_b64":"vBvqYvp9KVwfTSW637iojeDOijllSqQxXSjdfI+H2Du2wtUjgJ8rvYslehRUe+a/TatiV84W4wVQzQNpLu6jCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4522d36e9799744a02242f2d4c48a0bee22ddea23e7eadec63819b42813c32f","last_reissued_at":"2026-06-04T01:08:28.896050Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:28.896050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring graphs as complete graph invariants","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Howard W. Levinson, Sara Krehbiel, Shamil Asgarli","submitted_at":"2025-04-29T17:49:06Z","abstract_excerpt":"We investigate the extent to which the $k$-coloring graph $\\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect colorings that differ on exactly one vertex. There are nonisomorphic graphs $G_1$ and $G_2$ with isomorphic coloring graphs, so $\\mathcal{C}_{k}(G)$ is not a complete invariant in general. However, for color palettes with surplus colors (when the number of colors $k$ is greater than the chromatic number), we prove that the coloring graph is a complete invari"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20978","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.20978/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2504.20978","created_at":"2026-06-04T01:08:28.896118+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.20978v3","created_at":"2026-06-04T01:08:28.896118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20978","created_at":"2026-06-04T01:08:28.896118+00:00"},{"alias_kind":"pith_short_12","alias_value":"URJC2NXJPGLU","created_at":"2026-06-04T01:08:28.896118+00:00"},{"alias_kind":"pith_short_16","alias_value":"URJC2NXJPGLUJIBC","created_at":"2026-06-04T01:08:28.896118+00:00"},{"alias_kind":"pith_short_8","alias_value":"URJC2NXJ","created_at":"2026-06-04T01:08:28.896118+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.13005","citing_title":"Reconstructing a graph from its Bell colouring graph","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP","json":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP.json","graph_json":"https://pith.science/api/pith-number/URJC2NXJPGLUJIBCILZNJREKBP/graph.json","events_json":"https://pith.science/api/pith-number/URJC2NXJPGLUJIBCILZNJREKBP/events.json","paper":"https://pith.science/paper/URJC2NXJ"},"agent_actions":{"view_html":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP","download_json":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP.json","view_paper":"https://pith.science/paper/URJC2NXJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.20978&json=true","fetch_graph":"https://pith.science/api/pith-number/URJC2NXJPGLUJIBCILZNJREKBP/graph.json","fetch_events":"https://pith.science/api/pith-number/URJC2NXJPGLUJIBCILZNJREKBP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/action/storage_attestation","attest_author":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/action/author_attestation","sign_citation":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/action/citation_signature","submit_replication":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/action/replication_record"}},"created_at":"2026-06-04T01:08:28.896118+00:00","updated_at":"2026-06-04T01:08:28.896118+00:00"}