{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2002:GGJSFQFDTSQI4ROEQ2TSLWKJUK","short_pith_number":"pith:GGJSFQFD","canonical_record":{"source":{"id":"quant-ph/0212048","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-12-09T05:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"250bed97caadaa26efecbe1a57ba3782a3b1e8589180ed59c931c10fde7986f8","abstract_canon_sha256":"5b3b7d41cff1ee1275b4261397520f6ee4d09a1d40d04012c5ad436d73a7baa0"},"schema_version":"1.0"},"canonical_sha256":"319322c0a39ca08e45c486a725d949a2b10a13d8d8dea4a8e79804b0c18104f0","source":{"kind":"arxiv","id":"quant-ph/0212048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0212048","created_at":"2026-05-18T01:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0212048v1","created_at":"2026-05-18T01:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0212048","created_at":"2026-05-18T01:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"GGJSFQFDTSQI","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GGJSFQFDTSQI4ROE","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GGJSFQFD","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2002:GGJSFQFDTSQI4ROEQ2TSLWKJUK","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0212048","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-12-09T05:05:58Z","cross_cats_sorted":[],"title_canon_sha256":"250bed97caadaa26efecbe1a57ba3782a3b1e8589180ed59c931c10fde7986f8","abstract_canon_sha256":"5b3b7d41cff1ee1275b4261397520f6ee4d09a1d40d04012c5ad436d73a7baa0"},"schema_version":"1.0"},"canonical_sha256":"319322c0a39ca08e45c486a725d949a2b10a13d8d8dea4a8e79804b0c18104f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:04.216032Z","signature_b64":"a3E3nKEi4aPFXo97geVfYDrCp1+YxY3sEn7V+TW3VaTjoqockaVb17RpPBTQthKJTFtBVVNdMlMfjsbMC0HgDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"319322c0a39ca08e45c486a725d949a2b10a13d8d8dea4a8e79804b0c18104f0","last_reissued_at":"2026-05-18T01:05:04.215351Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:04.215351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0212048","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-05-18T01:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ey7D5czb0RGbWK56Iuc1AYdu28WPBAebYESxvabPm/Yu1Ovd7KAKQaCWE+TyJDBm6ZBoK/X1+7y2UUP/HsZOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:00:40.822088Z"},"content_sha256":"95132213180f85091ed8d6bbb9f4520b41cc7c2a2fa0d2da8dcc65f4894f2936","schema_version":"1.0","event_id":"sha256:95132213180f85091ed8d6bbb9f4520b41cc7c2a2fa0d2da8dcc65f4894f2936"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2002:GGJSFQFDTSQI4ROEQ2TSLWKJUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Rainer Schuler, V. Arvind","submitted_at":"2002-12-09T05:05:58Z","abstract_excerpt":"We first give an $\\O(2^{n/3})$ quantum algorithm for the 0-1 Knapsack problem with $n$ variables. More generally, for 0-1 Integer Linear Programs with $n$ variables and $d$ inequalities we give an $\\O(2^{n/3}n^d)$ quantum algorithm. For $d =o(n/\\log n)$ this running time is bounded by $\\O(2^{n(1/3+\\epsilon)})$ for every $\\epsilon>0$ and in particular it is better than the $\\O(2^{n/2})$ upper bound for general quantum search. To investigate whether better algorithms for these NP-hard problems are possible, we formulate a \\emph{symmetric} claw problem corresponding to 0-1 Knapsack and study its "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0212048","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":""},"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-18T01:05:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ewLy7RkgEiP86nKXhve5cGkPbWUfqranuyuHZylLoSfCEdH9CIG2NZTnVg3CV7UvvAiIEo3/AVjCr5N/cvRKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:00:40.822834Z"},"content_sha256":"447ff180d6298afea19ec44e495be9b6902c8b4cb60def1dae2d5ab58c824c27","schema_version":"1.0","event_id":"sha256:447ff180d6298afea19ec44e495be9b6902c8b4cb60def1dae2d5ab58c824c27"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/bundle.json","state_url":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/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-09T08:00:40Z","links":{"resolver":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK","bundle":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/bundle.json","state":"https://pith.science/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GGJSFQFDTSQI4ROEQ2TSLWKJUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2002:GGJSFQFDTSQI4ROEQ2TSLWKJUK","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":"5b3b7d41cff1ee1275b4261397520f6ee4d09a1d40d04012c5ad436d73a7baa0","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2002-12-09T05:05:58Z","title_canon_sha256":"250bed97caadaa26efecbe1a57ba3782a3b1e8589180ed59c931c10fde7986f8"},"schema_version":"1.0","source":{"id":"quant-ph/0212048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0212048","created_at":"2026-05-18T01:05:04Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0212048v1","created_at":"2026-05-18T01:05:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0212048","created_at":"2026-05-18T01:05:04Z"},{"alias_kind":"pith_short_12","alias_value":"GGJSFQFDTSQI","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GGJSFQFDTSQI4ROE","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GGJSFQFD","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:447ff180d6298afea19ec44e495be9b6902c8b4cb60def1dae2d5ab58c824c27","target":"graph","created_at":"2026-05-18T01:05:04Z","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":"We first give an $\\O(2^{n/3})$ quantum algorithm for the 0-1 Knapsack problem with $n$ variables. More generally, for 0-1 Integer Linear Programs with $n$ variables and $d$ inequalities we give an $\\O(2^{n/3}n^d)$ quantum algorithm. For $d =o(n/\\log n)$ this running time is bounded by $\\O(2^{n(1/3+\\epsilon)})$ for every $\\epsilon>0$ and in particular it is better than the $\\O(2^{n/2})$ upper bound for general quantum search. To investigate whether better algorithms for these NP-hard problems are possible, we formulate a \\emph{symmetric} claw problem corresponding to 0-1 Knapsack and study its ","authors_text":"Rainer Schuler, V. Arvind","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2002-12-09T05:05:58Z","title":"The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0212048","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:95132213180f85091ed8d6bbb9f4520b41cc7c2a2fa0d2da8dcc65f4894f2936","target":"record","created_at":"2026-05-18T01:05:04Z","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":"5b3b7d41cff1ee1275b4261397520f6ee4d09a1d40d04012c5ad436d73a7baa0","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2002-12-09T05:05:58Z","title_canon_sha256":"250bed97caadaa26efecbe1a57ba3782a3b1e8589180ed59c931c10fde7986f8"},"schema_version":"1.0","source":{"id":"quant-ph/0212048","kind":"arxiv","version":1}},"canonical_sha256":"319322c0a39ca08e45c486a725d949a2b10a13d8d8dea4a8e79804b0c18104f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"319322c0a39ca08e45c486a725d949a2b10a13d8d8dea4a8e79804b0c18104f0","first_computed_at":"2026-05-18T01:05:04.215351Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:04.215351Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a3E3nKEi4aPFXo97geVfYDrCp1+YxY3sEn7V+TW3VaTjoqockaVb17RpPBTQthKJTFtBVVNdMlMfjsbMC0HgDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:04.216032Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0212048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95132213180f85091ed8d6bbb9f4520b41cc7c2a2fa0d2da8dcc65f4894f2936","sha256:447ff180d6298afea19ec44e495be9b6902c8b4cb60def1dae2d5ab58c824c27"],"state_sha256":"b84b02914fec0d456133dca9ee3285f7d2b17aa5d842022ff3fe578874df1799"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q5cTJl7ZY728l6RWv/Nh3jSjekMimBady6VtVzumo+fFX0KNY5MDDMqEwqsSZF5SdRnGjIt+IWq0fvVkA9ZDCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:00:40.827278Z","bundle_sha256":"3f2975f3d9fc9614b67a5ae3f138e15f5cc784766728d8bbbaeff28379f6d62f"}}