{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:AJHYXDEFGGXWUY2GXLFGNCBCO3","short_pith_number":"pith:AJHYXDEF","canonical_record":{"source":{"id":"quant-ph/0508205","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-27T06:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"054779f7522f9e408529861f8b65abe7c4d3ac9f4af6d7cdd0785a8388003eca","abstract_canon_sha256":"5ae068c282e699ec98c416eb2619cbdcc230d673153d55b5288b6e5aa95354d6"},"schema_version":"1.0"},"canonical_sha256":"024f8b8c8531af6a6346baca66882276dde1ebc6d9a55ec1850c3c72ca7bc885","source":{"kind":"arxiv","id":"quant-ph/0508205","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508205","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508205v2","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508205","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"pith_short_12","alias_value":"AJHYXDEFGGXW","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"pith_short_16","alias_value":"AJHYXDEFGGXWUY2G","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"pith_short_8","alias_value":"AJHYXDEF","created_at":"2026-07-04T14:47:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:AJHYXDEFGGXWUY2GXLFGNCBCO3","target":"record","payload":{"canonical_record":{"source":{"id":"quant-ph/0508205","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-27T06:06:38Z","cross_cats_sorted":[],"title_canon_sha256":"054779f7522f9e408529861f8b65abe7c4d3ac9f4af6d7cdd0785a8388003eca","abstract_canon_sha256":"5ae068c282e699ec98c416eb2619cbdcc230d673153d55b5288b6e5aa95354d6"},"schema_version":"1.0"},"canonical_sha256":"024f8b8c8531af6a6346baca66882276dde1ebc6d9a55ec1850c3c72ca7bc885","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:47:02.007901Z","signature_b64":"3b0cqd6OGlzrQaNubq2s00kr5u4+KH/p8Jk/NdKncxuF+K6/m+HTKbql/o9h1AasVvxUa2xtkMs7lS5iwsElBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"024f8b8c8531af6a6346baca66882276dde1ebc6d9a55ec1850c3c72ca7bc885","last_reissued_at":"2026-07-04T14:47:02.007548Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:47:02.007548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"quant-ph/0508205","source_version":2,"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-04T14:47:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GETxgT2ws9IGyUUJyHlquOgWGXflKjbUwCrghJxNYDjO+Zpow34Wdnchz+KMq3PBvMEU5/ftDbW/nunVRF1mAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:41:31.705690Z"},"content_sha256":"e8525a036d274abbd6afcdf315a597757fd32865d7c106045eceaacc9b690fc0","schema_version":"1.0","event_id":"sha256:e8525a036d274abbd6afcdf315a597757fd32865d7c106045eceaacc9b690fc0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:AJHYXDEFGGXWUY2GXLFGNCBCO3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Matching and Network Flows","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Andris Ambainis (U Waterloo), Robert Spalek (CWI)","submitted_at":"2005-08-27T06:06:38Z","abstract_excerpt":"We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time O(n^2 (sqrt{m/n} + log n) log n), and finding a maximal flow in an integer network in time O(min(n^{7/6} sqrt m * U^{1/3}, sqrt{n U} m) log n), where n is the number of vertices, m is the number of edges, and U <= n^{1/4} is an upper bound on the capacity of an edge."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508205","kind":"arxiv","version":2},"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/quant-ph/0508205/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-04T14:47:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z35VjKjRIuExLQKgpkM/uu9IBDIqR8fyRCL92S1dVCD6lew+nhJRySkWaY9nMN9SgrYXnM/8BT4VnOEG5UtLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-23T08:41:31.706198Z"},"content_sha256":"9748f25311ab7236b9aa52bec5a6c5681b71d0164e76772327052cd4624a57f8","schema_version":"1.0","event_id":"sha256:9748f25311ab7236b9aa52bec5a6c5681b71d0164e76772327052cd4624a57f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AJHYXDEFGGXWUY2GXLFGNCBCO3/bundle.json","state_url":"https://pith.science/pith/AJHYXDEFGGXWUY2GXLFGNCBCO3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AJHYXDEFGGXWUY2GXLFGNCBCO3/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-23T08:41:31Z","links":{"resolver":"https://pith.science/pith/AJHYXDEFGGXWUY2GXLFGNCBCO3","bundle":"https://pith.science/pith/AJHYXDEFGGXWUY2GXLFGNCBCO3/bundle.json","state":"https://pith.science/pith/AJHYXDEFGGXWUY2GXLFGNCBCO3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AJHYXDEFGGXWUY2GXLFGNCBCO3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:AJHYXDEFGGXWUY2GXLFGNCBCO3","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":"5ae068c282e699ec98c416eb2619cbdcc230d673153d55b5288b6e5aa95354d6","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-27T06:06:38Z","title_canon_sha256":"054779f7522f9e408529861f8b65abe7c4d3ac9f4af6d7cdd0785a8388003eca"},"schema_version":"1.0","source":{"id":"quant-ph/0508205","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"quant-ph/0508205","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0508205v2","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0508205","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"pith_short_12","alias_value":"AJHYXDEFGGXW","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"pith_short_16","alias_value":"AJHYXDEFGGXWUY2G","created_at":"2026-07-04T14:47:02Z"},{"alias_kind":"pith_short_8","alias_value":"AJHYXDEF","created_at":"2026-07-04T14:47:02Z"}],"graph_snapshots":[{"event_id":"sha256:9748f25311ab7236b9aa52bec5a6c5681b71d0164e76772327052cd4624a57f8","target":"graph","created_at":"2026-07-04T14:47:02Z","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/quant-ph/0508205/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present quantum algorithms for the following graph problems: finding a maximal bipartite matching in time O(n sqrt{m+n} log n), finding a maximal non-bipartite matching in time O(n^2 (sqrt{m/n} + log n) log n), and finding a maximal flow in an integer network in time O(min(n^{7/6} sqrt m * U^{1/3}, sqrt{n U} m) log n), where n is the number of vertices, m is the number of edges, and U <= n^{1/4} is an upper bound on the capacity of an edge.","authors_text":"Andris Ambainis (U Waterloo), Robert Spalek (CWI)","cross_cats":[],"headline":"","license":"","primary_cat":"quant-ph","submitted_at":"2005-08-27T06:06:38Z","title":"Quantum Algorithms for Matching and Network Flows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0508205","kind":"arxiv","version":2},"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:e8525a036d274abbd6afcdf315a597757fd32865d7c106045eceaacc9b690fc0","target":"record","created_at":"2026-07-04T14:47:02Z","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":"5ae068c282e699ec98c416eb2619cbdcc230d673153d55b5288b6e5aa95354d6","cross_cats_sorted":[],"license":"","primary_cat":"quant-ph","submitted_at":"2005-08-27T06:06:38Z","title_canon_sha256":"054779f7522f9e408529861f8b65abe7c4d3ac9f4af6d7cdd0785a8388003eca"},"schema_version":"1.0","source":{"id":"quant-ph/0508205","kind":"arxiv","version":2}},"canonical_sha256":"024f8b8c8531af6a6346baca66882276dde1ebc6d9a55ec1850c3c72ca7bc885","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"024f8b8c8531af6a6346baca66882276dde1ebc6d9a55ec1850c3c72ca7bc885","first_computed_at":"2026-07-04T14:47:02.007548Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:47:02.007548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3b0cqd6OGlzrQaNubq2s00kr5u4+KH/p8Jk/NdKncxuF+K6/m+HTKbql/o9h1AasVvxUa2xtkMs7lS5iwsElBw==","signature_status":"signed_v1","signed_at":"2026-07-04T14:47:02.007901Z","signed_message":"canonical_sha256_bytes"},"source_id":"quant-ph/0508205","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8525a036d274abbd6afcdf315a597757fd32865d7c106045eceaacc9b690fc0","sha256:9748f25311ab7236b9aa52bec5a6c5681b71d0164e76772327052cd4624a57f8"],"state_sha256":"e6118b7c36e76f9f71869744872467dd44b89371acb4efa849677e685d99210e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vPRwHovgoXjCcnr5Imtds3dBa0ObruIvBqQ8LRyY6uyWTcP5mbx5PsjvQKfB89SKLtXDOhWnBkAUukH6co6JCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-23T08:41:31.711027Z","bundle_sha256":"ddaa9eb279859a76d1eec04057566c4170a0f7902e25c46db49dfc40490d147d"}}