{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MLREIKHLGBTUQIQGQEQEUFQSAA","short_pith_number":"pith:MLREIKHL","canonical_record":{"source":{"id":"1309.7713","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-30T03:26:52Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"df0937bd6916fb6283dd665a5c65d4948ab7e9a8417c96acdd43f7e90e9e74a1","abstract_canon_sha256":"756706b4406cdb93ca979db40531710569e48a39982cfdf041155a53590628f4"},"schema_version":"1.0"},"canonical_sha256":"62e24428eb306748220681204a1612001cc9e620d744d92d5b49821971cdd8fa","source":{"kind":"arxiv","id":"1309.7713","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7713","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7713v3","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7713","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"MLREIKHLGBTU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MLREIKHLGBTUQIQG","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MLREIKHL","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MLREIKHLGBTUQIQGQEQEUFQSAA","target":"record","payload":{"canonical_record":{"source":{"id":"1309.7713","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-30T03:26:52Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"df0937bd6916fb6283dd665a5c65d4948ab7e9a8417c96acdd43f7e90e9e74a1","abstract_canon_sha256":"756706b4406cdb93ca979db40531710569e48a39982cfdf041155a53590628f4"},"schema_version":"1.0"},"canonical_sha256":"62e24428eb306748220681204a1612001cc9e620d744d92d5b49821971cdd8fa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:06.503274Z","signature_b64":"r4u+5/vZjpFi9y9xT+jJH1h+ZdFWQkgRrwSuABqeRUBJD5mkIZN65MNzx9jIwPQ6AzTuwqJ7Rl2Nbe2rVwVeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62e24428eb306748220681204a1612001cc9e620d744d92d5b49821971cdd8fa","last_reissued_at":"2026-05-18T02:57:06.502769Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:06.502769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.7713","source_version":3,"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-18T02:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLLn6kX2SzplUxWPkRsGbvOLPggl28VlMTeRyMr9iEPJjJNb82r9AS5zGIgeC29QTXEoVWFw2/PRgP03h+BlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:42:11.817621Z"},"content_sha256":"8eee223f263518461fb89bac0c4009d4565d8b7c187e051652d9360e27b9a306","schema_version":"1.0","event_id":"sha256:8eee223f263518461fb89bac0c4009d4565d8b7c187e051652d9360e27b9a306"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MLREIKHLGBTUQIQGQEQEUFQSAA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Span-program-based quantum algorithm for tree detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Guoming Wang","submitted_at":"2013-09-30T03:26:52Z","abstract_excerpt":"Span program is a linear-algebraic model of computation originally proposed for studying the complexity theory. Recently, it has become a useful tool for designing quantum algorithms. In this paper, we present a time-efficient span-program-based quantum algorithm for the following problem. Let $T$ be an arbitrary tree. Given query access to the adjacency matrix of a graph $G$ with $n$ vertices, we need to determine whether $G$ contains $T$ as a subgraph, or $G$ does not contain $T$ as a minor, under the promise that one of these cases holds. We call this problem the subgraph/not-a-minor proble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7713","kind":"arxiv","version":3},"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-18T02:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LgqHkin7Ph9r4K8GR/csIPwLmJbcrhl9ndx6ucRn4qnXrcnFUHeIBO15B0czTFC+D+ijNppGshCCLfyztuYjAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:42:11.817978Z"},"content_sha256":"80a9ebd16b518424ba8cf1916bf50fb85698b5df84ef75b15a63cb549fd7e83f","schema_version":"1.0","event_id":"sha256:80a9ebd16b518424ba8cf1916bf50fb85698b5df84ef75b15a63cb549fd7e83f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MLREIKHLGBTUQIQGQEQEUFQSAA/bundle.json","state_url":"https://pith.science/pith/MLREIKHLGBTUQIQGQEQEUFQSAA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MLREIKHLGBTUQIQGQEQEUFQSAA/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-01T11:42:11Z","links":{"resolver":"https://pith.science/pith/MLREIKHLGBTUQIQGQEQEUFQSAA","bundle":"https://pith.science/pith/MLREIKHLGBTUQIQGQEQEUFQSAA/bundle.json","state":"https://pith.science/pith/MLREIKHLGBTUQIQGQEQEUFQSAA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MLREIKHLGBTUQIQGQEQEUFQSAA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MLREIKHLGBTUQIQGQEQEUFQSAA","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":"756706b4406cdb93ca979db40531710569e48a39982cfdf041155a53590628f4","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-30T03:26:52Z","title_canon_sha256":"df0937bd6916fb6283dd665a5c65d4948ab7e9a8417c96acdd43f7e90e9e74a1"},"schema_version":"1.0","source":{"id":"1309.7713","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7713","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7713v3","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7713","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"MLREIKHLGBTU","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MLREIKHLGBTUQIQG","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MLREIKHL","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:80a9ebd16b518424ba8cf1916bf50fb85698b5df84ef75b15a63cb549fd7e83f","target":"graph","created_at":"2026-05-18T02:57:06Z","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":"Span program is a linear-algebraic model of computation originally proposed for studying the complexity theory. Recently, it has become a useful tool for designing quantum algorithms. In this paper, we present a time-efficient span-program-based quantum algorithm for the following problem. Let $T$ be an arbitrary tree. Given query access to the adjacency matrix of a graph $G$ with $n$ vertices, we need to determine whether $G$ contains $T$ as a subgraph, or $G$ does not contain $T$ as a minor, under the promise that one of these cases holds. We call this problem the subgraph/not-a-minor proble","authors_text":"Guoming Wang","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-30T03:26:52Z","title":"Span-program-based quantum algorithm for tree detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7713","kind":"arxiv","version":3},"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:8eee223f263518461fb89bac0c4009d4565d8b7c187e051652d9360e27b9a306","target":"record","created_at":"2026-05-18T02:57:06Z","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":"756706b4406cdb93ca979db40531710569e48a39982cfdf041155a53590628f4","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-09-30T03:26:52Z","title_canon_sha256":"df0937bd6916fb6283dd665a5c65d4948ab7e9a8417c96acdd43f7e90e9e74a1"},"schema_version":"1.0","source":{"id":"1309.7713","kind":"arxiv","version":3}},"canonical_sha256":"62e24428eb306748220681204a1612001cc9e620d744d92d5b49821971cdd8fa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"62e24428eb306748220681204a1612001cc9e620d744d92d5b49821971cdd8fa","first_computed_at":"2026-05-18T02:57:06.502769Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:06.502769Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r4u+5/vZjpFi9y9xT+jJH1h+ZdFWQkgRrwSuABqeRUBJD5mkIZN65MNzx9jIwPQ6AzTuwqJ7Rl2Nbe2rVwVeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:06.503274Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7713","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eee223f263518461fb89bac0c4009d4565d8b7c187e051652d9360e27b9a306","sha256:80a9ebd16b518424ba8cf1916bf50fb85698b5df84ef75b15a63cb549fd7e83f"],"state_sha256":"f054903b8f3dad8a3e62949fcfe6634ee8878ec59fdd8c0d1a93b36752cd4730"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HnTJUOwipJJuen4J9kGdOZNwemI1Z/nHqAtN8pEjB7EJRMmPUDN/S3S+Wbgw6Io3aQd2Wc4Zs5R18YgIhSrAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:42:11.819965Z","bundle_sha256":"3d7e5590ff08dca731e3407e89966bd05ad19452b62cf79dda45373fdb755e79"}}