{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PMFBKY5ANWJZTAJ2ZC4CEE42O2","short_pith_number":"pith:PMFBKY5A","canonical_record":{"source":{"id":"1711.03856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-10T15:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"0f5449163085da30c97dbe9d0742fe354340045e71e5d7ce4db733bc477e1a36","abstract_canon_sha256":"37950a58e6adcf0d6dcfdb34688b44fc99c5492548e5d6f875bf884ac719e933"},"schema_version":"1.0"},"canonical_sha256":"7b0a1563a06d9399813ac8b822139a7685eab43415b3e8ad8e262e31e9ed5b13","source":{"kind":"arxiv","id":"1711.03856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03856","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03856v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03856","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"PMFBKY5ANWJZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PMFBKY5ANWJZTAJ2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PMFBKY5A","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PMFBKY5ANWJZTAJ2ZC4CEE42O2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.03856","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-10T15:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"0f5449163085da30c97dbe9d0742fe354340045e71e5d7ce4db733bc477e1a36","abstract_canon_sha256":"37950a58e6adcf0d6dcfdb34688b44fc99c5492548e5d6f875bf884ac719e933"},"schema_version":"1.0"},"canonical_sha256":"7b0a1563a06d9399813ac8b822139a7685eab43415b3e8ad8e262e31e9ed5b13","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:51.264305Z","signature_b64":"UUGEnzf8ZSb7AhQM9QUc8Vpyu8PPgODRa8t6xzCfCGArzOvRUVsiF5iaBZ5V++JJP9ikbRn5MOMdu1wzfzYPAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b0a1563a06d9399813ac8b822139a7685eab43415b3e8ad8e262e31e9ed5b13","last_reissued_at":"2026-05-18T00:30:51.263646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:51.263646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.03856","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:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"//qtbcMh+cfLXBCKKMDYaMoGpRhkgNI0jj+DVUSpR9gHG+nktkUTusC4FBt88AKRQGMm0aNBTtaxAByu/vzCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:47:53.503169Z"},"content_sha256":"5eaca2896637abc2d08d3ed295318ce06a85a53a7e521baee7f859f7147a276d","schema_version":"1.0","event_id":"sha256:5eaca2896637abc2d08d3ed295318ce06a85a53a7e521baee7f859f7147a276d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PMFBKY5ANWJZTAJ2ZC4CEE42O2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing coloring of Sierpi\\'{n}ski-type graphs","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":"2017-11-10T15:08: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 $V_i$, $i\\in \\{1,\\ldots,k\\}$, where each $V_i$ is an $i$-packing. In this paper, we consider the packing chromatic number of several families of Sierpi\\'{n}ski-type graphs. While it is known that this number is bounded from above by $8$ in the family of Sierpi\\'{n}ski graphs with base $3$, we prove that it is unbounded in the families of Sierpi\\'{n}ski graphs with bases greater than $3$. On the other hand, we prove that the packing chromatic numb"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03856","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:30:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mzu410lDOXM7S/6GVAXi5OwKxbqTlvr0o1FuFm+5+BcRaWh8Uekm1b9EIDma4aDMomRUUncG/tcdA5ae/d5ICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:47:53.503833Z"},"content_sha256":"0f1fc650d9936c8bd4504ea8bb4bbd0268f3c8634bb89e7c607017337a592ce0","schema_version":"1.0","event_id":"sha256:0f1fc650d9936c8bd4504ea8bb4bbd0268f3c8634bb89e7c607017337a592ce0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PMFBKY5ANWJZTAJ2ZC4CEE42O2/bundle.json","state_url":"https://pith.science/pith/PMFBKY5ANWJZTAJ2ZC4CEE42O2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PMFBKY5ANWJZTAJ2ZC4CEE42O2/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-30T00:47:53Z","links":{"resolver":"https://pith.science/pith/PMFBKY5ANWJZTAJ2ZC4CEE42O2","bundle":"https://pith.science/pith/PMFBKY5ANWJZTAJ2ZC4CEE42O2/bundle.json","state":"https://pith.science/pith/PMFBKY5ANWJZTAJ2ZC4CEE42O2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PMFBKY5ANWJZTAJ2ZC4CEE42O2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PMFBKY5ANWJZTAJ2ZC4CEE42O2","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":"37950a58e6adcf0d6dcfdb34688b44fc99c5492548e5d6f875bf884ac719e933","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-10T15:08:13Z","title_canon_sha256":"0f5449163085da30c97dbe9d0742fe354340045e71e5d7ce4db733bc477e1a36"},"schema_version":"1.0","source":{"id":"1711.03856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.03856","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"arxiv_version","alias_value":"1711.03856v1","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.03856","created_at":"2026-05-18T00:30:51Z"},{"alias_kind":"pith_short_12","alias_value":"PMFBKY5ANWJZ","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PMFBKY5ANWJZTAJ2","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PMFBKY5A","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:0f1fc650d9936c8bd4504ea8bb4bbd0268f3c8634bb89e7c607017337a592ce0","target":"graph","created_at":"2026-05-18T00:30:51Z","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 \\{1,\\ldots,k\\}$, where each $V_i$ is an $i$-packing. In this paper, we consider the packing chromatic number of several families of Sierpi\\'{n}ski-type graphs. While it is known that this number is bounded from above by $8$ in the family of Sierpi\\'{n}ski graphs with base $3$, we prove that it is unbounded in the families of Sierpi\\'{n}ski graphs with bases greater than $3$. On the other hand, we prove that the packing chromatic numb","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":"2017-11-10T15:08:13Z","title":"Packing coloring of Sierpi\\'{n}ski-type graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.03856","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:5eaca2896637abc2d08d3ed295318ce06a85a53a7e521baee7f859f7147a276d","target":"record","created_at":"2026-05-18T00:30:51Z","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":"37950a58e6adcf0d6dcfdb34688b44fc99c5492548e5d6f875bf884ac719e933","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-10T15:08:13Z","title_canon_sha256":"0f5449163085da30c97dbe9d0742fe354340045e71e5d7ce4db733bc477e1a36"},"schema_version":"1.0","source":{"id":"1711.03856","kind":"arxiv","version":1}},"canonical_sha256":"7b0a1563a06d9399813ac8b822139a7685eab43415b3e8ad8e262e31e9ed5b13","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b0a1563a06d9399813ac8b822139a7685eab43415b3e8ad8e262e31e9ed5b13","first_computed_at":"2026-05-18T00:30:51.263646Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:51.263646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UUGEnzf8ZSb7AhQM9QUc8Vpyu8PPgODRa8t6xzCfCGArzOvRUVsiF5iaBZ5V++JJP9ikbRn5MOMdu1wzfzYPAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:51.264305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.03856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5eaca2896637abc2d08d3ed295318ce06a85a53a7e521baee7f859f7147a276d","sha256:0f1fc650d9936c8bd4504ea8bb4bbd0268f3c8634bb89e7c607017337a592ce0"],"state_sha256":"f008bddf7c996f3ce4588d7198b6180ffa236c87ab3997a7f45349f845a9fa5b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MmrCIPpndRTLS0zJnemdAMfN4GFP8VKowlBn/t1+MNGg5TbpxQ8UJtEgY064j9zYnVd/cuUDCop5b/+OZ76+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:47:53.508024Z","bundle_sha256":"abfb222cd9cee23e31735e64a28cbe471aa194dad3f48d725944b27411b11431"}}