{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UOGO7L2UY47GXHCFW32NALDO7G","short_pith_number":"pith:UOGO7L2U","canonical_record":{"source":{"id":"1409.8133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-29T14:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"2b3cff189214dcd10b0875f38a9729a676da39b185d8a70e0c3ecdabe141b712","abstract_canon_sha256":"40243d21cb47ff93ae7894b563bfd868b3bf186691c6024726e7961e93415357"},"schema_version":"1.0"},"canonical_sha256":"a38cefaf54c73e6b9c45b6f4d02c6ef997e14ec7a3a0105135d6317496783e2e","source":{"kind":"arxiv","id":"1409.8133","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8133","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8133v2","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8133","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"UOGO7L2UY47G","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UOGO7L2UY47GXHCF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UOGO7L2U","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UOGO7L2UY47GXHCFW32NALDO7G","target":"record","payload":{"canonical_record":{"source":{"id":"1409.8133","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-29T14:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"2b3cff189214dcd10b0875f38a9729a676da39b185d8a70e0c3ecdabe141b712","abstract_canon_sha256":"40243d21cb47ff93ae7894b563bfd868b3bf186691c6024726e7961e93415357"},"schema_version":"1.0"},"canonical_sha256":"a38cefaf54c73e6b9c45b6f4d02c6ef997e14ec7a3a0105135d6317496783e2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:16.588248Z","signature_b64":"7MwVAH6on+D1hORoi52OMhjL2iQoi98z+mAh/q4+uYD0h7rRZ/upwHknuXvlE79ia2TV78CMRsSwIJ9pbGUjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a38cefaf54c73e6b9c45b6f4d02c6ef997e14ec7a3a0105135d6317496783e2e","last_reissued_at":"2026-05-18T02:41:16.587714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:16.587714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.8133","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-18T02:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anwbWprl1JVoy9zdzXtuPAQ/HtFQZZIz3XM+JjtGl5WgvOqw/fTe+19pYnwhIOCskt/DxfK2E8ID7ZWlmenIDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:28:59.454220Z"},"content_sha256":"6403226241a5f1451a515750191ffbf7ea7715bf2847f06719c9fb14a027b8ed","schema_version":"1.0","event_id":"sha256:6403226241a5f1451a515750191ffbf7ea7715bf2847f06719c9fb14a027b8ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UOGO7L2UY47GXHCFW32NALDO7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Maximum k-Differential Coloring Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Michael Bekos, Michael Kaufmann, Sankar Veeramoni, Stephen Kobourov","submitted_at":"2014-09-29T14:29:31Z","abstract_excerpt":"Given an $n$-vertex graph $G$ and two positive integers $d,k \\in \\mathbb{N}$, the ($d,kn$)-differential coloring problem asks for a coloring of the vertices of $G$ (if one exists) with distinct numbers from 1 to $kn$ (treated as \\emph{colors}), such that the minimum difference between the two colors of any adjacent vertices is at least $d$. While it was known that the problem of determining whether a general graph is ($2,n$)-differential colorable is NP-complete, our main contribution is a complete characterization of bipartite, planar and outerplanar graphs that admit ($2,kn$)-differential co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8133","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-18T02:41:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pK9x/xplSgTsxGxVLL4lqHFEmmXip6ecyQEaiCUX4OY4UMjZvvqhuandNBvWYBnmLU2JbCPmQI7/dI/sJDpzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T04:28:59.454583Z"},"content_sha256":"bd57f3980cb893507221af5aa899d03b8ca1ea9bd0362cac81c9f731188b0ac7","schema_version":"1.0","event_id":"sha256:bd57f3980cb893507221af5aa899d03b8ca1ea9bd0362cac81c9f731188b0ac7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/bundle.json","state_url":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOGO7L2UY47GXHCFW32NALDO7G/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-05-28T04:28:59Z","links":{"resolver":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G","bundle":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/bundle.json","state":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOGO7L2UY47GXHCFW32NALDO7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UOGO7L2UY47GXHCFW32NALDO7G","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":"40243d21cb47ff93ae7894b563bfd868b3bf186691c6024726e7961e93415357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-29T14:29:31Z","title_canon_sha256":"2b3cff189214dcd10b0875f38a9729a676da39b185d8a70e0c3ecdabe141b712"},"schema_version":"1.0","source":{"id":"1409.8133","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.8133","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"arxiv_version","alias_value":"1409.8133v2","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8133","created_at":"2026-05-18T02:41:16Z"},{"alias_kind":"pith_short_12","alias_value":"UOGO7L2UY47G","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UOGO7L2UY47GXHCF","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UOGO7L2U","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:bd57f3980cb893507221af5aa899d03b8ca1ea9bd0362cac81c9f731188b0ac7","target":"graph","created_at":"2026-05-18T02:41:16Z","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":"Given an $n$-vertex graph $G$ and two positive integers $d,k \\in \\mathbb{N}$, the ($d,kn$)-differential coloring problem asks for a coloring of the vertices of $G$ (if one exists) with distinct numbers from 1 to $kn$ (treated as \\emph{colors}), such that the minimum difference between the two colors of any adjacent vertices is at least $d$. While it was known that the problem of determining whether a general graph is ($2,n$)-differential colorable is NP-complete, our main contribution is a complete characterization of bipartite, planar and outerplanar graphs that admit ($2,kn$)-differential co","authors_text":"Michael Bekos, Michael Kaufmann, Sankar Veeramoni, Stephen Kobourov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-29T14:29:31Z","title":"The Maximum k-Differential Coloring Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.8133","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:6403226241a5f1451a515750191ffbf7ea7715bf2847f06719c9fb14a027b8ed","target":"record","created_at":"2026-05-18T02:41:16Z","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":"40243d21cb47ff93ae7894b563bfd868b3bf186691c6024726e7961e93415357","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-29T14:29:31Z","title_canon_sha256":"2b3cff189214dcd10b0875f38a9729a676da39b185d8a70e0c3ecdabe141b712"},"schema_version":"1.0","source":{"id":"1409.8133","kind":"arxiv","version":2}},"canonical_sha256":"a38cefaf54c73e6b9c45b6f4d02c6ef997e14ec7a3a0105135d6317496783e2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a38cefaf54c73e6b9c45b6f4d02c6ef997e14ec7a3a0105135d6317496783e2e","first_computed_at":"2026-05-18T02:41:16.587714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:41:16.587714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7MwVAH6on+D1hORoi52OMhjL2iQoi98z+mAh/q4+uYD0h7rRZ/upwHknuXvlE79ia2TV78CMRsSwIJ9pbGUjCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:41:16.588248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.8133","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6403226241a5f1451a515750191ffbf7ea7715bf2847f06719c9fb14a027b8ed","sha256:bd57f3980cb893507221af5aa899d03b8ca1ea9bd0362cac81c9f731188b0ac7"],"state_sha256":"ce98814a65585096e4e40faacdb006d919a806342ff8f3ec27c0be72f48f1210"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gY9pefuNNSH1eiYf0w3cSBQJgSnHfN0HoHzvGM+8DYEgJC/yVP0j93HjbxY11SS6LHKQwkLuMDDgz2rB3XvzCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T04:28:59.456744Z","bundle_sha256":"c02575e5d143c1f271cf7b9b18c1484b2769923038d3af16eca930420245a374"}}