{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UMRERREPJCSEGIWDUFXOLCRVZ2","short_pith_number":"pith:UMRERREP","canonical_record":{"source":{"id":"1904.10212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-23T09:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"e63d742bdadaf0b28d0fd4764e67d6ed53b7f528ffb122eefe40064bce1ed4ac","abstract_canon_sha256":"0128a9a2b6152ecbe64e76f029e877ba5977397909fb3f68cc5f472f07c07d75"},"schema_version":"1.0"},"canonical_sha256":"a32248c48f48a44322c3a16ee58a35ce97b5cd1f12023f4988343f35f156136d","source":{"kind":"arxiv","id":"1904.10212","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10212","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10212v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10212","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"UMRERREPJCSE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UMRERREPJCSEGIWD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UMRERREP","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UMRERREPJCSEGIWDUFXOLCRVZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1904.10212","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-23T09:07:54Z","cross_cats_sorted":[],"title_canon_sha256":"e63d742bdadaf0b28d0fd4764e67d6ed53b7f528ffb122eefe40064bce1ed4ac","abstract_canon_sha256":"0128a9a2b6152ecbe64e76f029e877ba5977397909fb3f68cc5f472f07c07d75"},"schema_version":"1.0"},"canonical_sha256":"a32248c48f48a44322c3a16ee58a35ce97b5cd1f12023f4988343f35f156136d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:54.809129Z","signature_b64":"8Ozprx9nkX5I+b6fiCEYo5k3X8OCA/razvkp2/G/3AcMMwMGbkkAp61+atRfUjga9cHDJpQ60HU0/COk+3dBAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a32248c48f48a44322c3a16ee58a35ce97b5cd1f12023f4988343f35f156136d","last_reissued_at":"2026-05-17T23:47:54.808505Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:54.808505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.10212","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-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"muBPLK47EEOghVysZWrLmW85rItXdIi2Bor06wekWMckMP+kjwmdFTPRCEycvxzXBfX3fqPPHKAc1OzaxeYTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:13:17.071043Z"},"content_sha256":"3ad6c6336ad2896d981a8c6773c36101747d2d4575096ff1ba7a092f080f85a5","schema_version":"1.0","event_id":"sha256:3ad6c6336ad2896d981a8c6773c36101747d2d4575096ff1ba7a092f080f85a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UMRERREPJCSEGIWDUFXOLCRVZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graphs that are critical for the packing chromatic 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, Jasmina Ferme","submitted_at":"2019-04-23T09:07:54Z","abstract_excerpt":"Given a graph $G$, a coloring $c:V(G)\\longrightarrow \\{1,\\ldots,k\\}$ such that $c(u)=c(v)=i$ implies that vertices $u$ and $v$ are at distance greater than $i$, is called a packing coloring of $G$. The minimum number of colors in a packing coloring of $G$ is called the packing chromatic number of $G$, and is denoted by $\\chi_\\rho(G)$. In this paper, we propose the study of $\\chi_\\rho$-critical graphs, which are the graphs $G$ such that for any proper subgraph $H$ of $G$, $\\chi_\\rho(H)<\\chi_\\rho(G)$. We characterize $\\chi_\\rho$-critical graphs with diameter 2, and $\\chi_\\rho$-critical block gra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10212","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-17T23:47:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w6AhsLjgRVMuWPRYWH2MZliL03PCl261OONwfcnF9C+nvqaM1TwiRUQE0n1sedrDUyyUz8yCaADdW8IeJbJdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T07:13:17.071541Z"},"content_sha256":"094294a29c331b620fa74017494baea8a46fb1fb64ce42c28fffc8f1b4197a8a","schema_version":"1.0","event_id":"sha256:094294a29c331b620fa74017494baea8a46fb1fb64ce42c28fffc8f1b4197a8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UMRERREPJCSEGIWDUFXOLCRVZ2/bundle.json","state_url":"https://pith.science/pith/UMRERREPJCSEGIWDUFXOLCRVZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UMRERREPJCSEGIWDUFXOLCRVZ2/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-30T07:13:17Z","links":{"resolver":"https://pith.science/pith/UMRERREPJCSEGIWDUFXOLCRVZ2","bundle":"https://pith.science/pith/UMRERREPJCSEGIWDUFXOLCRVZ2/bundle.json","state":"https://pith.science/pith/UMRERREPJCSEGIWDUFXOLCRVZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UMRERREPJCSEGIWDUFXOLCRVZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UMRERREPJCSEGIWDUFXOLCRVZ2","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":"0128a9a2b6152ecbe64e76f029e877ba5977397909fb3f68cc5f472f07c07d75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-23T09:07:54Z","title_canon_sha256":"e63d742bdadaf0b28d0fd4764e67d6ed53b7f528ffb122eefe40064bce1ed4ac"},"schema_version":"1.0","source":{"id":"1904.10212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.10212","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"arxiv_version","alias_value":"1904.10212v1","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.10212","created_at":"2026-05-17T23:47:54Z"},{"alias_kind":"pith_short_12","alias_value":"UMRERREPJCSE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"UMRERREPJCSEGIWD","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"UMRERREP","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:094294a29c331b620fa74017494baea8a46fb1fb64ce42c28fffc8f1b4197a8a","target":"graph","created_at":"2026-05-17T23:47:54Z","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":"Given a graph $G$, a coloring $c:V(G)\\longrightarrow \\{1,\\ldots,k\\}$ such that $c(u)=c(v)=i$ implies that vertices $u$ and $v$ are at distance greater than $i$, is called a packing coloring of $G$. The minimum number of colors in a packing coloring of $G$ is called the packing chromatic number of $G$, and is denoted by $\\chi_\\rho(G)$. In this paper, we propose the study of $\\chi_\\rho$-critical graphs, which are the graphs $G$ such that for any proper subgraph $H$ of $G$, $\\chi_\\rho(H)<\\chi_\\rho(G)$. We characterize $\\chi_\\rho$-critical graphs with diameter 2, and $\\chi_\\rho$-critical block gra","authors_text":"Bo\\v{s}tjan Bre\\v{s}ar, Jasmina Ferme","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-23T09:07:54Z","title":"Graphs that are critical for the packing chromatic number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.10212","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:3ad6c6336ad2896d981a8c6773c36101747d2d4575096ff1ba7a092f080f85a5","target":"record","created_at":"2026-05-17T23:47:54Z","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":"0128a9a2b6152ecbe64e76f029e877ba5977397909fb3f68cc5f472f07c07d75","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-04-23T09:07:54Z","title_canon_sha256":"e63d742bdadaf0b28d0fd4764e67d6ed53b7f528ffb122eefe40064bce1ed4ac"},"schema_version":"1.0","source":{"id":"1904.10212","kind":"arxiv","version":1}},"canonical_sha256":"a32248c48f48a44322c3a16ee58a35ce97b5cd1f12023f4988343f35f156136d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a32248c48f48a44322c3a16ee58a35ce97b5cd1f12023f4988343f35f156136d","first_computed_at":"2026-05-17T23:47:54.808505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:54.808505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8Ozprx9nkX5I+b6fiCEYo5k3X8OCA/razvkp2/G/3AcMMwMGbkkAp61+atRfUjga9cHDJpQ60HU0/COk+3dBAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:54.809129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.10212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ad6c6336ad2896d981a8c6773c36101747d2d4575096ff1ba7a092f080f85a5","sha256:094294a29c331b620fa74017494baea8a46fb1fb64ce42c28fffc8f1b4197a8a"],"state_sha256":"a401894f49c3d9672690b18cf4e7abe340a5f6dd621512f7b9f8771ae81eb314"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4EWDRACPsk56liEvHvN0h7bBLPme+iKECwOQ/p7bx57Lx3f0M/xb1RyPnEo0damXLHvtyJ5HhrpltohWx7YBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T07:13:17.074488Z","bundle_sha256":"803d7fc071ed16cf2ddee76035bd567c82bcf6ce0a3ffe446334ecedc8b25045"}}