{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:36CSNUK4VPQ4MQP2DHJCZCTCP6","short_pith_number":"pith:36CSNUK4","schema_version":"1.0","canonical_sha256":"df8526d15cabe1c641fa19d22c8a627f9cf253cd88060db1f7465bba38f74bfe","source":{"kind":"arxiv","id":"1811.08097","version":3},"attestation_state":"computed","paper":{"title":"Improved Quantum Multicollision-Finding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","quant-ph"],"primary_cat":"cs.CR","authors_text":"Akinori Hosoyamada, Keita Xagawa, Seiichiro Tani, Yu Sasaki","submitted_at":"2018-11-20T07:10:45Z","abstract_excerpt":"The current paper improves the number of queries of the previous quantum multi-collision finding algorithms presented by Hosoyamada et al. at Asiacrypt 2017. Let an $l$-collision be a tuple of $l$ distinct inputs that result in the same output of a target function. In cryptology, it is important to study how many queries are required to find $l$-collisions for random functions of which domains are larger than ranges. The previous algorithm finds an $l$-collision for a random function by recursively calling the algorithm for finding $(l-1)$-collisions, and it achieves the average quantum query "},"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":"1811.08097","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-20T07:10:45Z","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"title_canon_sha256":"d8492e0f15283a7466cdbe502df922cf932dcf139314b448529a4d6bc4ad65a2","abstract_canon_sha256":"8924395d9aba068cdb15493a39a193612f2b45473f358c15eeb6a57719e5ec76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:28.676672Z","signature_b64":"qru1C72v/uIDpOGiwPvuDFbQygnBEyCbMz8nMnuUc7FXfMx36GTXEz3Zql1HM0XluiyllrTrmtxsgDIvc4BYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df8526d15cabe1c641fa19d22c8a627f9cf253cd88060db1f7465bba38f74bfe","last_reissued_at":"2026-05-17T23:55:28.676237Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:28.676237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved Quantum Multicollision-Finding Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","quant-ph"],"primary_cat":"cs.CR","authors_text":"Akinori Hosoyamada, Keita Xagawa, Seiichiro Tani, Yu Sasaki","submitted_at":"2018-11-20T07:10:45Z","abstract_excerpt":"The current paper improves the number of queries of the previous quantum multi-collision finding algorithms presented by Hosoyamada et al. at Asiacrypt 2017. Let an $l$-collision be a tuple of $l$ distinct inputs that result in the same output of a target function. In cryptology, it is important to study how many queries are required to find $l$-collisions for random functions of which domains are larger than ranges. The previous algorithm finds an $l$-collision for a random function by recursively calling the algorithm for finding $(l-1)$-collisions, and it achieves the average quantum query "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08097","kind":"arxiv","version":3},"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":"1811.08097","created_at":"2026-05-17T23:55:28.676306+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.08097v3","created_at":"2026-05-17T23:55:28.676306+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08097","created_at":"2026-05-17T23:55:28.676306+00:00"},{"alias_kind":"pith_short_12","alias_value":"36CSNUK4VPQ4","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"36CSNUK4VPQ4MQP2","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"36CSNUK4","created_at":"2026-05-18T12:32:02.567920+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/36CSNUK4VPQ4MQP2DHJCZCTCP6","json":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6.json","graph_json":"https://pith.science/api/pith-number/36CSNUK4VPQ4MQP2DHJCZCTCP6/graph.json","events_json":"https://pith.science/api/pith-number/36CSNUK4VPQ4MQP2DHJCZCTCP6/events.json","paper":"https://pith.science/paper/36CSNUK4"},"agent_actions":{"view_html":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6","download_json":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6.json","view_paper":"https://pith.science/paper/36CSNUK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.08097&json=true","fetch_graph":"https://pith.science/api/pith-number/36CSNUK4VPQ4MQP2DHJCZCTCP6/graph.json","fetch_events":"https://pith.science/api/pith-number/36CSNUK4VPQ4MQP2DHJCZCTCP6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/action/storage_attestation","attest_author":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/action/author_attestation","sign_citation":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/action/citation_signature","submit_replication":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/action/replication_record"}},"created_at":"2026-05-17T23:55:28.676306+00:00","updated_at":"2026-05-17T23:55:28.676306+00:00"}