{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2MFK46R3OSM46PRZMJGBKWJ2V4","short_pith_number":"pith:2MFK46R3","canonical_record":{"source":{"id":"1506.07248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-24T06:03:18Z","cross_cats_sorted":[],"title_canon_sha256":"0071a9688a12608ad15b7534d77fdd678eed8b9c432a5dcf878516d9b7c536af","abstract_canon_sha256":"22def2d87abfe3c4467733cab87fcac2114d0f30fc18f258d97d414759d2d16d"},"schema_version":"1.0"},"canonical_sha256":"d30aae7a3b7499cf3e39624c15593aaf3575b81cd89e1a75ab716a86e5aa09f0","source":{"kind":"arxiv","id":"1506.07248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07248","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07248v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07248","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"2MFK46R3OSM4","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2MFK46R3OSM46PRZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2MFK46R3","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2MFK46R3OSM46PRZMJGBKWJ2V4","target":"record","payload":{"canonical_record":{"source":{"id":"1506.07248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-24T06:03:18Z","cross_cats_sorted":[],"title_canon_sha256":"0071a9688a12608ad15b7534d77fdd678eed8b9c432a5dcf878516d9b7c536af","abstract_canon_sha256":"22def2d87abfe3c4467733cab87fcac2114d0f30fc18f258d97d414759d2d16d"},"schema_version":"1.0"},"canonical_sha256":"d30aae7a3b7499cf3e39624c15593aaf3575b81cd89e1a75ab716a86e5aa09f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:39:54.502329Z","signature_b64":"epew8Aooyt+vIe4VN4yxWgU9O/VT3SLDQ9CRoXFyRVuQbwAFDI7X5ITPY55ITVxrwZbwVEnTMjCRp0cdDHK2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d30aae7a3b7499cf3e39624c15593aaf3575b81cd89e1a75ab716a86e5aa09f0","last_reissued_at":"2026-05-18T01:39:54.501841Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:39:54.501841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.07248","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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p9kGC41lfzIol7cY8UZRJbjs+6ojbNvJ22DnFXpta20bgWDFBHtUg5Yoj6Ul1DHjrMb4GSAcUSY2Mz9o0Q0ZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:10:29.401196Z"},"content_sha256":"de684f298c1703d6076c9f7fded850476a1eb1d25ebd6cdb72be3262ff473768","schema_version":"1.0","event_id":"sha256:de684f298c1703d6076c9f7fded850476a1eb1d25ebd6cdb72be3262ff473768"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2MFK46R3OSM46PRZMJGBKWJ2V4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Packing coloring of some undirected and oriented coronae graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Eric Sopena (LaBRI), Isma Bouchemakh (L'IFORCE), La\\\"iche Daouya (L'IFORCE)","submitted_at":"2015-06-24T06:03:18Z","abstract_excerpt":"The packing chromatic number $\\pcn(G)$ of a graph $G$ is the smallest integer $k$ such that its set of vertices $V(G)$ can be partitioned into $k$ disjoint subsets $V\\_1$, \\ldots, $V\\_k$, in such a way that every two distinct vertices in $V\\_i$ are at distance greater than $i$ in $G$ for every $i$, $1\\le i\\le k$.\nFor a given integer $p \\ge 1$, the generalized corona $G\\odot pK\\_1$ of a graph $G$ is the graph obtained from $G$ by adding $p$ degree-one neighbors to every vertex  of $G$.\nIn this paper, we determine the packing chromatic number of generalized coronae of paths and cycles.\nMoreover,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07248","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:39:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kss+jmQarDwNT83owwQuROapv9vJ0pBYrP+OMpWUB2B9pe0/SdB7r9zJVviaHUPtJvaBDwh++4gIanUkxAcJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T21:10:29.401722Z"},"content_sha256":"5259b9c7bd0196cc7bd1fe228c0e64aec2d3417e647af5e5a5cd2a4d397def12","schema_version":"1.0","event_id":"sha256:5259b9c7bd0196cc7bd1fe228c0e64aec2d3417e647af5e5a5cd2a4d397def12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2MFK46R3OSM46PRZMJGBKWJ2V4/bundle.json","state_url":"https://pith.science/pith/2MFK46R3OSM46PRZMJGBKWJ2V4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2MFK46R3OSM46PRZMJGBKWJ2V4/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-05T21:10:29Z","links":{"resolver":"https://pith.science/pith/2MFK46R3OSM46PRZMJGBKWJ2V4","bundle":"https://pith.science/pith/2MFK46R3OSM46PRZMJGBKWJ2V4/bundle.json","state":"https://pith.science/pith/2MFK46R3OSM46PRZMJGBKWJ2V4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2MFK46R3OSM46PRZMJGBKWJ2V4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2MFK46R3OSM46PRZMJGBKWJ2V4","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":"22def2d87abfe3c4467733cab87fcac2114d0f30fc18f258d97d414759d2d16d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-24T06:03:18Z","title_canon_sha256":"0071a9688a12608ad15b7534d77fdd678eed8b9c432a5dcf878516d9b7c536af"},"schema_version":"1.0","source":{"id":"1506.07248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.07248","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.07248v1","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.07248","created_at":"2026-05-18T01:39:54Z"},{"alias_kind":"pith_short_12","alias_value":"2MFK46R3OSM4","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2MFK46R3OSM46PRZ","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2MFK46R3","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:5259b9c7bd0196cc7bd1fe228c0e64aec2d3417e647af5e5a5cd2a4d397def12","target":"graph","created_at":"2026-05-18T01:39: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":"The packing chromatic number $\\pcn(G)$ of a graph $G$ is the smallest integer $k$ such that its set of vertices $V(G)$ can be partitioned into $k$ disjoint subsets $V\\_1$, \\ldots, $V\\_k$, in such a way that every two distinct vertices in $V\\_i$ are at distance greater than $i$ in $G$ for every $i$, $1\\le i\\le k$.\nFor a given integer $p \\ge 1$, the generalized corona $G\\odot pK\\_1$ of a graph $G$ is the graph obtained from $G$ by adding $p$ degree-one neighbors to every vertex  of $G$.\nIn this paper, we determine the packing chromatic number of generalized coronae of paths and cycles.\nMoreover,","authors_text":"Eric Sopena (LaBRI), Isma Bouchemakh (L'IFORCE), La\\\"iche Daouya (L'IFORCE)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-24T06:03:18Z","title":"Packing coloring of some undirected and oriented coronae graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.07248","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:de684f298c1703d6076c9f7fded850476a1eb1d25ebd6cdb72be3262ff473768","target":"record","created_at":"2026-05-18T01:39: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":"22def2d87abfe3c4467733cab87fcac2114d0f30fc18f258d97d414759d2d16d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-06-24T06:03:18Z","title_canon_sha256":"0071a9688a12608ad15b7534d77fdd678eed8b9c432a5dcf878516d9b7c536af"},"schema_version":"1.0","source":{"id":"1506.07248","kind":"arxiv","version":1}},"canonical_sha256":"d30aae7a3b7499cf3e39624c15593aaf3575b81cd89e1a75ab716a86e5aa09f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d30aae7a3b7499cf3e39624c15593aaf3575b81cd89e1a75ab716a86e5aa09f0","first_computed_at":"2026-05-18T01:39:54.501841Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:39:54.501841Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"epew8Aooyt+vIe4VN4yxWgU9O/VT3SLDQ9CRoXFyRVuQbwAFDI7X5ITPY55ITVxrwZbwVEnTMjCRp0cdDHK2AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:39:54.502329Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.07248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de684f298c1703d6076c9f7fded850476a1eb1d25ebd6cdb72be3262ff473768","sha256:5259b9c7bd0196cc7bd1fe228c0e64aec2d3417e647af5e5a5cd2a4d397def12"],"state_sha256":"eab711a51bab4782a7517cf15aa7af74cdd54bd3a6c8c33bafec2f4ce0aad2cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CKTxYbGnqNNTeWnRXv3vWxRLOt/V758Dr6M/w+cOAHLyh+XDNFci4fKCvfY+mPdKGEIkJp9oFYUYxSLJrIIBBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T21:10:29.405113Z","bundle_sha256":"f0f2ad8472de6548b28ca7e3dbe4e7e129709fb881e49cdeef07016661563007"}}