{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:XPLCWD3FTJC4BRZST52MJ3CVBM","short_pith_number":"pith:XPLCWD3F","schema_version":"1.0","canonical_sha256":"bbd62b0f659a45c0c7329f74c4ec550b023f70a7f4332eef88bea2d01a48276c","source":{"kind":"arxiv","id":"1312.5280","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.5280","created_at":"2026-05-18T02:28:23.224563+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5280v3","created_at":"2026-05-18T02:28:23.224563+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5280","created_at":"2026-05-18T02:28:23.224563+00:00"},{"alias_kind":"pith_short_12","alias_value":"XPLCWD3FTJC4","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_16","alias_value":"XPLCWD3FTJC4BRZS","created_at":"2026-05-18T12:28:06.772260+00:00"},{"alias_kind":"pith_short_8","alias_value":"XPLCWD3F","created_at":"2026-05-18T12:28:06.772260+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM","json":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM.json","graph_json":"https://pith.science/api/pith-number/XPLCWD3FTJC4BRZST52MJ3CVBM/graph.json","events_json":"https://pith.science/api/pith-number/XPLCWD3FTJC4BRZST52MJ3CVBM/events.json","paper":"https://pith.science/paper/XPLCWD3F"},"agent_actions":{"view_html":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM","download_json":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM.json","view_paper":"https://pith.science/paper/XPLCWD3F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5280&json=true","fetch_graph":"https://pith.science/api/pith-number/XPLCWD3FTJC4BRZST52MJ3CVBM/graph.json","fetch_events":"https://pith.science/api/pith-number/XPLCWD3FTJC4BRZST52MJ3CVBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/action/storage_attestation","attest_author":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/action/author_attestation","sign_citation":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/action/citation_signature","submit_replication":"https://pith.science/pith/XPLCWD3FTJC4BRZST52MJ3CVBM/action/replication_record"}},"created_at":"2026-05-18T02:28:23.224563+00:00","updated_at":"2026-05-18T02:28:23.224563+00:00"}