{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UOGO7L2UY47GXHCFW32NALDO7G","short_pith_number":"pith:UOGO7L2U","schema_version":"1.0","canonical_sha256":"a38cefaf54c73e6b9c45b6f4d02c6ef997e14ec7a3a0105135d6317496783e2e","source":{"kind":"arxiv","id":"1409.8133","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.8133","created_at":"2026-05-18T02:41:16.587809+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.8133v2","created_at":"2026-05-18T02:41:16.587809+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.8133","created_at":"2026-05-18T02:41:16.587809+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOGO7L2UY47G","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOGO7L2UY47GXHCF","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOGO7L2U","created_at":"2026-05-18T12:28:52.271510+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G","json":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G.json","graph_json":"https://pith.science/api/pith-number/UOGO7L2UY47GXHCFW32NALDO7G/graph.json","events_json":"https://pith.science/api/pith-number/UOGO7L2UY47GXHCFW32NALDO7G/events.json","paper":"https://pith.science/paper/UOGO7L2U"},"agent_actions":{"view_html":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G","download_json":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G.json","view_paper":"https://pith.science/paper/UOGO7L2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.8133&json=true","fetch_graph":"https://pith.science/api/pith-number/UOGO7L2UY47GXHCFW32NALDO7G/graph.json","fetch_events":"https://pith.science/api/pith-number/UOGO7L2UY47GXHCFW32NALDO7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/action/storage_attestation","attest_author":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/action/author_attestation","sign_citation":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/action/citation_signature","submit_replication":"https://pith.science/pith/UOGO7L2UY47GXHCFW32NALDO7G/action/replication_record"}},"created_at":"2026-05-18T02:41:16.587809+00:00","updated_at":"2026-05-18T02:41:16.587809+00:00"}