{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OZUX3JXRJH2GGLXKS3WGKHGLKC","short_pith_number":"pith:OZUX3JXR","schema_version":"1.0","canonical_sha256":"76697da6f149f4632eea96ec651ccb50b52dde8f50e3932e0608258c9660c3d9","source":{"kind":"arxiv","id":"1105.5652","version":1},"attestation_state":"computed","paper":{"title":"Packing Chromatic Number of Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bernard Lidick\\'y, Jan Ekstein, P\\v{r}emysl Holub","submitted_at":"2011-05-27T20:08:03Z","abstract_excerpt":"The packing chromatic number $\\chi_{\\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that vertices of $G$ can be partitioned into disjoint classes $X_1, ..., X_k$ where vertices in $X_i$ have pairwise distance greater than $i$. We study the packing chromatic number of infinite distance graphs $G(Z, D)$, 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 D$. In this paper we focus on distance graphs with $D = \\{1, t\\}$. We improve some results of Togni who initiated the study. It is shown that "},"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":"1105.5652","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-27T20:08:03Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"021d4ff8f22bba9081cd0b5cb140ae4da3984e6f86eda0bce78b217d9335daf5","abstract_canon_sha256":"9092c35ec678c209767b8b4bb1c038b2231c8f6a2647efbc6af3059a6af1b94d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:21:10.260358Z","signature_b64":"AfDzXcI+kHYS8QerCoQSXvsVZbZJpoHLHUyXFhknuggT8ag+6UeOAg3vXcELF66ce1kQXSW8ageoCD3sMWD2BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76697da6f149f4632eea96ec651ccb50b52dde8f50e3932e0608258c9660c3d9","last_reissued_at":"2026-05-18T04:21:10.259736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:21:10.259736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Packing Chromatic Number of Distance Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Bernard Lidick\\'y, Jan Ekstein, P\\v{r}emysl Holub","submitted_at":"2011-05-27T20:08:03Z","abstract_excerpt":"The packing chromatic number $\\chi_{\\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that vertices of $G$ can be partitioned into disjoint classes $X_1, ..., X_k$ where vertices in $X_i$ have pairwise distance greater than $i$. We study the packing chromatic number of infinite distance graphs $G(Z, D)$, 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 D$. In this paper we focus on distance graphs with $D = \\{1, t\\}$. We improve some results of Togni who initiated the study. It is shown that "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5652","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":"1105.5652","created_at":"2026-05-18T04:21:10.259821+00:00"},{"alias_kind":"arxiv_version","alias_value":"1105.5652v1","created_at":"2026-05-18T04:21:10.259821+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5652","created_at":"2026-05-18T04:21:10.259821+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZUX3JXRJH2G","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZUX3JXRJH2GGLXK","created_at":"2026-05-18T12:26:39.201973+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZUX3JXR","created_at":"2026-05-18T12:26:39.201973+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/OZUX3JXRJH2GGLXKS3WGKHGLKC","json":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC.json","graph_json":"https://pith.science/api/pith-number/OZUX3JXRJH2GGLXKS3WGKHGLKC/graph.json","events_json":"https://pith.science/api/pith-number/OZUX3JXRJH2GGLXKS3WGKHGLKC/events.json","paper":"https://pith.science/paper/OZUX3JXR"},"agent_actions":{"view_html":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC","download_json":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC.json","view_paper":"https://pith.science/paper/OZUX3JXR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1105.5652&json=true","fetch_graph":"https://pith.science/api/pith-number/OZUX3JXRJH2GGLXKS3WGKHGLKC/graph.json","fetch_events":"https://pith.science/api/pith-number/OZUX3JXRJH2GGLXKS3WGKHGLKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/action/storage_attestation","attest_author":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/action/author_attestation","sign_citation":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/action/citation_signature","submit_replication":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/action/replication_record"}},"created_at":"2026-05-18T04:21:10.259821+00:00","updated_at":"2026-05-18T04:21:10.259821+00:00"}