{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:JVPJ2G7OXVQSRX2FQQCIF3HDHT","short_pith_number":"pith:JVPJ2G7O","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"},"canonical_sha256":"4d5e9d1beebd6128df45840482ece33cdd69763268bcd173f1515ab45b4f38b9","source":{"kind":"arxiv","id":"2207.11068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.11068","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"2207.11068v1","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11068","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"JVPJ2G7OXVQS","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"pith_short_16","alias_value":"JVPJ2G7OXVQSRX2F","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"pith_short_8","alias_value":"JVPJ2G7O","created_at":"2026-07-05T04:42:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:JVPJ2G7OXVQSRX2FQQCIF3HDHT","target":"record","payload":{"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"},"canonical_sha256":"4d5e9d1beebd6128df45840482ece33cdd69763268bcd173f1515ab45b4f38b9","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"},"source_kind":"arxiv","source_id":"2207.11068","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-07-05T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+dVoGJ4HFq/iNytGIX2gfhOEgpK/cRVpOObWmRt5ZY7NRI1o/tYazs9IIjEmFFL24PCwB0OGSowCmGg1uAjsDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:11:19.966427Z"},"content_sha256":"d0160cb2a3dffa3beab6da04d594c2fa946172d56dae45407a73f419a7610570","schema_version":"1.0","event_id":"sha256:d0160cb2a3dffa3beab6da04d594c2fa946172d56dae45407a73f419a7610570"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:JVPJ2G7OXVQSRX2FQQCIF3HDHT","target":"graph","payload":{"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"},"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-07-05T04:42:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7TZXAbzhAtRxAKfznGkLGkbJAvh2mdsgdqGXpg+mRoiXJdA6SOGJL+W5vNmPiM9Wo4LYg2WlCsetDeHWUppAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T10:11:19.966944Z"},"content_sha256":"7182ce64859026cc073c8cc633782e27daef1f30cdc6766b54b753be5ca7c0f5","schema_version":"1.0","event_id":"sha256:7182ce64859026cc073c8cc633782e27daef1f30cdc6766b54b753be5ca7c0f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/bundle.json","state_url":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/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-08-07T10:11:19Z","links":{"resolver":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT","bundle":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/bundle.json","state":"https://pith.science/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JVPJ2G7OXVQSRX2FQQCIF3HDHT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:JVPJ2G7OXVQSRX2FQQCIF3HDHT","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":"1f2a41eddf375eff4be2311dcbbe65e423a6bb19af1d12e4a8e6701827de8f18","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-07-22T13:16:50Z","title_canon_sha256":"f63ef855ec16036ddfcf43721907902b63df5d12d93bfaf3fabfeb4df08245cb"},"schema_version":"1.0","source":{"id":"2207.11068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.11068","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"arxiv_version","alias_value":"2207.11068v1","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.11068","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"pith_short_12","alias_value":"JVPJ2G7OXVQS","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"pith_short_16","alias_value":"JVPJ2G7OXVQSRX2F","created_at":"2026-07-05T04:42:43Z"},{"alias_kind":"pith_short_8","alias_value":"JVPJ2G7O","created_at":"2026-07-05T04:42:43Z"}],"graph_snapshots":[{"event_id":"sha256:7182ce64859026cc073c8cc633782e27daef1f30cdc6766b54b753be5ca7c0f5","target":"graph","created_at":"2026-07-05T04:42:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2207.11068/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Andris Ambainis, Florian Speelman, Harry Buhrman, Koen Leijnse, Subhasree Patro","cross_cats":["quant-ph"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-07-22T13:16:50Z","title":"Matching Triangles and Triangle Collection: Hardness based on a Weak Quantum Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.11068","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:d0160cb2a3dffa3beab6da04d594c2fa946172d56dae45407a73f419a7610570","target":"record","created_at":"2026-07-05T04:42:43Z","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":"1f2a41eddf375eff4be2311dcbbe65e423a6bb19af1d12e4a8e6701827de8f18","cross_cats_sorted":["quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2022-07-22T13:16:50Z","title_canon_sha256":"f63ef855ec16036ddfcf43721907902b63df5d12d93bfaf3fabfeb4df08245cb"},"schema_version":"1.0","source":{"id":"2207.11068","kind":"arxiv","version":1}},"canonical_sha256":"4d5e9d1beebd6128df45840482ece33cdd69763268bcd173f1515ab45b4f38b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d5e9d1beebd6128df45840482ece33cdd69763268bcd173f1515ab45b4f38b9","first_computed_at":"2026-07-05T04:42:43.283404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:42:43.283404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"awqGTWzYHCkmETTLYQiC/epiSFiA8Z2zamvbGn3Dtye5xohnIwQ9cRp1WdVZl2KMXEE15mhjJPpnez2O3ZGpBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:42:43.283737Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.11068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d0160cb2a3dffa3beab6da04d594c2fa946172d56dae45407a73f419a7610570","sha256:7182ce64859026cc073c8cc633782e27daef1f30cdc6766b54b753be5ca7c0f5"],"state_sha256":"a12ee21941748058e5bdb650d18c8b15bed7b19bf737b0827282e7e4d85c2402"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lpeGNYljDpc3IDgPuuS4v/hCTpCkNGx+KE8oi/OA0vIIrmKAVYHCJiNjChN91nq3K0fTISb9ER/nOgwLQoU/BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T10:11:19.971451Z","bundle_sha256":"2818e23dcc6f81a1e13a839c7bb3907d933682da7292abc16c8e2be4359a133d"}}