{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Q67OAIFFAAJXUJCOTCXVZJCKCI","short_pith_number":"pith:Q67OAIFF","canonical_record":{"source":{"id":"1608.05573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T11:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"5bae71e4a58769aa7793dc1bdf52131e439c5fe1d98756947394bd0d8b00fe35","abstract_canon_sha256":"75787fc0633139c5f00c3e51f57a6263c020e032daca342a9507919aad950029"},"schema_version":"1.0"},"canonical_sha256":"87bee020a500137a244e98af5ca44a121c12371faf4c6814588588a7a099d754","source":{"kind":"arxiv","id":"1608.05573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05573","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05573v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05573","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"Q67OAIFFAAJX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q67OAIFFAAJXUJCO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q67OAIFF","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Q67OAIFFAAJXUJCOTCXVZJCKCI","target":"record","payload":{"canonical_record":{"source":{"id":"1608.05573","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T11:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"5bae71e4a58769aa7793dc1bdf52131e439c5fe1d98756947394bd0d8b00fe35","abstract_canon_sha256":"75787fc0633139c5f00c3e51f57a6263c020e032daca342a9507919aad950029"},"schema_version":"1.0"},"canonical_sha256":"87bee020a500137a244e98af5ca44a121c12371faf4c6814588588a7a099d754","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:28.149345Z","signature_b64":"4UntKTjjJumlTskVtDkc5j/FmVlHAZ01A4dGaK4KC5Prvr6xGfJ+s4gsoXvh+bHQ2irrdiQuwaiUTaroICc4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"87bee020a500137a244e98af5ca44a121c12371faf4c6814588588a7a099d754","last_reissued_at":"2026-05-18T01:08:28.148780Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:28.148780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.05573","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aceGEZu536JWiOv2OoVW0gL7yMMKan1JSmJmp29Swks8obA7zVhP9fqmbLqVC3JbcFVmcMRVZ0IeyDsHhwJ4CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:16:33.437709Z"},"content_sha256":"b59a6f057c2abbffb528f99cddf654220a15617644482a722489b54ce0875d8f","schema_version":"1.0","event_id":"sha256:b59a6f057c2abbffb528f99cddf654220a15617644482a722489b54ce0875d8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Q67OAIFFAAJXUJCOTCXVZJCKCI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing chromatic number, $(1,1,2,2)$-colorings, and characterizing the Petersen graph","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":"2016-08-19T11:23:13Z","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 $\\Pi_1,\\ldots,\\Pi_k$, where $\\Pi_i$, $i\\in [k]$, is an $i$-packing. The following conjecture is posed and studied: if $G$ is a subcubic graph, then $\\chi_{\\rho}(S(G))\\le 5$, where $S(G)$ is the subdivision of $G$. The conjecture is proved for all generalized prisms of cycles. To get this result it is proved that if $G$ is a generalized prism of a cycle, then $G$ is $(1,1,2,2)$-colorable if and only if $G$ is not the Petersen graph. The validity o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05573","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-18T01:08:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5o2RRkjo7TnKNC1TdeG+QcHhgUzgpIv4/FU5n/sbGn/3i++/mKNZyerMej7/Oc4k8EOZWbwtKl8rCv5QZzAYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T19:16:33.438037Z"},"content_sha256":"62f8463fbc6a32bc13a370335602618a273d1e558146cf082c1245cf72d69921","schema_version":"1.0","event_id":"sha256:62f8463fbc6a32bc13a370335602618a273d1e558146cf082c1245cf72d69921"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q67OAIFFAAJXUJCOTCXVZJCKCI/bundle.json","state_url":"https://pith.science/pith/Q67OAIFFAAJXUJCOTCXVZJCKCI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q67OAIFFAAJXUJCOTCXVZJCKCI/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-20T19:16:33Z","links":{"resolver":"https://pith.science/pith/Q67OAIFFAAJXUJCOTCXVZJCKCI","bundle":"https://pith.science/pith/Q67OAIFFAAJXUJCOTCXVZJCKCI/bundle.json","state":"https://pith.science/pith/Q67OAIFFAAJXUJCOTCXVZJCKCI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q67OAIFFAAJXUJCOTCXVZJCKCI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Q67OAIFFAAJXUJCOTCXVZJCKCI","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":"75787fc0633139c5f00c3e51f57a6263c020e032daca342a9507919aad950029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T11:23:13Z","title_canon_sha256":"5bae71e4a58769aa7793dc1bdf52131e439c5fe1d98756947394bd0d8b00fe35"},"schema_version":"1.0","source":{"id":"1608.05573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.05573","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"arxiv_version","alias_value":"1608.05573v1","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.05573","created_at":"2026-05-18T01:08:28Z"},{"alias_kind":"pith_short_12","alias_value":"Q67OAIFFAAJX","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"Q67OAIFFAAJXUJCO","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"Q67OAIFF","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:62f8463fbc6a32bc13a370335602618a273d1e558146cf082c1245cf72d69921","target":"graph","created_at":"2026-05-18T01:08:28Z","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 $\\Pi_1,\\ldots,\\Pi_k$, where $\\Pi_i$, $i\\in [k]$, is an $i$-packing. The following conjecture is posed and studied: if $G$ is a subcubic graph, then $\\chi_{\\rho}(S(G))\\le 5$, where $S(G)$ is the subdivision of $G$. The conjecture is proved for all generalized prisms of cycles. To get this result it is proved that if $G$ is a generalized prism of a cycle, then $G$ is $(1,1,2,2)$-colorable if and only if $G$ is not the Petersen graph. The validity o","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":"2016-08-19T11:23:13Z","title":"Packing chromatic number, $(1,1,2,2)$-colorings, and characterizing the Petersen graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.05573","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:b59a6f057c2abbffb528f99cddf654220a15617644482a722489b54ce0875d8f","target":"record","created_at":"2026-05-18T01:08:28Z","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":"75787fc0633139c5f00c3e51f57a6263c020e032daca342a9507919aad950029","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-08-19T11:23:13Z","title_canon_sha256":"5bae71e4a58769aa7793dc1bdf52131e439c5fe1d98756947394bd0d8b00fe35"},"schema_version":"1.0","source":{"id":"1608.05573","kind":"arxiv","version":1}},"canonical_sha256":"87bee020a500137a244e98af5ca44a121c12371faf4c6814588588a7a099d754","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"87bee020a500137a244e98af5ca44a121c12371faf4c6814588588a7a099d754","first_computed_at":"2026-05-18T01:08:28.148780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:28.148780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4UntKTjjJumlTskVtDkc5j/FmVlHAZ01A4dGaK4KC5Prvr6xGfJ+s4gsoXvh+bHQ2irrdiQuwaiUTaroICc4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:28.149345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.05573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b59a6f057c2abbffb528f99cddf654220a15617644482a722489b54ce0875d8f","sha256:62f8463fbc6a32bc13a370335602618a273d1e558146cf082c1245cf72d69921"],"state_sha256":"4a0bcdcc4f508f5440f7a8534de07a035c50efa7eb1657dca924c498bbab89fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1LSWla+IIt00W0Wda60CSqpgKWWdsOlLIIzZLa5VJKSajTI5YHd+ItSDuwP5rrs6L9NtzMNX9WYGXZ+mtR7AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T19:16:33.439859Z","bundle_sha256":"b89074c9b448fc6473f02a52805b909478e85ffc25cd52c3eac5b1a9fcc7a29f"}}