{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HWDJJGMPNDFNJBIMY264IIE63A","short_pith_number":"pith:HWDJJGMP","canonical_record":{"source":{"id":"1707.04910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T16:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"25fba34a224ce6fd7c0d4f117a21580d6336c458b88a1c4d948e9bdb438ce899","abstract_canon_sha256":"dd32aa0f5800671eb44c708826a7bfe7ccb59728d0b3db29811d0e7cb8bdf626"},"schema_version":"1.0"},"canonical_sha256":"3d8694998f68cad4850cc6bdc4209ed8172df3be9c88b011991808ab5ca8ffd5","source":{"kind":"arxiv","id":"1707.04910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04910","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04910v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04910","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"HWDJJGMPNDFN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HWDJJGMPNDFNJBIM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HWDJJGMP","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HWDJJGMPNDFNJBIMY264IIE63A","target":"record","payload":{"canonical_record":{"source":{"id":"1707.04910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T16:55:16Z","cross_cats_sorted":[],"title_canon_sha256":"25fba34a224ce6fd7c0d4f117a21580d6336c458b88a1c4d948e9bdb438ce899","abstract_canon_sha256":"dd32aa0f5800671eb44c708826a7bfe7ccb59728d0b3db29811d0e7cb8bdf626"},"schema_version":"1.0"},"canonical_sha256":"3d8694998f68cad4850cc6bdc4209ed8172df3be9c88b011991808ab5ca8ffd5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.811184Z","signature_b64":"s34mlWsV53i0yMRlxT2EP82a2+2mu1UAw94YQMBc4ekDi4LTskr550iJv7xRm6TG+wqsvB4+s76nXpE1dBG6Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d8694998f68cad4850cc6bdc4209ed8172df3be9c88b011991808ab5ca8ffd5","last_reissued_at":"2026-05-18T00:40:11.810493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.810493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.04910","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-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7s0wlICxpwXA40Uk1pj/rdGJogvA73Nhb49He/JwuUFlTvsMpCrG/kB0HUCRz+LVmOnTKCgromD1OY44PeZKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:29:20.799922Z"},"content_sha256":"890bd8f30b4a12aa4662913ac988869cd847b38167f887e2d271595637e69d17","schema_version":"1.0","event_id":"sha256:890bd8f30b4a12aa4662913ac988869cd847b38167f887e2d271595637e69d17"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HWDJJGMPNDFNJBIMY264IIE63A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing chromatic number versus chromatic and clique number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Douglas F. Rall, Kirsti Wash, Sandi Klav\\v{z}ar","submitted_at":"2017-07-16T16:55:16Z","abstract_excerpt":"The packing chromatic number $\\chi_{\\rho}(G)$ of a graph $G$ is the smallest integer $k$ such that the vertex set of $G$ can be partitioned into sets $V_i$, $i\\in [k]$, where each $V_i$ is an $i$-packing. In this paper, we investigate for a given triple $(a,b,c)$ of positive integers whether there exists a graph $G$ such that $\\omega(G) = a$, $\\chi(G) = b$, and $\\chi_{\\rho}(G) = c$. If so, we say that $(a, b, c)$ is realizable. It is proved that $b=c\\ge 3$ implies $a=b$, and that triples $(2,k,k+1)$ and $(2,k,k+2)$ are not realizable as soon as $k\\ge 4$. Some of the obtained results are deduce"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04910","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-18T00:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9LSO0wPMJRsIgm8xwn8I6wJ15hKlWoYIwATj4JqU77Ho+VC4ARZ1QAHtMwOu3xXfTubbHqg3abtDGHQFdFbsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:29:20.800274Z"},"content_sha256":"41383ec4fb40a8e521f03e2b79f5015b23962ca8d1eee57d5d47daa736c0fcd0","schema_version":"1.0","event_id":"sha256:41383ec4fb40a8e521f03e2b79f5015b23962ca8d1eee57d5d47daa736c0fcd0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HWDJJGMPNDFNJBIMY264IIE63A/bundle.json","state_url":"https://pith.science/pith/HWDJJGMPNDFNJBIMY264IIE63A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HWDJJGMPNDFNJBIMY264IIE63A/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-05-30T05:29:20Z","links":{"resolver":"https://pith.science/pith/HWDJJGMPNDFNJBIMY264IIE63A","bundle":"https://pith.science/pith/HWDJJGMPNDFNJBIMY264IIE63A/bundle.json","state":"https://pith.science/pith/HWDJJGMPNDFNJBIMY264IIE63A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HWDJJGMPNDFNJBIMY264IIE63A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HWDJJGMPNDFNJBIMY264IIE63A","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":"dd32aa0f5800671eb44c708826a7bfe7ccb59728d0b3db29811d0e7cb8bdf626","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T16:55:16Z","title_canon_sha256":"25fba34a224ce6fd7c0d4f117a21580d6336c458b88a1c4d948e9bdb438ce899"},"schema_version":"1.0","source":{"id":"1707.04910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04910","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04910v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04910","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"HWDJJGMPNDFN","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"HWDJJGMPNDFNJBIM","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"HWDJJGMP","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:41383ec4fb40a8e521f03e2b79f5015b23962ca8d1eee57d5d47daa736c0fcd0","target":"graph","created_at":"2026-05-18T00:40:11Z","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 the vertex set of $G$ can be partitioned into sets $V_i$, $i\\in [k]$, where each $V_i$ is an $i$-packing. In this paper, we investigate for a given triple $(a,b,c)$ of positive integers whether there exists a graph $G$ such that $\\omega(G) = a$, $\\chi(G) = b$, and $\\chi_{\\rho}(G) = c$. If so, we say that $(a, b, c)$ is realizable. It is proved that $b=c\\ge 3$ implies $a=b$, and that triples $(2,k,k+1)$ and $(2,k,k+2)$ are not realizable as soon as $k\\ge 4$. Some of the obtained results are deduce","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Douglas F. Rall, Kirsti Wash, Sandi Klav\\v{z}ar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T16:55:16Z","title":"Packing chromatic number versus chromatic and clique number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04910","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:890bd8f30b4a12aa4662913ac988869cd847b38167f887e2d271595637e69d17","target":"record","created_at":"2026-05-18T00:40:11Z","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":"dd32aa0f5800671eb44c708826a7bfe7ccb59728d0b3db29811d0e7cb8bdf626","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T16:55:16Z","title_canon_sha256":"25fba34a224ce6fd7c0d4f117a21580d6336c458b88a1c4d948e9bdb438ce899"},"schema_version":"1.0","source":{"id":"1707.04910","kind":"arxiv","version":1}},"canonical_sha256":"3d8694998f68cad4850cc6bdc4209ed8172df3be9c88b011991808ab5ca8ffd5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d8694998f68cad4850cc6bdc4209ed8172df3be9c88b011991808ab5ca8ffd5","first_computed_at":"2026-05-18T00:40:11.810493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.810493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s34mlWsV53i0yMRlxT2EP82a2+2mu1UAw94YQMBc4ekDi4LTskr550iJv7xRm6TG+wqsvB4+s76nXpE1dBG6Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.811184Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:890bd8f30b4a12aa4662913ac988869cd847b38167f887e2d271595637e69d17","sha256:41383ec4fb40a8e521f03e2b79f5015b23962ca8d1eee57d5d47daa736c0fcd0"],"state_sha256":"b901f7ca9cec3a3279a3a9b9bb168495a83b852af4f5feb436c9841f98ee6c14"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Ls5iDEl0lJq6cj2goFtHz16UJYgv5os8edl/FEpy5aG76aZSBLNe5sdVzwqsO7p4piDzHjJkByh5m9zvE/lDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:29:20.802227Z","bundle_sha256":"d70d85375b67a088473aec83a5fb5c72d855278549df59d2da1f6d9baa5553bd"}}