{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DUCDAM55GPNRDRKB662EIXGYKL","short_pith_number":"pith:DUCDAM55","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"},"canonical_sha256":"1d043033bd33db11c541f7b4445cd852db4cb92b539110a6bcab4b5af1400c89","source":{"kind":"arxiv","id":"1302.0721","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0721","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0721v1","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0721","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"DUCDAM55GPNR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DUCDAM55GPNRDRKB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DUCDAM55","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DUCDAM55GPNRDRKB662EIXGYKL","target":"record","payload":{"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"},"canonical_sha256":"1d043033bd33db11c541f7b4445cd852db4cb92b539110a6bcab4b5af1400c89","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"},"source_kind":"arxiv","source_id":"1302.0721","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-18T03:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xuQkyu2auKop+T+O7vCPB0GeMfhMPNX5ytgwoCq8xW8EZtaESD/GKRA5EaauiDA6SHk0RwrY0+1wcdujbSTvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:58:15.768691Z"},"content_sha256":"d279118c512bfa1088da620daf08a23e8942f58d242edb715ef22e98eee8409e","schema_version":"1.0","event_id":"sha256:d279118c512bfa1088da620daf08a23e8942f58d242edb715ef22e98eee8409e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DUCDAM55GPNRDRKB662EIXGYKL","target":"graph","payload":{"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"},"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-18T03:34:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cfdTEZzH9reVxcv7U0tGkUn7DlUXBGrgxEo9ckr8ImJGuOVJkGqxdPfCgTGLJOXJGBVufqs81J4AHLCpVCxiCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T04:58:15.769262Z"},"content_sha256":"cf32c2c90a22e42521109628852f0c901a1c86a920b94fc6f3fa090c6e1ff873","schema_version":"1.0","event_id":"sha256:cf32c2c90a22e42521109628852f0c901a1c86a920b94fc6f3fa090c6e1ff873"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/bundle.json","state_url":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUCDAM55GPNRDRKB662EIXGYKL/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-25T04:58:15Z","links":{"resolver":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL","bundle":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/bundle.json","state":"https://pith.science/pith/DUCDAM55GPNRDRKB662EIXGYKL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUCDAM55GPNRDRKB662EIXGYKL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DUCDAM55GPNRDRKB662EIXGYKL","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":"e1e3e494c5c2b6016f30137f7d294bd421c705b8380a9f2c24ed6cd250b62147","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T15:29:43Z","title_canon_sha256":"2ea40917add271354eba113c4b46843a4a9436468e380a51d23f8eec614ce1de"},"schema_version":"1.0","source":{"id":"1302.0721","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.0721","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.0721v1","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.0721","created_at":"2026-05-18T03:34:36Z"},{"alias_kind":"pith_short_12","alias_value":"DUCDAM55GPNR","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DUCDAM55GPNRDRKB","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DUCDAM55","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:cf32c2c90a22e42521109628852f0c901a1c86a920b94fc6f3fa090c6e1ff873","target":"graph","created_at":"2026-05-18T03:34:36Z","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 $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","authors_text":"Jan Ekstein, Olivier Togni, P\\v{r}emysl Holub","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T15:29:43Z","title":"The Packing Coloring of Distance Graphs $D(k,t)$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.0721","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:d279118c512bfa1088da620daf08a23e8942f58d242edb715ef22e98eee8409e","target":"record","created_at":"2026-05-18T03:34:36Z","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":"e1e3e494c5c2b6016f30137f7d294bd421c705b8380a9f2c24ed6cd250b62147","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-02-04T15:29:43Z","title_canon_sha256":"2ea40917add271354eba113c4b46843a4a9436468e380a51d23f8eec614ce1de"},"schema_version":"1.0","source":{"id":"1302.0721","kind":"arxiv","version":1}},"canonical_sha256":"1d043033bd33db11c541f7b4445cd852db4cb92b539110a6bcab4b5af1400c89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d043033bd33db11c541f7b4445cd852db4cb92b539110a6bcab4b5af1400c89","first_computed_at":"2026-05-18T03:34:36.505526Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:34:36.505526Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PKzou9bh9JZOgA2DrUi2ypV1WDwRcHJ4KsM3CAeKgtDCQxWwplxN0HdN8m0IkPzHJSGV3AefT2k24kFGEOIqCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:34:36.506079Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.0721","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d279118c512bfa1088da620daf08a23e8942f58d242edb715ef22e98eee8409e","sha256:cf32c2c90a22e42521109628852f0c901a1c86a920b94fc6f3fa090c6e1ff873"],"state_sha256":"df6363c7e30cb4ca24c68312e2a3a3701c6f8c661d6e3603a654185a227fcbf2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yU6Jj+N4jREPX5Iuj2ncIeLVjX9ArPHLc/u41CvsYL+orHqOdXGxDXanoTul0IoJKNro12MxLXZw2eX5it0MAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T04:58:15.772377Z","bundle_sha256":"69dd3bd00f6ae588d7c7284cdc593f410c1498f8a81c8ba12c47e351fc874e14"}}