{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:XPLCWD3FTJC4BRZST52MJ3CVBM","short_pith_number":"pith:XPLCWD3F","canonical_record":{"source":{"id":"1312.5280","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-18T19:28:43Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"9c8cb60fd33f9627649b99ccdfbc927b87f496f1d1d3e88c91ac7aeee4c91221","abstract_canon_sha256":"a3f6ce09bcc20ac95ec7dd9c273804db0734a58b1efacc1792ca262ea25ff344"},"schema_version":"1.0"},"canonical_sha256":"bbd62b0f659a45c0c7329f74c4ec550b023f70a7f4332eef88bea2d01a48276c","source":{"kind":"arxiv","id":"1312.5280","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5280","created_at":"2026-05-18T02:28:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5280v3","created_at":"2026-05-18T02:28:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5280","created_at":"2026-05-18T02:28:23Z"},{"alias_kind":"pith_short_12","alias_value":"XPLCWD3FTJC4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XPLCWD3FTJC4BRZS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XPLCWD3F","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:XPLCWD3FTJC4BRZST52MJ3CVBM","target":"record","payload":{"canonical_record":{"source":{"id":"1312.5280","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-18T19:28:43Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"9c8cb60fd33f9627649b99ccdfbc927b87f496f1d1d3e88c91ac7aeee4c91221","abstract_canon_sha256":"a3f6ce09bcc20ac95ec7dd9c273804db0734a58b1efacc1792ca262ea25ff344"},"schema_version":"1.0"},"canonical_sha256":"bbd62b0f659a45c0c7329f74c4ec550b023f70a7f4332eef88bea2d01a48276c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:23.225053Z","signature_b64":"4yOM7suH8eN6EBYIoYR6mX3eVrj6dnZwnw3TM8gzjPMDtFY9DEoneFBer4kC7msJ81aPqRXA1EOp8Rpytn2uDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbd62b0f659a45c0c7329f74c4ec550b023f70a7f4332eef88bea2d01a48276c","last_reissued_at":"2026-05-18T02:28:23.224457Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:23.224457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.5280","source_version":3,"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-18T02:28:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YtgPVi16xKam3gONP7V9ogkHGVdcb07yywv1cecAxav/MC/5Ae1aIBOhrr0S9bNiS9tXv5Q6tIbxZ/PyBfWsCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:46:20.059869Z"},"content_sha256":"eac5593bae91235b18ec19bd828d6d7d2f7dea63ac89af84c2041131e8d57d59","schema_version":"1.0","event_id":"sha256:eac5593bae91235b18ec19bd828d6d7d2f7dea63ac89af84c2041131e8d57d59"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:XPLCWD3FTJC4BRZST52MJ3CVBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dichotomies properties on computational complexity of S-packing coloring problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DM","authors_text":"Nicolas Gastineau","submitted_at":"2013-12-18T19:28:43Z","abstract_excerpt":"This work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = (s\\_1 , ..., s\\_k ), G is S-colorable, if its vertices can be partitioned into sets S\\_i , i = 1,... , k, where each S\\_i being a s\\_i -packing (a set of vertices at pairwise distance greater than s\\_i). For a list of three integers, a dichotomy between NP-complete problems and polynomial time solvable problems is determined for subcubic graphs. Moreover, for an unfixed size of list, the complexity of the S-packing colo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5280","kind":"arxiv","version":3},"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-18T02:28:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XkjsnMDZ651Cjoc9wEdnYvaCmnbCpyjrx2IQckOMtz7BkQ3jkcMEktzTJgvxx4G/KKDAktGemH+KVUh8E/9mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T08:46:20.060213Z"},"content_sha256":"5b476a94f580a8eb33b99e3a043f5afdde65f3057ab7a09f0165bb82f0db2ee5","schema_version":"1.0","event_id":"sha256:5b476a94f580a8eb33b99e3a043f5afdde65f3057ab7a09f0165bb82f0db2ee5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/bundle.json","state_url":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/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-02T08:46:20Z","links":{"resolver":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM","bundle":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/bundle.json","state":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:XPLCWD3FTJC4BRZST52MJ3CVBM","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":"a3f6ce09bcc20ac95ec7dd9c273804db0734a58b1efacc1792ca262ea25ff344","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-18T19:28:43Z","title_canon_sha256":"9c8cb60fd33f9627649b99ccdfbc927b87f496f1d1d3e88c91ac7aeee4c91221"},"schema_version":"1.0","source":{"id":"1312.5280","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5280","created_at":"2026-05-18T02:28:23Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5280v3","created_at":"2026-05-18T02:28:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5280","created_at":"2026-05-18T02:28:23Z"},{"alias_kind":"pith_short_12","alias_value":"XPLCWD3FTJC4","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"XPLCWD3FTJC4BRZS","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"XPLCWD3F","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:5b476a94f580a8eb33b99e3a043f5afdde65f3057ab7a09f0165bb82f0db2ee5","target":"graph","created_at":"2026-05-18T02:28:23Z","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":"This work establishes the complexity class of several instances of the S-packing coloring problem: for a graph G, a positive integer k and a non decreasing list of integers S = (s\\_1 , ..., s\\_k ), G is S-colorable, if its vertices can be partitioned into sets S\\_i , i = 1,... , k, where each S\\_i being a s\\_i -packing (a set of vertices at pairwise distance greater than s\\_i). For a list of three integers, a dichotomy between NP-complete problems and polynomial time solvable problems is determined for subcubic graphs. Moreover, for an unfixed size of list, the complexity of the S-packing colo","authors_text":"Nicolas Gastineau","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-18T19:28:43Z","title":"Dichotomies properties on computational complexity of S-packing coloring problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5280","kind":"arxiv","version":3},"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:eac5593bae91235b18ec19bd828d6d7d2f7dea63ac89af84c2041131e8d57d59","target":"record","created_at":"2026-05-18T02:28:23Z","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":"a3f6ce09bcc20ac95ec7dd9c273804db0734a58b1efacc1792ca262ea25ff344","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-12-18T19:28:43Z","title_canon_sha256":"9c8cb60fd33f9627649b99ccdfbc927b87f496f1d1d3e88c91ac7aeee4c91221"},"schema_version":"1.0","source":{"id":"1312.5280","kind":"arxiv","version":3}},"canonical_sha256":"bbd62b0f659a45c0c7329f74c4ec550b023f70a7f4332eef88bea2d01a48276c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbd62b0f659a45c0c7329f74c4ec550b023f70a7f4332eef88bea2d01a48276c","first_computed_at":"2026-05-18T02:28:23.224457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:23.224457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4yOM7suH8eN6EBYIoYR6mX3eVrj6dnZwnw3TM8gzjPMDtFY9DEoneFBer4kC7msJ81aPqRXA1EOp8Rpytn2uDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:23.225053Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5280","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eac5593bae91235b18ec19bd828d6d7d2f7dea63ac89af84c2041131e8d57d59","sha256:5b476a94f580a8eb33b99e3a043f5afdde65f3057ab7a09f0165bb82f0db2ee5"],"state_sha256":"62d792d73e30a776563d0a27de0390616dbbfad822e400dae62a32c089b40ee6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VdUHJcrrKj5+vBrZlEszws3ECHreDnIAHwPJeWTW2JhKCs7EjzKnFPXBmHw5TQRHZ8ES5K+tKN+3Gvv4ikxMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T08:46:20.062189Z","bundle_sha256":"549d84a86dcf8e9e22d86b18d7e52e8a3f704133593cb32b51c059c4daa2f1ac"}}