{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:57QOU36TGGFVMJRSSGXHUEPGBH","short_pith_number":"pith:57QOU36T","canonical_record":{"source":{"id":"0806.3437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-06-20T18:46:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"86bb5f41ea83799889bb3d7076417ae355a83ec508d0b30c07f3c2e6cdadfe8e","abstract_canon_sha256":"5cdb9020bee6e0346df2cfd434d1d3bfb8a9373747616955452279f4c8e1cf64"},"schema_version":"1.0"},"canonical_sha256":"efe0ea6fd3318b56263291ae7a11e609c78f507e3d4d9626f990f0998aa2f3d5","source":{"kind":"arxiv","id":"0806.3437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.3437","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"0806.3437v1","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3437","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"57QOU36TGGFV","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"pith_short_16","alias_value":"57QOU36TGGFVMJRS","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"pith_short_8","alias_value":"57QOU36T","created_at":"2026-07-04T15:12:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:57QOU36TGGFVMJRSSGXHUEPGBH","target":"record","payload":{"canonical_record":{"source":{"id":"0806.3437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-06-20T18:46:50Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"86bb5f41ea83799889bb3d7076417ae355a83ec508d0b30c07f3c2e6cdadfe8e","abstract_canon_sha256":"5cdb9020bee6e0346df2cfd434d1d3bfb8a9373747616955452279f4c8e1cf64"},"schema_version":"1.0"},"canonical_sha256":"efe0ea6fd3318b56263291ae7a11e609c78f507e3d4d9626f990f0998aa2f3d5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:12:21.712223Z","signature_b64":"B4iUNcNCBI5OR6PQ42MICmjHHW1AWa5XeVYvCwwR99Nie8iaazywDiedBbmUyghOvD0UHAG3uEer5lT56lwzAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efe0ea6fd3318b56263291ae7a11e609c78f507e3d4d9626f990f0998aa2f3d5","last_reissued_at":"2026-07-04T15:12:21.711778Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:12:21.711778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0806.3437","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-04T15:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InhmL8pjfdTpAnrBiy24nlrZRRYFi6VKyRc9/ZzyPu4RjRcev6QjghDHnNUdo2RgB8PJUy58xgqW5nib4mBdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:16:16.131586Z"},"content_sha256":"029c0d0f9515846aed5f949c1f515dbf6d5a33ebd9c32315a022c33130984e4b","schema_version":"1.0","event_id":"sha256:029c0d0f9515846aed5f949c1f515dbf6d5a33ebd9c32315a022c33130984e4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:57QOU36TGGFVMJRSSGXHUEPGBH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Alexander Russell, Hang Dinh","submitted_at":"2008-06-20T18:46:50Z","abstract_excerpt":"We study the problem of \\emph{local search} on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a vertex v for which f(v) is no more than f evaluated at any of v's neighbors. In 1983, Aldous gave the first strong lower bounds for the problem, showing that any randomized algorithm requires $\\Omega(2^{n/2 - o(1)})$ queries to determine a local minima on the n-dimensional hypercube. The next major step forward was not until 2004 when Aaronson, introducing a new method for query complexity bounds, both strengthened "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3437","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/0806.3437/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-04T15:12:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kiw+Y4oLijAe6Sq3gHTzlMzYuExxrTiskYLXDwqlPYFNN29yyTgLTW+waXAk5D8N/ApiP7qID0y8cuO1cs58Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T17:16:16.132080Z"},"content_sha256":"fd84f63fadd34f299a9bfe31f16aafc87d740b08bee70da9d36062ff6553f6ad","schema_version":"1.0","event_id":"sha256:fd84f63fadd34f299a9bfe31f16aafc87d740b08bee70da9d36062ff6553f6ad"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57QOU36TGGFVMJRSSGXHUEPGBH/bundle.json","state_url":"https://pith.science/pith/57QOU36TGGFVMJRSSGXHUEPGBH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57QOU36TGGFVMJRSSGXHUEPGBH/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-05T17:16:16Z","links":{"resolver":"https://pith.science/pith/57QOU36TGGFVMJRSSGXHUEPGBH","bundle":"https://pith.science/pith/57QOU36TGGFVMJRSSGXHUEPGBH/bundle.json","state":"https://pith.science/pith/57QOU36TGGFVMJRSSGXHUEPGBH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57QOU36TGGFVMJRSSGXHUEPGBH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:57QOU36TGGFVMJRSSGXHUEPGBH","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":"5cdb9020bee6e0346df2cfd434d1d3bfb8a9373747616955452279f4c8e1cf64","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-06-20T18:46:50Z","title_canon_sha256":"86bb5f41ea83799889bb3d7076417ae355a83ec508d0b30c07f3c2e6cdadfe8e"},"schema_version":"1.0","source":{"id":"0806.3437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0806.3437","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"arxiv_version","alias_value":"0806.3437v1","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0806.3437","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"pith_short_12","alias_value":"57QOU36TGGFV","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"pith_short_16","alias_value":"57QOU36TGGFVMJRS","created_at":"2026-07-04T15:12:21Z"},{"alias_kind":"pith_short_8","alias_value":"57QOU36T","created_at":"2026-07-04T15:12:21Z"}],"graph_snapshots":[{"event_id":"sha256:fd84f63fadd34f299a9bfe31f16aafc87d740b08bee70da9d36062ff6553f6ad","target":"graph","created_at":"2026-07-04T15:12:21Z","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/0806.3437/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of \\emph{local search} on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a vertex v for which f(v) is no more than f evaluated at any of v's neighbors. In 1983, Aldous gave the first strong lower bounds for the problem, showing that any randomized algorithm requires $\\Omega(2^{n/2 - o(1)})$ queries to determine a local minima on the n-dimensional hypercube. The next major step forward was not until 2004 when Aaronson, introducing a new method for query complexity bounds, both strengthened ","authors_text":"Alexander Russell, Hang Dinh","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-06-20T18:46:50Z","title":"Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0806.3437","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:029c0d0f9515846aed5f949c1f515dbf6d5a33ebd9c32315a022c33130984e4b","target":"record","created_at":"2026-07-04T15:12:21Z","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":"5cdb9020bee6e0346df2cfd434d1d3bfb8a9373747616955452279f4c8e1cf64","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-06-20T18:46:50Z","title_canon_sha256":"86bb5f41ea83799889bb3d7076417ae355a83ec508d0b30c07f3c2e6cdadfe8e"},"schema_version":"1.0","source":{"id":"0806.3437","kind":"arxiv","version":1}},"canonical_sha256":"efe0ea6fd3318b56263291ae7a11e609c78f507e3d4d9626f990f0998aa2f3d5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efe0ea6fd3318b56263291ae7a11e609c78f507e3d4d9626f990f0998aa2f3d5","first_computed_at":"2026-07-04T15:12:21.711778Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:12:21.711778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4iUNcNCBI5OR6PQ42MICmjHHW1AWa5XeVYvCwwR99Nie8iaazywDiedBbmUyghOvD0UHAG3uEer5lT56lwzAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:12:21.712223Z","signed_message":"canonical_sha256_bytes"},"source_id":"0806.3437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:029c0d0f9515846aed5f949c1f515dbf6d5a33ebd9c32315a022c33130984e4b","sha256:fd84f63fadd34f299a9bfe31f16aafc87d740b08bee70da9d36062ff6553f6ad"],"state_sha256":"276f8fb2d6902622fcf26637cbe67bf8312530de878c8f1dad88c04b03343482"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyH4GGkRxCAZWdCA2QYbbwTAxKFfWHAYvC8VO2zl+jCuxYJDzT1JmyhOfQWe89WEG10sJk+piTryoxzRmv1SBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T17:16:16.136795Z","bundle_sha256":"5d33be4c0a76fb4976b00f29b7aa9fcfe9facbbc8de70c5fb9b1630c7899900a"}}