{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DUCDAM55GPNRDRKB662EIXGYKL","short_pith_number":"pith:DUCDAM55","schema_version":"1.0","canonical_sha256":"1d043033bd33db11c541f7b4445cd852db4cb92b539110a6bcab4b5af1400c89","source":{"kind":"arxiv","id":"1302.0721","version":1},"attestation_state":"computed","paper":{"title":"The Packing Coloring of Distance Graphs $D(k,t)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Ekstein, Olivier Togni, P\\v{r}emysl Holub","submitted_at":"2013-02-04T15:29:43Z","abstract_excerpt":"The packing chromatic number $\\chi_{\\rho}(G)$ of a graph $G$ is the smallest integer $p$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{p}$ where vertices in $X_{i}$ have pairwise distance greater than $i$. For $k < t$ we study the packing chromatic number of infinite distance graphs $D(k, t)$, i.e. graphs with the set $\\Z$ of integers as vertex set and in which two distinct vertices $i, j \\in \\Z$ are adjacent if and only if $|i - j| \\in \\{k, t\\}$.\n  We generalize results by Ekstein et al. for graphs $D (1, t)$. For sufficiently large $t$ we prove that $\\chi"},"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":"1302.0721","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T15:29:43Z","cross_cats_sorted":[],"title_canon_sha256":"2ea40917add271354eba113c4b46843a4a9436468e380a51d23f8eec614ce1de","abstract_canon_sha256":"e1e3e494c5c2b6016f30137f7d294bd421c705b8380a9f2c24ed6cd250b62147"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:34:36.506079Z","signature_b64":"PKzou9bh9JZOgA2DrUi2ypV1WDwRcHJ4KsM3CAeKgtDCQxWwplxN0HdN8m0IkPzHJSGV3AefT2k24kFGEOIqCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d043033bd33db11c541f7b4445cd852db4cb92b539110a6bcab4b5af1400c89","last_reissued_at":"2026-05-18T03:34:36.505526Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:34:36.505526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Packing Coloring of Distance Graphs $D(k,t)$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jan Ekstein, Olivier Togni, P\\v{r}emysl Holub","submitted_at":"2013-02-04T15:29:43Z","abstract_excerpt":"The packing chromatic number $\\chi_{\\rho}(G)$ of a graph $G$ is the smallest integer $p$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{p}$ where vertices in $X_{i}$ have pairwise distance greater than $i$. For $k < t$ we study the packing chromatic number of infinite distance graphs $D(k, t)$, i.e. graphs with the set $\\Z$ of integers as vertex set and in which two distinct vertices $i, j \\in \\Z$ are adjacent if and only if $|i - j| \\in \\{k, t\\}$.\n  We generalize results by Ekstein et al. for graphs $D (1, t)$. For sufficiently large $t$ we prove that $\\chi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0721","kind":"arxiv","version":1},"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":"1302.0721","created_at":"2026-05-18T03:34:36.505616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.0721v1","created_at":"2026-05-18T03:34:36.505616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0721","created_at":"2026-05-18T03:34:36.505616+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUCDAM55GPNR","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUCDAM55GPNRDRKB","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUCDAM55","created_at":"2026-05-18T12:27:43.054852+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/DUCDAM55GPNRDRKB662EIXGYKL","json":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL.json","graph_json":"https://pith.science/api/pith-number/DUCDAM55GPNRDRKB662EIXGYKL/graph.json","events_json":"https://pith.science/api/pith-number/DUCDAM55GPNRDRKB662EIXGYKL/events.json","paper":"https://pith.science/paper/DUCDAM55"},"agent_actions":{"view_html":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL","download_json":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL.json","view_paper":"https://pith.science/paper/DUCDAM55","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.0721&json=true","fetch_graph":"https://pith.science/api/pith-number/DUCDAM55GPNRDRKB662EIXGYKL/graph.json","fetch_events":"https://pith.science/api/pith-number/DUCDAM55GPNRDRKB662EIXGYKL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/action/storage_attestation","attest_author":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/action/author_attestation","sign_citation":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/action/citation_signature","submit_replication":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/action/replication_record"}},"created_at":"2026-05-18T03:34:36.505616+00:00","updated_at":"2026-05-18T03:34:36.505616+00:00"}