{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:36CSNUK4VPQ4MQP2DHJCZCTCP6","short_pith_number":"pith:36CSNUK4","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"},"canonical_sha256":"df8526d15cabe1c641fa19d22c8a627f9cf253cd88060db1f7465bba38f74bfe","source":{"kind":"arxiv","id":"1811.08097","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08097","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08097v3","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08097","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"36CSNUK4VPQ4","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36CSNUK4VPQ4MQP2","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36CSNUK4","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:36CSNUK4VPQ4MQP2DHJCZCTCP6","target":"record","payload":{"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"},"canonical_sha256":"df8526d15cabe1c641fa19d22c8a627f9cf253cd88060db1f7465bba38f74bfe","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"},"source_kind":"arxiv","source_id":"1811.08097","source_version":3,"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-17T23:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qWMg+QdWE22NQgfMy9GA/60kzOMSbV/Bo8M+l3puh6k36qtsnOa21WJIehdp/o6Hw2h77cUQ/sPqe8klAkCWCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:29:10.323178Z"},"content_sha256":"5ab23f511df6503317ed1337d8cdb6c6f4c295793595aa77d044af1af168cb4a","schema_version":"1.0","event_id":"sha256:5ab23f511df6503317ed1337d8cdb6c6f4c295793595aa77d044af1af168cb4a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:36CSNUK4VPQ4MQP2DHJCZCTCP6","target":"graph","payload":{"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"},"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-17T23:55:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4u0/hInuY+UFF5TU33Hk9opFs54p8V+P4wCuBVH8z5msHO3F8jVQLD6sv/PM3dk92gkfOAuGTLgLnwnBddW3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:29:10.323856Z"},"content_sha256":"62dc0b4ca7a63d53df88c60a944782aa68ad1b47f8171f3a36dadd1cf18a797f","schema_version":"1.0","event_id":"sha256:62dc0b4ca7a63d53df88c60a944782aa68ad1b47f8171f3a36dadd1cf18a797f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/bundle.json","state_url":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/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-05-26T22:29:10Z","links":{"resolver":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6","bundle":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/bundle.json","state":"https://pith.science/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36CSNUK4VPQ4MQP2DHJCZCTCP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:36CSNUK4VPQ4MQP2DHJCZCTCP6","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":"8924395d9aba068cdb15493a39a193612f2b45473f358c15eeb6a57719e5ec76","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-20T07:10:45Z","title_canon_sha256":"d8492e0f15283a7466cdbe502df922cf932dcf139314b448529a4d6bc4ad65a2"},"schema_version":"1.0","source":{"id":"1811.08097","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08097","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08097v3","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08097","created_at":"2026-05-17T23:55:28Z"},{"alias_kind":"pith_short_12","alias_value":"36CSNUK4VPQ4","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"36CSNUK4VPQ4MQP2","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"36CSNUK4","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:62dc0b4ca7a63d53df88c60a944782aa68ad1b47f8171f3a36dadd1cf18a797f","target":"graph","created_at":"2026-05-17T23:55:28Z","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":"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 ","authors_text":"Akinori Hosoyamada, Keita Xagawa, Seiichiro Tani, Yu Sasaki","cross_cats":["cs.CC","cs.DS","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-20T07:10:45Z","title":"Improved Quantum Multicollision-Finding Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08097","kind":"arxiv","version":3},"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:5ab23f511df6503317ed1337d8cdb6c6f4c295793595aa77d044af1af168cb4a","target":"record","created_at":"2026-05-17T23:55:28Z","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":"8924395d9aba068cdb15493a39a193612f2b45473f358c15eeb6a57719e5ec76","cross_cats_sorted":["cs.CC","cs.DS","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-11-20T07:10:45Z","title_canon_sha256":"d8492e0f15283a7466cdbe502df922cf932dcf139314b448529a4d6bc4ad65a2"},"schema_version":"1.0","source":{"id":"1811.08097","kind":"arxiv","version":3}},"canonical_sha256":"df8526d15cabe1c641fa19d22c8a627f9cf253cd88060db1f7465bba38f74bfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df8526d15cabe1c641fa19d22c8a627f9cf253cd88060db1f7465bba38f74bfe","first_computed_at":"2026-05-17T23:55:28.676237Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:28.676237Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qru1C72v/uIDpOGiwPvuDFbQygnBEyCbMz8nMnuUc7FXfMx36GTXEz3Zql1HM0XluiyllrTrmtxsgDIvc4BYAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:28.676672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08097","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ab23f511df6503317ed1337d8cdb6c6f4c295793595aa77d044af1af168cb4a","sha256:62dc0b4ca7a63d53df88c60a944782aa68ad1b47f8171f3a36dadd1cf18a797f"],"state_sha256":"9bdccd5ad9fa9d64fd2493d88c4198c7891b6dcc9687191422dce3b38ae990ce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mgd0vIfDoaqbevEa4urBG/7c2rA6c0BJv6CjvfabEdfmxqsvCgMxaA2LU3Ne7VA12p2KioFjVeTJ2/vjOTGJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:29:10.326895Z","bundle_sha256":"f4a2067a7fdb42e348bb14cde482a3b5b7b967ca7778047f486fc4d1d079aa95"}}