{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:T6RJ4SHGIW73UZMHPNUY46LLX5","short_pith_number":"pith:T6RJ4SHG","canonical_record":{"source":{"id":"1108.3617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-18T03:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"14a5d84ac916ba3b8b43cf6027d6d4461a2022a3d35c6a32a1095b232cf0f350","abstract_canon_sha256":"b613c3630cfee431656f255d47ee3f02e66cfa8153835f6b08ded5b18b5e3485"},"schema_version":"1.0"},"canonical_sha256":"9fa29e48e645bfba65877b698e796bbf7a2d8ea06f2c92ed0d95b6ddc817a9e8","source":{"kind":"arxiv","id":"1108.3617","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3617","created_at":"2026-05-18T04:15:15Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3617v1","created_at":"2026-05-18T04:15:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3617","created_at":"2026-05-18T04:15:15Z"},{"alias_kind":"pith_short_12","alias_value":"T6RJ4SHGIW73","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T6RJ4SHGIW73UZMH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T6RJ4SHG","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:T6RJ4SHGIW73UZMHPNUY46LLX5","target":"record","payload":{"canonical_record":{"source":{"id":"1108.3617","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-18T03:52:07Z","cross_cats_sorted":[],"title_canon_sha256":"14a5d84ac916ba3b8b43cf6027d6d4461a2022a3d35c6a32a1095b232cf0f350","abstract_canon_sha256":"b613c3630cfee431656f255d47ee3f02e66cfa8153835f6b08ded5b18b5e3485"},"schema_version":"1.0"},"canonical_sha256":"9fa29e48e645bfba65877b698e796bbf7a2d8ea06f2c92ed0d95b6ddc817a9e8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:15:15.773012Z","signature_b64":"83drMEo7OrCrT3jrO5JsAImH8SCtYvTE8O1vgzAelg8qAs9g/inJZfEHg7fwc639OsBMZmSaZl8YqZy80OMiAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9fa29e48e645bfba65877b698e796bbf7a2d8ea06f2c92ed0d95b6ddc817a9e8","last_reissued_at":"2026-05-18T04:15:15.772404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:15:15.772404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.3617","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-05-18T04:15:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKQ2MisODd8vDsLPB1/qYbbIp4nYaTZBj3vTtjDMjANwCdqlfQf6lsF2Bz//EPZLR2xhcThP5sr345fuyNJZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:57:11.159790Z"},"content_sha256":"aaf5d96f3af6d531c1181cb854355e04278e006c5d934b80331efdcf5324971a","schema_version":"1.0","event_id":"sha256:aaf5d96f3af6d531c1181cb854355e04278e006c5d934b80331efdcf5324971a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:T6RJ4SHGIW73UZMHPNUY46LLX5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Finland), Juha Kortelainen (Department of Information Processing Science, University of Oulu","submitted_at":"2011-08-18T03:52:07Z","abstract_excerpt":"Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet. In this paper we take another viewpoint and focus on combinatorial properties of long words in which the number of occurrences of any symbol is restritced by a fixed constant. We then demonstrate the connection  of these properties to constructing multicollision attacks on so called generalized iterated hash functions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3617","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":""},"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-18T04:15:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pvwTw8RYu6sD/oX+WOTXLq8KKP8ce3w1xTlcqyZ7gQP/QgYFAwLxbMHWo6GWSNJT9zd8KyvEzEbYICOA6TdNBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:57:11.160263Z"},"content_sha256":"a7cc8209fe846b63e4b2e46325ce7998d7b77ea88a6be475513bba38903651a5","schema_version":"1.0","event_id":"sha256:a7cc8209fe846b63e4b2e46325ce7998d7b77ea88a6be475513bba38903651a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T6RJ4SHGIW73UZMHPNUY46LLX5/bundle.json","state_url":"https://pith.science/pith/T6RJ4SHGIW73UZMHPNUY46LLX5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T6RJ4SHGIW73UZMHPNUY46LLX5/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-27T16:57:11Z","links":{"resolver":"https://pith.science/pith/T6RJ4SHGIW73UZMHPNUY46LLX5","bundle":"https://pith.science/pith/T6RJ4SHGIW73UZMHPNUY46LLX5/bundle.json","state":"https://pith.science/pith/T6RJ4SHGIW73UZMHPNUY46LLX5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T6RJ4SHGIW73UZMHPNUY46LLX5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:T6RJ4SHGIW73UZMHPNUY46LLX5","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":"b613c3630cfee431656f255d47ee3f02e66cfa8153835f6b08ded5b18b5e3485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-18T03:52:07Z","title_canon_sha256":"14a5d84ac916ba3b8b43cf6027d6d4461a2022a3d35c6a32a1095b232cf0f350"},"schema_version":"1.0","source":{"id":"1108.3617","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3617","created_at":"2026-05-18T04:15:15Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3617v1","created_at":"2026-05-18T04:15:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3617","created_at":"2026-05-18T04:15:15Z"},{"alias_kind":"pith_short_12","alias_value":"T6RJ4SHGIW73","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"T6RJ4SHGIW73UZMH","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"T6RJ4SHG","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:a7cc8209fe846b63e4b2e46325ce7998d7b77ea88a6be475513bba38903651a5","target":"graph","created_at":"2026-05-18T04:15:15Z","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":"Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet. In this paper we take another viewpoint and focus on combinatorial properties of long words in which the number of occurrences of any symbol is restritced by a fixed constant. We then demonstrate the connection  of these properties to constructing multicollision attacks on so called generalized iterated hash functions.","authors_text":"Finland), Juha Kortelainen (Department of Information Processing Science, University of Oulu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-18T03:52:07Z","title":"Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3617","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:aaf5d96f3af6d531c1181cb854355e04278e006c5d934b80331efdcf5324971a","target":"record","created_at":"2026-05-18T04:15:15Z","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":"b613c3630cfee431656f255d47ee3f02e66cfa8153835f6b08ded5b18b5e3485","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-08-18T03:52:07Z","title_canon_sha256":"14a5d84ac916ba3b8b43cf6027d6d4461a2022a3d35c6a32a1095b232cf0f350"},"schema_version":"1.0","source":{"id":"1108.3617","kind":"arxiv","version":1}},"canonical_sha256":"9fa29e48e645bfba65877b698e796bbf7a2d8ea06f2c92ed0d95b6ddc817a9e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9fa29e48e645bfba65877b698e796bbf7a2d8ea06f2c92ed0d95b6ddc817a9e8","first_computed_at":"2026-05-18T04:15:15.772404Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:15:15.772404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"83drMEo7OrCrT3jrO5JsAImH8SCtYvTE8O1vgzAelg8qAs9g/inJZfEHg7fwc639OsBMZmSaZl8YqZy80OMiAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:15:15.773012Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3617","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaf5d96f3af6d531c1181cb854355e04278e006c5d934b80331efdcf5324971a","sha256:a7cc8209fe846b63e4b2e46325ce7998d7b77ea88a6be475513bba38903651a5"],"state_sha256":"6d43a0b201ceb11c4c0a348200f5676aa66a38f8777e91a8c57b0535b8291129"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m3256bRlE4sOH+TjsFm9PUWW119o6tWlGtyXJXrU/J9BaExTBqzKJ1y6Oge+9Hrycnm8veRNGyDJ/jicsiSlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:57:11.163510Z","bundle_sha256":"a72c804e0c9432d0471725b873dad7783a71a2449231918c9e2d7aceda156337"}}