{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:DMNRHK5QEBML6NNTXGZC4E5NS4","short_pith_number":"pith:DMNRHK5Q","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"},"canonical_sha256":"1b1b13abb02058bf35b3b9b22e13ad9712357c9cdb2efd77a30a9756d94e7692","source":{"kind":"arxiv","id":"2311.08042","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:DMNRHK5QEBML6NNTXGZC4E5NS4","target":"record","payload":{"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"},"canonical_sha256":"1b1b13abb02058bf35b3b9b22e13ad9712357c9cdb2efd77a30a9756d94e7692","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"},"source_kind":"arxiv","source_id":"2311.08042","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-07-05T07:12:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YcxD69O30XSYHPLQL6TpxB5qZGep3Ba241/pPX784qS/k9yA1PHNghe30tYDJt0PsHpcHnli9oXv3fJzdOVEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:22:55.594650Z"},"content_sha256":"cea45606d89176b8baf7efe6973c323afc77e9c0ff5695c7e604e4bbd889a4af","schema_version":"1.0","event_id":"sha256:cea45606d89176b8baf7efe6973c323afc77e9c0ff5695c7e604e4bbd889a4af"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:DMNRHK5QEBML6NNTXGZC4E5NS4","target":"graph","payload":{"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"},"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-07-05T07:12:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vV4VAlVSVsIX5ppzIGLrhCW5+dRfirSDekvdprL9cHImwGKvg5aAy8OKsoaGgK1X4PHC0aNpTqIZ5QGSd89sCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:22:55.595157Z"},"content_sha256":"0f909092a9b683803b2387a9e165217c0778aa8184d377e0fb591d4d6d2ce0f6","schema_version":"1.0","event_id":"sha256:0f909092a9b683803b2387a9e165217c0778aa8184d377e0fb591d4d6d2ce0f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/bundle.json","state_url":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/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-08-16T13:22:55Z","links":{"resolver":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4","bundle":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/bundle.json","state":"https://pith.science/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMNRHK5QEBML6NNTXGZC4E5NS4/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"scP/5Tz4Hvbjrqd973Tsg/CsZQV1lgbKplHuIyvYf53XqlJCteN55VrGxARFgAMn+2qjiFe15/PhVt6HvYGrAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:22:55.600518Z","bundle_sha256":"fef6f7b665207e2ad23823606b0e8011d1ddd73c031445549fcc077f9f6461d4"}}