{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:DMNRHK5QEBML6NNTXGZC4E5NS4","short_pith_number":"pith:DMNRHK5Q","schema_version":"1.0","canonical_sha256":"1b1b13abb02058bf35b3b9b22e13ad9712357c9cdb2efd77a30a9756d94e7692","source":{"kind":"arxiv","id":"2311.08042","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Jerry Zirui Li, Serge Gaspers","submitted_at":"2023-11-14T10:07:14Z","abstract_excerpt":"Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets from F, covering U with k sets from F, and packing k non-intersecting sets from F into U. Classically, these problems can be solved via inclusion-exclusion in O*(2^n) time [BjorklundHK09]. Quantumly, there are faster algorithms for graph coloring with running time O(1.9140^n) [ShimizuM22] and for Set Cover with a small number of sets with running time O(1.7274^n |F|^O(1)) [AmbainisBIKPV19]. In this paper, we give a qu"},"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":"2311.08042","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T10:07:14Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"2988fbd467b2388c94db6582df8bef0f80f49d8fcb6c5e5e595ea0982c7e2a3a","abstract_canon_sha256":"e44c7b09a4702fe77ae3ffefadcb8e8ff0ab0a35d259798327c50a035b7bce0b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:39.324546Z","signature_b64":"/6wp/CCm1D7qfBgoBUxvhwDoqRFeWwnWKwDX4mJ2MUE1ZLduYYC9bDid1SyLg4xeitSFXqSaA3RHFiRR1ytjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b1b13abb02058bf35b3b9b22e13ad9712357c9cdb2efd77a30a9756d94e7692","last_reissued_at":"2026-07-05T07:12:39.324126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:39.324126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.DS","authors_text":"Jerry Zirui Li, Serge Gaspers","submitted_at":"2023-11-14T10:07:14Z","abstract_excerpt":"Let U be a universe on n elements, let k be a positive integer, and let F be a family of (implicitly defined) subsets of U. We consider the problems of partitioning U into k sets from F, covering U with k sets from F, and packing k non-intersecting sets from F into U. Classically, these problems can be solved via inclusion-exclusion in O*(2^n) time [BjorklundHK09]. Quantumly, there are faster algorithms for graph coloring with running time O(1.9140^n) [ShimizuM22] and for Set Cover with a small number of sets with running time O(1.7274^n |F|^O(1)) [AmbainisBIKPV19]. In this paper, we give a qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08042","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.08042/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2311.08042","created_at":"2026-07-05T07:12:39.324183+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.08042v1","created_at":"2026-07-05T07:12:39.324183+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08042","created_at":"2026-07-05T07:12:39.324183+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMNRHK5QEBML","created_at":"2026-07-05T07:12:39.324183+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMNRHK5QEBML6NNT","created_at":"2026-07-05T07:12:39.324183+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMNRHK5Q","created_at":"2026-07-05T07:12:39.324183+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.21380","citing_title":"Modeling and Resource Optimization for Quantum Oracles","ref_index":18,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4","json":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4.json","graph_json":"https://pith.science/api/pith-number/DMNRHK5QEBML6NNTXGZC4E5NS4/graph.json","events_json":"https://pith.science/api/pith-number/DMNRHK5QEBML6NNTXGZC4E5NS4/events.json","paper":"https://pith.science/paper/DMNRHK5Q"},"agent_actions":{"view_html":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4","download_json":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4.json","view_paper":"https://pith.science/paper/DMNRHK5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.08042&json=true","fetch_graph":"https://pith.science/api/pith-number/DMNRHK5QEBML6NNTXGZC4E5NS4/graph.json","fetch_events":"https://pith.science/api/pith-number/DMNRHK5QEBML6NNTXGZC4E5NS4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/action/storage_attestation","attest_author":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/action/author_attestation","sign_citation":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/action/citation_signature","submit_replication":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/action/replication_record"}},"created_at":"2026-07-05T07:12:39.324183+00:00","updated_at":"2026-07-05T07:12:39.324183+00:00"}