{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:URJC2NXJPGLUJIBCILZNJREKBP","short_pith_number":"pith:URJC2NXJ","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"},"canonical_sha256":"a4522d36e9799744a02242f2d4c48a0bee22ddea23e7eadec63819b42813c32f","source":{"kind":"arxiv","id":"2504.20978","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20978","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20978v3","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20978","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"URJC2NXJPGLU","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"pith_short_16","alias_value":"URJC2NXJPGLUJIBC","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"pith_short_8","alias_value":"URJC2NXJ","created_at":"2026-06-04T01:08:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:URJC2NXJPGLUJIBCILZNJREKBP","target":"record","payload":{"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"},"canonical_sha256":"a4522d36e9799744a02242f2d4c48a0bee22ddea23e7eadec63819b42813c32f","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"},"source_kind":"arxiv","source_id":"2504.20978","source_version":3,"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-06-04T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qHsAQ+U+yW+HSRGCSTBO5GiEqczUBz6y57V7BqxnoqCDMMk+5K5OPzD4GCaQ1fv1C11VZsf44dYsSGFXNOANDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:37:32.211847Z"},"content_sha256":"ffa63c011ea36dd18df2f764fb6db5a1e937cece63facabe9745f405dcea901b","schema_version":"1.0","event_id":"sha256:ffa63c011ea36dd18df2f764fb6db5a1e937cece63facabe9745f405dcea901b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:URJC2NXJPGLUJIBCILZNJREKBP","target":"graph","payload":{"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"},"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-06-04T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0T8kf5h4GB4d6X7tVB+/FNMtUeWIMYCD9XmPp05TbK/VcEs6cpjNtbWi0hQxK5UupeVK3DnPncZsJBasRKgAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T12:37:32.212658Z"},"content_sha256":"6587910a7e99144924b428d1de133a274381cb88b5f63078d0ebe79476453654","schema_version":"1.0","event_id":"sha256:6587910a7e99144924b428d1de133a274381cb88b5f63078d0ebe79476453654"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/bundle.json","state_url":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URJC2NXJPGLUJIBCILZNJREKBP/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-10T12:37:32Z","links":{"resolver":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP","bundle":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/bundle.json","state":"https://pith.science/pith/URJC2NXJPGLUJIBCILZNJREKBP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URJC2NXJPGLUJIBCILZNJREKBP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:URJC2NXJPGLUJIBCILZNJREKBP","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":"f80629fc1a8d92719c7a3a665317ff6b07c5895b70eb66f2442884b8abe152f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T17:49:06Z","title_canon_sha256":"facee5c0bdd0dbf7ed198d211fe4f629576399e9dcb1dc8a6a9a745cb400af45"},"schema_version":"1.0","source":{"id":"2504.20978","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2504.20978","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"2504.20978v3","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.20978","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"URJC2NXJPGLU","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"pith_short_16","alias_value":"URJC2NXJPGLUJIBC","created_at":"2026-06-04T01:08:28Z"},{"alias_kind":"pith_short_8","alias_value":"URJC2NXJ","created_at":"2026-06-04T01:08:28Z"}],"graph_snapshots":[{"event_id":"sha256:6587910a7e99144924b428d1de133a274381cb88b5f63078d0ebe79476453654","target":"graph","created_at":"2026-06-04T01:08:28Z","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":[],"endpoint":"/pith/2504.20978/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Howard W. Levinson, Sara Krehbiel, Shamil Asgarli","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T17:49:06Z","title":"Coloring graphs as complete graph invariants"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.20978","kind":"arxiv","version":3},"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:ffa63c011ea36dd18df2f764fb6db5a1e937cece63facabe9745f405dcea901b","target":"record","created_at":"2026-06-04T01:08:28Z","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":"f80629fc1a8d92719c7a3a665317ff6b07c5895b70eb66f2442884b8abe152f5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-04-29T17:49:06Z","title_canon_sha256":"facee5c0bdd0dbf7ed198d211fe4f629576399e9dcb1dc8a6a9a745cb400af45"},"schema_version":"1.0","source":{"id":"2504.20978","kind":"arxiv","version":3}},"canonical_sha256":"a4522d36e9799744a02242f2d4c48a0bee22ddea23e7eadec63819b42813c32f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4522d36e9799744a02242f2d4c48a0bee22ddea23e7eadec63819b42813c32f","first_computed_at":"2026-06-04T01:08:28.896050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:08:28.896050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vBvqYvp9KVwfTSW637iojeDOijllSqQxXSjdfI+H2Du2wtUjgJ8rvYslehRUe+a/TatiV84W4wVQzQNpLu6jCA==","signature_status":"signed_v1","signed_at":"2026-06-04T01:08:28.896601Z","signed_message":"canonical_sha256_bytes"},"source_id":"2504.20978","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ffa63c011ea36dd18df2f764fb6db5a1e937cece63facabe9745f405dcea901b","sha256:6587910a7e99144924b428d1de133a274381cb88b5f63078d0ebe79476453654"],"state_sha256":"509035b87114d88674b6d20818f7f79452acfb1f9c8c17f73597de3b2bd368ba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YufxwgnieX1jGufqWzopkrnVdcby3P8AY3a8O9MuZcIzjRL0yyHybFh50PmJJ8jSa1hbsurlkgp4uw5hiimoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T12:37:32.216927Z","bundle_sha256":"cbacb30f2e65205d1a48f755f656519a4c3a28e6f2a2437dc87ef370c22a6c47"}}