{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UK3UYMIYHDEJO3ZYMCJZPGQWK3","short_pith_number":"pith:UK3UYMIY","canonical_record":{"source":{"id":"1609.07786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-25T19:33:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cf5dbf40dfe430bd0e8347e87676b5c57c46eaa92eadc3de6e0294527f3635bc","abstract_canon_sha256":"630e43f58f30be2e408b44a5e319b06606f20418f38d1f82e7aa85c4a47d8adb"},"schema_version":"1.0"},"canonical_sha256":"a2b74c311838c8976f386093979a1656da36fb923bda74dffe0883cc3063f84f","source":{"kind":"arxiv","id":"1609.07786","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07786","created_at":"2026-05-18T01:02:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07786v2","created_at":"2026-05-18T01:02:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07786","created_at":"2026-05-18T01:02:30Z"},{"alias_kind":"pith_short_12","alias_value":"UK3UYMIYHDEJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UK3UYMIYHDEJO3ZY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UK3UYMIY","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UK3UYMIYHDEJO3ZYMCJZPGQWK3","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07786","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-25T19:33:40Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"cf5dbf40dfe430bd0e8347e87676b5c57c46eaa92eadc3de6e0294527f3635bc","abstract_canon_sha256":"630e43f58f30be2e408b44a5e319b06606f20418f38d1f82e7aa85c4a47d8adb"},"schema_version":"1.0"},"canonical_sha256":"a2b74c311838c8976f386093979a1656da36fb923bda74dffe0883cc3063f84f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:30.235172Z","signature_b64":"f/yZYT6YTZ4ShEcJIPRW9kaSBWjlgB47FqMgUdwuAVcv5esHgsjh3F54u9ysZKnc1y4czp8nhLTGoAlb4x9pBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a2b74c311838c8976f386093979a1656da36fb923bda74dffe0883cc3063f84f","last_reissued_at":"2026-05-18T01:02:30.234616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:30.234616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07786","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:02:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"abzgYgcjqvIJ88ZNiDJQXLjgBO/TZEdGIWj706yeA4H8g+4ov8bii0T6WWIHv8XPGacfsucQBE/32LMBac9QDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:24:12.407432Z"},"content_sha256":"a7e633da3134b249d8bbfd9ad0e0c21cfea6b7495585fc02c947d42d3a82c6f4","schema_version":"1.0","event_id":"sha256:a7e633da3134b249d8bbfd9ad0e0c21cfea6b7495585fc02c947d42d3a82c6f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UK3UYMIYHDEJO3ZYMCJZPGQWK3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Extended Learning Graphs for Triangle Finding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Fr\\'ed\\'eric Magniez, Mathieu Lauri\\`ere, Titouan Carette","submitted_at":"2016-09-25T19:33:40Z","abstract_excerpt":"We present new quantum algorithms for Triangle Finding improving its best previously known quantum query complexities for both dense and spare instances.For dense graphs on $n$ vertices, we get a query complexity of $O(n^{5/4})$ without any of the extra logarithmic factors present in the previous algorithm of Le Gall [FOCS'14]. For sparse graphs with $m\\geq n^{5/4}$ edges, we get a query complexity of $O(n^{11/12}m^{1/6}\\sqrt{\\log n})$, which is better than the one obtained by Le Gall and Nakajima [ISAAC'15] when $m \\geq n^{3/2}$. We also obtain an algorithm with query complexity ${O}(n^{5/6}("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07786","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:02:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xc+PpnWntLl0FzF352m7iUVRThFUWu2uKdyNWfppo8ljtRPPPWd/sdvKSnGj/v/+rj/EZavVG9caauO7ghS6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T18:24:12.407808Z"},"content_sha256":"6c20b447a0f1eae3c1ef3d8f40f2999f73dc61e1ccffc22a3366e4a4b904e7d7","schema_version":"1.0","event_id":"sha256:6c20b447a0f1eae3c1ef3d8f40f2999f73dc61e1ccffc22a3366e4a4b904e7d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UK3UYMIYHDEJO3ZYMCJZPGQWK3/bundle.json","state_url":"https://pith.science/pith/UK3UYMIYHDEJO3ZYMCJZPGQWK3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UK3UYMIYHDEJO3ZYMCJZPGQWK3/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-06-23T18:24:12Z","links":{"resolver":"https://pith.science/pith/UK3UYMIYHDEJO3ZYMCJZPGQWK3","bundle":"https://pith.science/pith/UK3UYMIYHDEJO3ZYMCJZPGQWK3/bundle.json","state":"https://pith.science/pith/UK3UYMIYHDEJO3ZYMCJZPGQWK3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UK3UYMIYHDEJO3ZYMCJZPGQWK3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UK3UYMIYHDEJO3ZYMCJZPGQWK3","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":"630e43f58f30be2e408b44a5e319b06606f20418f38d1f82e7aa85c4a47d8adb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-25T19:33:40Z","title_canon_sha256":"cf5dbf40dfe430bd0e8347e87676b5c57c46eaa92eadc3de6e0294527f3635bc"},"schema_version":"1.0","source":{"id":"1609.07786","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07786","created_at":"2026-05-18T01:02:30Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07786v2","created_at":"2026-05-18T01:02:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07786","created_at":"2026-05-18T01:02:30Z"},{"alias_kind":"pith_short_12","alias_value":"UK3UYMIYHDEJ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UK3UYMIYHDEJO3ZY","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UK3UYMIY","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:6c20b447a0f1eae3c1ef3d8f40f2999f73dc61e1ccffc22a3366e4a4b904e7d7","target":"graph","created_at":"2026-05-18T01:02:30Z","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 present new quantum algorithms for Triangle Finding improving its best previously known quantum query complexities for both dense and spare instances.For dense graphs on $n$ vertices, we get a query complexity of $O(n^{5/4})$ without any of the extra logarithmic factors present in the previous algorithm of Le Gall [FOCS'14]. For sparse graphs with $m\\geq n^{5/4}$ edges, we get a query complexity of $O(n^{11/12}m^{1/6}\\sqrt{\\log n})$, which is better than the one obtained by Le Gall and Nakajima [ISAAC'15] when $m \\geq n^{3/2}$. We also obtain an algorithm with query complexity ${O}(n^{5/6}(","authors_text":"Fr\\'ed\\'eric Magniez, Mathieu Lauri\\`ere, Titouan Carette","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-25T19:33:40Z","title":"Extended Learning Graphs for Triangle Finding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07786","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:a7e633da3134b249d8bbfd9ad0e0c21cfea6b7495585fc02c947d42d3a82c6f4","target":"record","created_at":"2026-05-18T01:02:30Z","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":"630e43f58f30be2e408b44a5e319b06606f20418f38d1f82e7aa85c4a47d8adb","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-09-25T19:33:40Z","title_canon_sha256":"cf5dbf40dfe430bd0e8347e87676b5c57c46eaa92eadc3de6e0294527f3635bc"},"schema_version":"1.0","source":{"id":"1609.07786","kind":"arxiv","version":2}},"canonical_sha256":"a2b74c311838c8976f386093979a1656da36fb923bda74dffe0883cc3063f84f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a2b74c311838c8976f386093979a1656da36fb923bda74dffe0883cc3063f84f","first_computed_at":"2026-05-18T01:02:30.234616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:30.234616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f/yZYT6YTZ4ShEcJIPRW9kaSBWjlgB47FqMgUdwuAVcv5esHgsjh3F54u9ysZKnc1y4czp8nhLTGoAlb4x9pBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:30.235172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07786","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a7e633da3134b249d8bbfd9ad0e0c21cfea6b7495585fc02c947d42d3a82c6f4","sha256:6c20b447a0f1eae3c1ef3d8f40f2999f73dc61e1ccffc22a3366e4a4b904e7d7"],"state_sha256":"0a482006b913cf48d4d1435ceae891641245cb9676a93b7b8790978d9241d147"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQwQOi/ixBJEEpSzOLvXWaayL8NjbKlNkOW4inyCAS95eo/hzPBBWckHeGd2XGlD3zYBP9j3vs9ja9o/a8+hDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T18:24:12.409818Z","bundle_sha256":"e720c47410c3a9d3747eb685d4207432676c8db6e3e9eae821ee86885461187b"}}