{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4KFV4FITVBVRPNBJV4FT6IX5E5","short_pith_number":"pith:4KFV4FIT","schema_version":"1.0","canonical_sha256":"e28b5e1513a86b17b429af0b3f22fd2749d0f2862f18c548fa5358ad8b2b6c5b","source":{"kind":"arxiv","id":"1507.03885","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1507.03885","created_at":"2026-05-18T01:36:52.309176+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.03885v1","created_at":"2026-05-18T01:36:52.309176+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.03885","created_at":"2026-05-18T01:36:52.309176+00:00"},{"alias_kind":"pith_short_12","alias_value":"4KFV4FITVBVR","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4KFV4FITVBVRPNBJ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4KFV4FIT","created_at":"2026-05-18T12:29:05.191682+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5","json":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5.json","graph_json":"https://pith.science/api/pith-number/4KFV4FITVBVRPNBJV4FT6IX5E5/graph.json","events_json":"https://pith.science/api/pith-number/4KFV4FITVBVRPNBJV4FT6IX5E5/events.json","paper":"https://pith.science/paper/4KFV4FIT"},"agent_actions":{"view_html":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5","download_json":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5.json","view_paper":"https://pith.science/paper/4KFV4FIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.03885&json=true","fetch_graph":"https://pith.science/api/pith-number/4KFV4FITVBVRPNBJV4FT6IX5E5/graph.json","fetch_events":"https://pith.science/api/pith-number/4KFV4FITVBVRPNBJV4FT6IX5E5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/action/storage_attestation","attest_author":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/action/author_attestation","sign_citation":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/action/citation_signature","submit_replication":"https://pith.science/pith/4KFV4FITVBVRPNBJV4FT6IX5E5/action/replication_record"}},"created_at":"2026-05-18T01:36:52.309176+00:00","updated_at":"2026-05-18T01:36:52.309176+00:00"}