{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2CTELXRDL2USISXOCFYQDAD27I","short_pith_number":"pith:2CTELXRD","canonical_record":{"source":{"id":"1509.00622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-02T10:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"86d35903712697d7295d7b070c7906d6378c3571ecb650c3a8c8c37eef081c9e","abstract_canon_sha256":"acdf92fbf2173658ede366093599725e73661170d705434ede86b3707002622b"},"schema_version":"1.0"},"canonical_sha256":"d0a645de235ea9244aee117101807afa00cd4705b4f76cd6856674b006c42e3a","source":{"kind":"arxiv","id":"1509.00622","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00622","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00622v2","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00622","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"2CTELXRDL2US","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CTELXRDL2USISXO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CTELXRD","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2CTELXRDL2USISXOCFYQDAD27I","target":"record","payload":{"canonical_record":{"source":{"id":"1509.00622","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-02T10:07:06Z","cross_cats_sorted":[],"title_canon_sha256":"86d35903712697d7295d7b070c7906d6378c3571ecb650c3a8c8c37eef081c9e","abstract_canon_sha256":"acdf92fbf2173658ede366093599725e73661170d705434ede86b3707002622b"},"schema_version":"1.0"},"canonical_sha256":"d0a645de235ea9244aee117101807afa00cd4705b4f76cd6856674b006c42e3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:34.511429Z","signature_b64":"sv7fzO1uXqN0kp8r5alVZBeny9UEria8Wx9/MypbRDkMX1+5FwnKI8OJ81fZ0LKeA56k7zlm9JQJwb5O9+YmBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0a645de235ea9244aee117101807afa00cd4705b4f76cd6856674b006c42e3a","last_reissued_at":"2026-05-18T00:52:34.511049Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:34.511049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.00622","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-18T00:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UZX9bkhdFJPUMnWmQ0sZiRJ0ZeI4C4ueeFsnuzVNiQxSkZ1EhLEHViu36mIotwG53VxS2I6nh0JAMocc7SqVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:53:44.534394Z"},"content_sha256":"605d2f44602c2dc9895fd8dad9c72b97373abab1e70d0f898b42d1e0e5c9d961","schema_version":"1.0","event_id":"sha256:605d2f44602c2dc9895fd8dad9c72b97373abab1e70d0f898b42d1e0e5c9d961"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2CTELXRDL2USISXOCFYQDAD27I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Testing k-binomial equivalence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Dominik D. Freydenberger, Florin Manea, Juhani Karhum\\\"aki, Pawel Gawrychowski, Wojciech Rytter","submitted_at":"2015-09-02T10:07:06Z","abstract_excerpt":"Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a scattered factor of $w_2$. We give two different polynomial-time algorithms testing the $k$-binomial equivalence of two words. The first one is deterministic (but the degree of the corresponding polynomial is too high) and the second one is randomised (it is more direct and more efficient). These are the first known algorithms for the problem which run in polynomial"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00622","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-18T00:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iP6wzgcHxO0OMYkPgDz1IrCDDfUufKB+FucnnZ6W4CPqLzjttrWX2l/gGyO1ju6Jrwb/vOPCnUyHIujmdMpSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T14:53:44.534744Z"},"content_sha256":"f133829f8575fc66f6b59a34616f959febb4d4fdfde23a25918f906b74652e6d","schema_version":"1.0","event_id":"sha256:f133829f8575fc66f6b59a34616f959febb4d4fdfde23a25918f906b74652e6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CTELXRDL2USISXOCFYQDAD27I/bundle.json","state_url":"https://pith.science/pith/2CTELXRDL2USISXOCFYQDAD27I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CTELXRDL2USISXOCFYQDAD27I/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-20T14:53:44Z","links":{"resolver":"https://pith.science/pith/2CTELXRDL2USISXOCFYQDAD27I","bundle":"https://pith.science/pith/2CTELXRDL2USISXOCFYQDAD27I/bundle.json","state":"https://pith.science/pith/2CTELXRDL2USISXOCFYQDAD27I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CTELXRDL2USISXOCFYQDAD27I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2CTELXRDL2USISXOCFYQDAD27I","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":"acdf92fbf2173658ede366093599725e73661170d705434ede86b3707002622b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-02T10:07:06Z","title_canon_sha256":"86d35903712697d7295d7b070c7906d6378c3571ecb650c3a8c8c37eef081c9e"},"schema_version":"1.0","source":{"id":"1509.00622","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.00622","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1509.00622v2","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.00622","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"2CTELXRDL2US","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2CTELXRDL2USISXO","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2CTELXRD","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:f133829f8575fc66f6b59a34616f959febb4d4fdfde23a25918f906b74652e6d","target":"graph","created_at":"2026-05-18T00:52:34Z","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":"Two words $w_1$ and $w_2$ are said to be $k$-binomial equivalent if every non-empty word $x$ of length at most $k$ over the alphabet of $w_1$ and $w_2$ appears as a scattered factor of $w_1$ exactly as many times as it appears as a scattered factor of $w_2$. We give two different polynomial-time algorithms testing the $k$-binomial equivalence of two words. The first one is deterministic (but the degree of the corresponding polynomial is too high) and the second one is randomised (it is more direct and more efficient). These are the first known algorithms for the problem which run in polynomial","authors_text":"Dominik D. Freydenberger, Florin Manea, Juhani Karhum\\\"aki, Pawel Gawrychowski, Wojciech Rytter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-02T10:07:06Z","title":"Testing k-binomial equivalence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.00622","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:605d2f44602c2dc9895fd8dad9c72b97373abab1e70d0f898b42d1e0e5c9d961","target":"record","created_at":"2026-05-18T00:52:34Z","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":"acdf92fbf2173658ede366093599725e73661170d705434ede86b3707002622b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-02T10:07:06Z","title_canon_sha256":"86d35903712697d7295d7b070c7906d6378c3571ecb650c3a8c8c37eef081c9e"},"schema_version":"1.0","source":{"id":"1509.00622","kind":"arxiv","version":2}},"canonical_sha256":"d0a645de235ea9244aee117101807afa00cd4705b4f76cd6856674b006c42e3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0a645de235ea9244aee117101807afa00cd4705b4f76cd6856674b006c42e3a","first_computed_at":"2026-05-18T00:52:34.511049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:34.511049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sv7fzO1uXqN0kp8r5alVZBeny9UEria8Wx9/MypbRDkMX1+5FwnKI8OJ81fZ0LKeA56k7zlm9JQJwb5O9+YmBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:34.511429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.00622","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:605d2f44602c2dc9895fd8dad9c72b97373abab1e70d0f898b42d1e0e5c9d961","sha256:f133829f8575fc66f6b59a34616f959febb4d4fdfde23a25918f906b74652e6d"],"state_sha256":"ffb2bdfbc43eed13833d9a3816bff0774a75af4f03cfed2794d18d17725ccdd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yJ8yULM4mDYhb2AP13bQTnusndn15DamZfBbzE3BIur5FqCE2DmQcN30WCau7Ewkf26OdVK+UKal7WOdxz1WDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T14:53:44.536684Z","bundle_sha256":"d4b04c2fad9c859497cc745b10c825a8932c50b810cb2f2b3f97ca4060ccb0f0"}}