{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:JVPJ2G7OXVQSRX2FQQCIF3HDHT","short_pith_number":"pith:JVPJ2G7O","schema_version":"1.0","canonical_sha256":"4d5e9d1beebd6128df45840482ece33cdd69763268bcd173f1515ab45b4f38b9","source":{"kind":"arxiv","id":"2207.11068","version":1},"attestation_state":"computed","paper":{"title":"Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Florian Speelman, Harry Buhrman, Koen Leijnse, Subhasree Patro","submitted_at":"2022-07-22T13:16:50Z","abstract_excerpt":"Classically, for many computational problems one can conclude time lower bounds conditioned on the hardness of one or more of key problems: k-SAT, 3SUM and APSP. More recently, similar results have been derived in the quantum setting conditioned on the hardness of k-SAT and 3SUM. This is done using fine-grained reductions, where the approach is to (1) select a key problem $X$ that, for some function $T$, is conjectured to not be solvable by any $O(T(n)^{1-\\epsilon})$ time algorithm for any constant $\\epsilon > 0$ (in a fixed model of computation), and (2) reduce $X$ in a fine-grained way to th"},"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":"2207.11068","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-07-22T13:16:50Z","cross_cats_sorted":["quant-ph"],"title_canon_sha256":"f63ef855ec16036ddfcf43721907902b63df5d12d93bfaf3fabfeb4df08245cb","abstract_canon_sha256":"1f2a41eddf375eff4be2311dcbbe65e423a6bb19af1d12e4a8e6701827de8f18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:42:43.283737Z","signature_b64":"awqGTWzYHCkmETTLYQiC/epiSFiA8Z2zamvbGn3Dtye5xohnIwQ9cRp1WdVZl2KMXEE15mhjJPpnez2O3ZGpBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d5e9d1beebd6128df45840482ece33cdd69763268bcd173f1515ab45b4f38b9","last_reissued_at":"2026-07-05T04:42:43.283404Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:42:43.283404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["quant-ph"],"primary_cat":"cs.CC","authors_text":"Andris Ambainis, Florian Speelman, Harry Buhrman, Koen Leijnse, Subhasree Patro","submitted_at":"2022-07-22T13:16:50Z","abstract_excerpt":"Classically, for many computational problems one can conclude time lower bounds conditioned on the hardness of one or more of key problems: k-SAT, 3SUM and APSP. More recently, similar results have been derived in the quantum setting conditioned on the hardness of k-SAT and 3SUM. This is done using fine-grained reductions, where the approach is to (1) select a key problem $X$ that, for some function $T$, is conjectured to not be solvable by any $O(T(n)^{1-\\epsilon})$ time algorithm for any constant $\\epsilon > 0$ (in a fixed model of computation), and (2) reduce $X$ in a fine-grained way to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11068","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/2207.11068/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2207.11068","created_at":"2026-07-05T04:42:43.283461+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.11068v1","created_at":"2026-07-05T04:42:43.283461+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11068","created_at":"2026-07-05T04:42:43.283461+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVPJ2G7OXVQS","created_at":"2026-07-05T04:42:43.283461+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVPJ2G7OXVQSRX2F","created_at":"2026-07-05T04:42:43.283461+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVPJ2G7O","created_at":"2026-07-05T04:42:43.283461+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/JVPJ2G7OXVQSRX2FQQCIF3HDHT","json":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT.json","graph_json":"https://pith.science/api/pith-number/JVPJ2G7OXVQSRX2FQQCIF3HDHT/graph.json","events_json":"https://pith.science/api/pith-number/JVPJ2G7OXVQSRX2FQQCIF3HDHT/events.json","paper":"https://pith.science/paper/JVPJ2G7O"},"agent_actions":{"view_html":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT","download_json":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT.json","view_paper":"https://pith.science/paper/JVPJ2G7O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.11068&json=true","fetch_graph":"https://pith.science/api/pith-number/JVPJ2G7OXVQSRX2FQQCIF3HDHT/graph.json","fetch_events":"https://pith.science/api/pith-number/JVPJ2G7OXVQSRX2FQQCIF3HDHT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/action/storage_attestation","attest_author":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/action/author_attestation","sign_citation":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/action/citation_signature","submit_replication":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/action/replication_record"}},"created_at":"2026-07-05T04:42:43.283461+00:00","updated_at":"2026-07-05T04:42:43.283461+00:00"}