{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:OZUX3JXRJH2GGLXKS3WGKHGLKC","short_pith_number":"pith:OZUX3JXR","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"},"canonical_sha256":"76697da6f149f4632eea96ec651ccb50b52dde8f50e3932e0608258c9660c3d9","source":{"kind":"arxiv","id":"1105.5652","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5652","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5652v1","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5652","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"OZUX3JXRJH2G","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"OZUX3JXRJH2GGLXK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"OZUX3JXR","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:OZUX3JXRJH2GGLXKS3WGKHGLKC","target":"record","payload":{"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"},"canonical_sha256":"76697da6f149f4632eea96ec651ccb50b52dde8f50e3932e0608258c9660c3d9","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"},"source_kind":"arxiv","source_id":"1105.5652","source_version":1,"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-18T04:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qt0TKlyxbRu6mD+YvM5zAmQftzZsOrp9gpuZ+0hGGtD/u71YuLH5TuvAxT/U87Sv9pAkR9MvJlaD2+2wZMluBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:36:57.019766Z"},"content_sha256":"a224ea74246ec9bc2122709e713667351f6405ec9f3f776d771b4c577d5cf544","schema_version":"1.0","event_id":"sha256:a224ea74246ec9bc2122709e713667351f6405ec9f3f776d771b4c577d5cf544"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:OZUX3JXRJH2GGLXKS3WGKHGLKC","target":"graph","payload":{"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"},"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-18T04:21:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c14XmSUenCQvOP1MIfH92Qa58c/L+Wh917inJrKFlNWPpE3JI9xGnvooemklevxtLGxE2PdASk5kX7ZdEEBNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:36:57.020218Z"},"content_sha256":"36e9db223d4d71fbebe204278cdbe20a9c24289e619683afcaa3ad1ad65addc5","schema_version":"1.0","event_id":"sha256:36e9db223d4d71fbebe204278cdbe20a9c24289e619683afcaa3ad1ad65addc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/bundle.json","state_url":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/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-24T17:36:57Z","links":{"resolver":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC","bundle":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/bundle.json","state":"https://pith.science/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZUX3JXRJH2GGLXKS3WGKHGLKC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:OZUX3JXRJH2GGLXKS3WGKHGLKC","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":"9092c35ec678c209767b8b4bb1c038b2231c8f6a2647efbc6af3059a6af1b94d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-27T20:08:03Z","title_canon_sha256":"021d4ff8f22bba9081cd0b5cb140ae4da3984e6f86eda0bce78b217d9335daf5"},"schema_version":"1.0","source":{"id":"1105.5652","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.5652","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"arxiv_version","alias_value":"1105.5652v1","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.5652","created_at":"2026-05-18T04:21:10Z"},{"alias_kind":"pith_short_12","alias_value":"OZUX3JXRJH2G","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"OZUX3JXRJH2GGLXK","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"OZUX3JXR","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:36e9db223d4d71fbebe204278cdbe20a9c24289e619683afcaa3ad1ad65addc5","target":"graph","created_at":"2026-05-18T04:21:10Z","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":"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 ","authors_text":"Bernard Lidick\\'y, Jan Ekstein, P\\v{r}emysl Holub","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-27T20:08:03Z","title":"Packing Chromatic Number of Distance Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.5652","kind":"arxiv","version":1},"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:a224ea74246ec9bc2122709e713667351f6405ec9f3f776d771b4c577d5cf544","target":"record","created_at":"2026-05-18T04:21:10Z","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":"9092c35ec678c209767b8b4bb1c038b2231c8f6a2647efbc6af3059a6af1b94d","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-05-27T20:08:03Z","title_canon_sha256":"021d4ff8f22bba9081cd0b5cb140ae4da3984e6f86eda0bce78b217d9335daf5"},"schema_version":"1.0","source":{"id":"1105.5652","kind":"arxiv","version":1}},"canonical_sha256":"76697da6f149f4632eea96ec651ccb50b52dde8f50e3932e0608258c9660c3d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"76697da6f149f4632eea96ec651ccb50b52dde8f50e3932e0608258c9660c3d9","first_computed_at":"2026-05-18T04:21:10.259736Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:21:10.259736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AfDzXcI+kHYS8QerCoQSXvsVZbZJpoHLHUyXFhknuggT8ag+6UeOAg3vXcELF66ce1kQXSW8ageoCD3sMWD2BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:21:10.260358Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.5652","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a224ea74246ec9bc2122709e713667351f6405ec9f3f776d771b4c577d5cf544","sha256:36e9db223d4d71fbebe204278cdbe20a9c24289e619683afcaa3ad1ad65addc5"],"state_sha256":"1a498bba44deec5c2b9037afdef9bdcf381e765e9934cd1910131663da934375"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dp6MTjoicMn64s++Ek9S45K7jtrF9Ezlx8M2KzYu6LYxT0jcCVE0yWI9viT5pRo+zZt3/i5Kb30Gc6gjGQSzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:36:57.022694Z","bundle_sha256":"5192e52dd5d6dc2331d2e280da204982f8f2e034158cfcd1a7e8a1cafe28620a"}}