{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:DMNRHK5QEBML6NNTXGZC4E5NS4","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":"e44c7b09a4702fe77ae3ffefadcb8e8ff0ab0a35d259798327c50a035b7bce0b","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T10:07:14Z","title_canon_sha256":"2988fbd467b2388c94db6582df8bef0f80f49d8fcb6c5e5e595ea0982c7e2a3a"},"schema_version":"1.0","source":{"id":"2311.08042","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.08042","created_at":"2026-07-05T07:12:39Z"},{"alias_kind":"arxiv_version","alias_value":"2311.08042v1","created_at":"2026-07-05T07:12:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.08042","created_at":"2026-07-05T07:12:39Z"},{"alias_kind":"pith_short_12","alias_value":"DMNRHK5QEBML","created_at":"2026-07-05T07:12:39Z"},{"alias_kind":"pith_short_16","alias_value":"DMNRHK5QEBML6NNT","created_at":"2026-07-05T07:12:39Z"},{"alias_kind":"pith_short_8","alias_value":"DMNRHK5Q","created_at":"2026-07-05T07:12:39Z"}],"graph_snapshots":[{"event_id":"sha256:0f909092a9b683803b2387a9e165217c0778aa8184d377e0fb591d4d6d2ce0f6","target":"graph","created_at":"2026-07-05T07:12:39Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2311.08042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jerry Zirui Li, Serge Gaspers","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T10:07:14Z","title":"Quantum Algorithms for Graph Coloring and other Partitioning, Covering, and Packing Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.08042","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:cea45606d89176b8baf7efe6973c323afc77e9c0ff5695c7e604e4bbd889a4af","target":"record","created_at":"2026-07-05T07:12:39Z","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":"e44c7b09a4702fe77ae3ffefadcb8e8ff0ab0a35d259798327c50a035b7bce0b","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-11-14T10:07:14Z","title_canon_sha256":"2988fbd467b2388c94db6582df8bef0f80f49d8fcb6c5e5e595ea0982c7e2a3a"},"schema_version":"1.0","source":{"id":"2311.08042","kind":"arxiv","version":1}},"canonical_sha256":"1b1b13abb02058bf35b3b9b22e13ad9712357c9cdb2efd77a30a9756d94e7692","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b1b13abb02058bf35b3b9b22e13ad9712357c9cdb2efd77a30a9756d94e7692","first_computed_at":"2026-07-05T07:12:39.324126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:12:39.324126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/6wp/CCm1D7qfBgoBUxvhwDoqRFeWwnWKwDX4mJ2MUE1ZLduYYC9bDid1SyLg4xeitSFXqSaA3RHFiRR1ytjCA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:12:39.324546Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.08042","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cea45606d89176b8baf7efe6973c323afc77e9c0ff5695c7e604e4bbd889a4af","sha256:0f909092a9b683803b2387a9e165217c0778aa8184d377e0fb591d4d6d2ce0f6"],"state_sha256":"7d6f74b4bf413fa1eff64962aa94362b175360226de1688ad8d1212d6bb7c114"}