{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4KFV4FITVBVRPNBJV4FT6IX5E5","short_pith_number":"pith:4KFV4FIT","canonical_record":{"source":{"id":"1507.03885","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2015-07-14T15:20:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1d6038a16d75a9432ba586dd5fa652fe779932db51df37152992100a8a5984a4","abstract_canon_sha256":"3b9662423bab41608f7eec49d13a33fdcf30ff122b52cf9e1fd553053335b3b5"},"schema_version":"1.0"},"canonical_sha256":"e28b5e1513a86b17b429af0b3f22fd2749d0f2862f18c548fa5358ad8b2b6c5b","source":{"kind":"arxiv","id":"1507.03885","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03885","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03885v1","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03885","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"pith_short_12","alias_value":"4KFV4FITVBVR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4KFV4FITVBVRPNBJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4KFV4FIT","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4KFV4FITVBVRPNBJV4FT6IX5E5","target":"record","payload":{"canonical_record":{"source":{"id":"1507.03885","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2015-07-14T15:20:24Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"1d6038a16d75a9432ba586dd5fa652fe779932db51df37152992100a8a5984a4","abstract_canon_sha256":"3b9662423bab41608f7eec49d13a33fdcf30ff122b52cf9e1fd553053335b3b5"},"schema_version":"1.0"},"canonical_sha256":"e28b5e1513a86b17b429af0b3f22fd2749d0f2862f18c548fa5358ad8b2b6c5b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:52.309765Z","signature_b64":"Q/0LwHwQnC2vnNy9Vu19koGCrArNw8bYBw5BcX8zvRnGHxEMcipM3dYnQ7fuyAjeWhryKkETG3EeZ/bwudsuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e28b5e1513a86b17b429af0b3f22fd2749d0f2862f18c548fa5358ad8b2b6c5b","last_reissued_at":"2026-05-18T01:36:52.309064Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:52.309064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.03885","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:36:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+QGW8LX07zA/UTHWYwBD4+MbVjmGjYTBrUWaxbl+RmLuAa6OSOdNKpM12laAPdq75YyY6SBzjYs0qoPV+gPmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:22.041070Z"},"content_sha256":"b11f0dba97fa16550b4dcd154ef9ba54d4f92b35f65244875f8e4882132f347b","schema_version":"1.0","event_id":"sha256:b11f0dba97fa16550b4dcd154ef9ba54d4f92b35f65244875f8e4882132f347b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4KFV4FITVBVRPNBJV4FT6IX5E5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"J\\=anis Iraids, Kaspars Balodis","submitted_at":"2015-07-14T15:20:24Z","abstract_excerpt":"We show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\\rightarrow \\{0,1\\}$ as a black box. We are asked to determine if there exist $(u,v) \\in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03885","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:36:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mCyuOLW/4JA5GG1qUFHNtVyOfjLUtLj0yKPXkVSRAcNt6qWT9TXOS6m+xJF8utD+IH9sFJLfzDFX2z0LFYA8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:13:22.041449Z"},"content_sha256":"c04556273944d85c6713422d3971b63a58a9cc4a7de7d82c61126a02ba21c081","schema_version":"1.0","event_id":"sha256:c04556273944d85c6713422d3971b63a58a9cc4a7de7d82c61126a02ba21c081"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/bundle.json","state_url":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/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-31T03:13:22Z","links":{"resolver":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5","bundle":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/bundle.json","state":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4KFV4FITVBVRPNBJV4FT6IX5E5","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":"3b9662423bab41608f7eec49d13a33fdcf30ff122b52cf9e1fd553053335b3b5","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2015-07-14T15:20:24Z","title_canon_sha256":"1d6038a16d75a9432ba586dd5fa652fe779932db51df37152992100a8a5984a4"},"schema_version":"1.0","source":{"id":"1507.03885","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.03885","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"arxiv_version","alias_value":"1507.03885v1","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03885","created_at":"2026-05-18T01:36:52Z"},{"alias_kind":"pith_short_12","alias_value":"4KFV4FITVBVR","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4KFV4FITVBVRPNBJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4KFV4FIT","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:c04556273944d85c6713422d3971b63a58a9cc4a7de7d82c61126a02ba21c081","target":"graph","created_at":"2026-05-18T01:36:52Z","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 show that an improvement to the best known quantum lower bound for GRAPH-COLLISION problem implies an improvement to the best known lower bound for TRIANGLE problem in the quantum query complexity model. In GRAPH-COLLISION we are given free access to a graph $(V,E)$ and access to a function $f:V\\rightarrow \\{0,1\\}$ as a black box. We are asked to determine if there exist $(u,v) \\in E$, such that $f(u)=f(v)=1$. In TRIANGLE we have a black box access to an adjacency matrix of a graph and we have to determine if the graph contains a triangle. For both of these problems the known lower bounds a","authors_text":"J\\=anis Iraids, Kaspars Balodis","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2015-07-14T15:20:24Z","title":"Quantum Lower Bound for Graph Collision Implies Lower Bound for Triangle Detection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.03885","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:b11f0dba97fa16550b4dcd154ef9ba54d4f92b35f65244875f8e4882132f347b","target":"record","created_at":"2026-05-18T01:36:52Z","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":"3b9662423bab41608f7eec49d13a33fdcf30ff122b52cf9e1fd553053335b3b5","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2015-07-14T15:20:24Z","title_canon_sha256":"1d6038a16d75a9432ba586dd5fa652fe779932db51df37152992100a8a5984a4"},"schema_version":"1.0","source":{"id":"1507.03885","kind":"arxiv","version":1}},"canonical_sha256":"e28b5e1513a86b17b429af0b3f22fd2749d0f2862f18c548fa5358ad8b2b6c5b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e28b5e1513a86b17b429af0b3f22fd2749d0f2862f18c548fa5358ad8b2b6c5b","first_computed_at":"2026-05-18T01:36:52.309064Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:52.309064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q/0LwHwQnC2vnNy9Vu19koGCrArNw8bYBw5BcX8zvRnGHxEMcipM3dYnQ7fuyAjeWhryKkETG3EeZ/bwudsuDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:52.309765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.03885","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b11f0dba97fa16550b4dcd154ef9ba54d4f92b35f65244875f8e4882132f347b","sha256:c04556273944d85c6713422d3971b63a58a9cc4a7de7d82c61126a02ba21c081"],"state_sha256":"3093ab9ca844af35efb544a468376b559fe9a91626205816a4c8b714327239ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGONk+9sKR6VLYY+mNhsCt3MpP+w45nW1ICB64/60jJEhBXjsqW9mP1XsoA98coKMCoYP8x+rucMR/2Yw6m7AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:13:22.043608Z","bundle_sha256":"d987b29fde883756b432dbc0184f513fab115b99f4e588d12d3b332561f99f4a"}}