{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DCMJH53WJ4MA3IE5JCBSZ3P52Y","short_pith_number":"pith:DCMJH53W","canonical_record":{"source":{"id":"1310.4127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T17:44:17Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"b34af198323686570569dbce12edd2a3ed77ce5c1a583661ddd8d21266dfa58f","abstract_canon_sha256":"4480434511cfdc0831598b724028c3fcd4161a9c645d3b3ab15cc1f334799f0f"},"schema_version":"1.0"},"canonical_sha256":"189893f7764f180da09d48832cedfdd6112fdd33ce6469ba5212af643528cc2e","source":{"kind":"arxiv","id":"1310.4127","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4127","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4127v2","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4127","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"DCMJH53WJ4MA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DCMJH53WJ4MA3IE5","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DCMJH53W","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DCMJH53WJ4MA3IE5JCBSZ3P52Y","target":"record","payload":{"canonical_record":{"source":{"id":"1310.4127","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T17:44:17Z","cross_cats_sorted":["cs.CC","cs.DS"],"title_canon_sha256":"b34af198323686570569dbce12edd2a3ed77ce5c1a583661ddd8d21266dfa58f","abstract_canon_sha256":"4480434511cfdc0831598b724028c3fcd4161a9c645d3b3ab15cc1f334799f0f"},"schema_version":"1.0"},"canonical_sha256":"189893f7764f180da09d48832cedfdd6112fdd33ce6469ba5212af643528cc2e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:09.606347Z","signature_b64":"TVevgJpI2SdMzoR4G8Y9VdgbbuTTx9MNun/HhwGi9XieobKlF4XkPZLcT0/L0PgAjYAFTMpUIA1FJgD4+9S0DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"189893f7764f180da09d48832cedfdd6112fdd33ce6469ba5212af643528cc2e","last_reissued_at":"2026-05-18T01:14:09.605682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:09.605682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.4127","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-05-18T01:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rc4v7A4NEipb4otj2Tng1sRcmO6ootqh9Lldu6RgFM9iJ5bPmBWDzdLGkT9j4XmK8MXF+Ec9PCiNSYMq44NfDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:10:50.512332Z"},"content_sha256":"e7cf171f0271dc7eed372ab9a6e162f3f74ca807a9a1a3fad51efa8de07605be","schema_version":"1.0","event_id":"sha256:e7cf171f0271dc7eed372ab9a6e162f3f74ca807a9a1a3fad51efa8de07605be"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DCMJH53WJ4MA3IE5JCBSZ3P52Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Finding Constant-sized Sub-hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS"],"primary_cat":"quant-ph","authors_text":"Fran\\c{c}ois Le Gall, Harumichi Nishimura, Seiichiro Tani","submitted_at":"2013-10-15T17:44:17Z","abstract_excerpt":"We develop a general framework to construct quantum algorithms that detect if a $3$-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph. This framework is based on the concept of nested quantum walks recently proposed by Jeffery, Kothari and Magniez [SODA'13], and extends the methodology designed by Lee, Magniez and Santha [SODA'13] for similar problems over graphs. As applications, we obtain a quantum algorithm for finding a $4$-clique in a $3$-uniform hypergraph on $n$ vertices with query complexity $O(n^{1.883})$, and a quantum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4127","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":""},"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:14:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CazgFUPijVbIGiDrgH4kda3vA8RiSWXAVouLKVoI7lHsCMowxf5U1zPRcDOM5Fbqf/xvtEbyu1jfY3SS2IhWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:10:50.512705Z"},"content_sha256":"a64f26ffabcb0d5462d77a79a11d6ba14ae7982c19bcbdb8cbb8259612428017","schema_version":"1.0","event_id":"sha256:a64f26ffabcb0d5462d77a79a11d6ba14ae7982c19bcbdb8cbb8259612428017"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCMJH53WJ4MA3IE5JCBSZ3P52Y/bundle.json","state_url":"https://pith.science/pith/DCMJH53WJ4MA3IE5JCBSZ3P52Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCMJH53WJ4MA3IE5JCBSZ3P52Y/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-05-26T11:10:50Z","links":{"resolver":"https://pith.science/pith/DCMJH53WJ4MA3IE5JCBSZ3P52Y","bundle":"https://pith.science/pith/DCMJH53WJ4MA3IE5JCBSZ3P52Y/bundle.json","state":"https://pith.science/pith/DCMJH53WJ4MA3IE5JCBSZ3P52Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCMJH53WJ4MA3IE5JCBSZ3P52Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DCMJH53WJ4MA3IE5JCBSZ3P52Y","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":"4480434511cfdc0831598b724028c3fcd4161a9c645d3b3ab15cc1f334799f0f","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T17:44:17Z","title_canon_sha256":"b34af198323686570569dbce12edd2a3ed77ce5c1a583661ddd8d21266dfa58f"},"schema_version":"1.0","source":{"id":"1310.4127","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.4127","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"arxiv_version","alias_value":"1310.4127v2","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.4127","created_at":"2026-05-18T01:14:09Z"},{"alias_kind":"pith_short_12","alias_value":"DCMJH53WJ4MA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DCMJH53WJ4MA3IE5","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DCMJH53W","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:a64f26ffabcb0d5462d77a79a11d6ba14ae7982c19bcbdb8cbb8259612428017","target":"graph","created_at":"2026-05-18T01:14:09Z","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 develop a general framework to construct quantum algorithms that detect if a $3$-uniform hypergraph given as input contains a sub-hypergraph isomorphic to a prespecified constant-sized hypergraph. This framework is based on the concept of nested quantum walks recently proposed by Jeffery, Kothari and Magniez [SODA'13], and extends the methodology designed by Lee, Magniez and Santha [SODA'13] for similar problems over graphs. As applications, we obtain a quantum algorithm for finding a $4$-clique in a $3$-uniform hypergraph on $n$ vertices with query complexity $O(n^{1.883})$, and a quantum ","authors_text":"Fran\\c{c}ois Le Gall, Harumichi Nishimura, Seiichiro Tani","cross_cats":["cs.CC","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T17:44:17Z","title":"Quantum Algorithms for Finding Constant-sized Sub-hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.4127","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:e7cf171f0271dc7eed372ab9a6e162f3f74ca807a9a1a3fad51efa8de07605be","target":"record","created_at":"2026-05-18T01:14:09Z","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":"4480434511cfdc0831598b724028c3fcd4161a9c645d3b3ab15cc1f334799f0f","cross_cats_sorted":["cs.CC","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-10-15T17:44:17Z","title_canon_sha256":"b34af198323686570569dbce12edd2a3ed77ce5c1a583661ddd8d21266dfa58f"},"schema_version":"1.0","source":{"id":"1310.4127","kind":"arxiv","version":2}},"canonical_sha256":"189893f7764f180da09d48832cedfdd6112fdd33ce6469ba5212af643528cc2e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"189893f7764f180da09d48832cedfdd6112fdd33ce6469ba5212af643528cc2e","first_computed_at":"2026-05-18T01:14:09.605682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:09.605682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TVevgJpI2SdMzoR4G8Y9VdgbbuTTx9MNun/HhwGi9XieobKlF4XkPZLcT0/L0PgAjYAFTMpUIA1FJgD4+9S0DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:09.606347Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.4127","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e7cf171f0271dc7eed372ab9a6e162f3f74ca807a9a1a3fad51efa8de07605be","sha256:a64f26ffabcb0d5462d77a79a11d6ba14ae7982c19bcbdb8cbb8259612428017"],"state_sha256":"6cb3357f2d2d4122ca2fdc344c85ea10c54fe2096faacf81719afd87e75724a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbaZNJzWamGreV+2j04iyJYp+SrbV6CAswwDKgl3tEBa4wJMmqQqbpArGe8aNvdFJUvNKN5pBJj8quWU5IgWCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:10:50.515155Z","bundle_sha256":"b1d1bd84725465f1f2f24d47a0a980dc8f4812b4613fbffdd55aa1048f434957"}}