{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YKSHWM7YFJJ2OD3GIYW2VVNMFN","short_pith_number":"pith:YKSHWM7Y","canonical_record":{"source":{"id":"1401.6346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-24T14:30:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c9e868a1357592b665bb56832faed25f5a8681bf95873eef0f8c1bd035937888","abstract_canon_sha256":"0dcc2b17eab8ba897f290ad2c0495eb286a3317fc69699576373ad6e7313316d"},"schema_version":"1.0"},"canonical_sha256":"c2a47b33f82a53a70f66462daad5ac2b4dc3f55316d3c2142ae492c214f5fa23","source":{"kind":"arxiv","id":"1401.6346","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6346","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6346v1","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6346","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"YKSHWM7YFJJ2","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YKSHWM7YFJJ2OD3G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YKSHWM7Y","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YKSHWM7YFJJ2OD3GIYW2VVNMFN","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6346","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-24T14:30:35Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"c9e868a1357592b665bb56832faed25f5a8681bf95873eef0f8c1bd035937888","abstract_canon_sha256":"0dcc2b17eab8ba897f290ad2c0495eb286a3317fc69699576373ad6e7313316d"},"schema_version":"1.0"},"canonical_sha256":"c2a47b33f82a53a70f66462daad5ac2b4dc3f55316d3c2142ae492c214f5fa23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:20.095181Z","signature_b64":"a2oiDt6Nl9KQZY+ho6a1LTMkrYLFK0h4zvuTzRXONsMYxryrFe0omC8sIfc/BZA4+2fn/5K8t3bycmXqVKXhCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2a47b33f82a53a70f66462daad5ac2b4dc3f55316d3c2142ae492c214f5fa23","last_reissued_at":"2026-05-18T02:49:20.094590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:20.094590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6346","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-18T02:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4m/MG323gK3WNspMuJghf6kzByevX7RF6YdJ9BTt02zkDxrGeUrs950f6/wzP+/WElorUZSVeQ86ajlXMt/mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:53:06.624628Z"},"content_sha256":"6938a235051138a768ac6c5b62619940a24bdf13397d3cf5a441f789988ffaf3","schema_version":"1.0","event_id":"sha256:6938a235051138a768ac6c5b62619940a24bdf13397d3cf5a441f789988ffaf3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YKSHWM7YFJJ2OD3GIYW2VVNMFN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Combinatorial Generation of Prefix Normal Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Frank Ruskey, Gabriele Fici, Joe Sawada, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","submitted_at":"2014-01-24T14:30:35Z","abstract_excerpt":"A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal words is a bubble language, a class of binary languages with the property that, for any word w in the language, exchanging the first occurrence of 01 by 10 in w results in another word in the language. We p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6346","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-18T02:49:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LZrwnDgPAnKKhzbfg+9TSEZhywN6RtKxaMbEbtGRjSqNvnI/uZG10MFiZnVHQC+xk/GWll6CMW19xJn8cCElCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:53:06.625072Z"},"content_sha256":"62c596e149be0ffe931df2fd44bd4ac2fe25ab8b9fb882fbfb501eb7756aac3c","schema_version":"1.0","event_id":"sha256:62c596e149be0ffe931df2fd44bd4ac2fe25ab8b9fb882fbfb501eb7756aac3c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKSHWM7YFJJ2OD3GIYW2VVNMFN/bundle.json","state_url":"https://pith.science/pith/YKSHWM7YFJJ2OD3GIYW2VVNMFN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKSHWM7YFJJ2OD3GIYW2VVNMFN/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-26T11:53:06Z","links":{"resolver":"https://pith.science/pith/YKSHWM7YFJJ2OD3GIYW2VVNMFN","bundle":"https://pith.science/pith/YKSHWM7YFJJ2OD3GIYW2VVNMFN/bundle.json","state":"https://pith.science/pith/YKSHWM7YFJJ2OD3GIYW2VVNMFN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKSHWM7YFJJ2OD3GIYW2VVNMFN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YKSHWM7YFJJ2OD3GIYW2VVNMFN","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":"0dcc2b17eab8ba897f290ad2c0495eb286a3317fc69699576373ad6e7313316d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-24T14:30:35Z","title_canon_sha256":"c9e868a1357592b665bb56832faed25f5a8681bf95873eef0f8c1bd035937888"},"schema_version":"1.0","source":{"id":"1401.6346","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6346","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6346v1","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6346","created_at":"2026-05-18T02:49:20Z"},{"alias_kind":"pith_short_12","alias_value":"YKSHWM7YFJJ2","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YKSHWM7YFJJ2OD3G","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YKSHWM7Y","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:62c596e149be0ffe931df2fd44bd4ac2fe25ab8b9fb882fbfb501eb7756aac3c","target":"graph","created_at":"2026-05-18T02:49:20Z","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":"A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present an efficient algorithm for exhaustively listing the prefix normal words with a fixed length. The algorithm is based on the fact that the language of prefix normal words is a bubble language, a class of binary languages with the property that, for any word w in the language, exchanging the first occurrence of 01 by 10 in w results in another word in the language. We p","authors_text":"Frank Ruskey, Gabriele Fici, Joe Sawada, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-24T14:30:35Z","title":"On Combinatorial Generation of Prefix Normal Words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6346","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:6938a235051138a768ac6c5b62619940a24bdf13397d3cf5a441f789988ffaf3","target":"record","created_at":"2026-05-18T02:49:20Z","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":"0dcc2b17eab8ba897f290ad2c0495eb286a3317fc69699576373ad6e7313316d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-24T14:30:35Z","title_canon_sha256":"c9e868a1357592b665bb56832faed25f5a8681bf95873eef0f8c1bd035937888"},"schema_version":"1.0","source":{"id":"1401.6346","kind":"arxiv","version":1}},"canonical_sha256":"c2a47b33f82a53a70f66462daad5ac2b4dc3f55316d3c2142ae492c214f5fa23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2a47b33f82a53a70f66462daad5ac2b4dc3f55316d3c2142ae492c214f5fa23","first_computed_at":"2026-05-18T02:49:20.094590Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:20.094590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a2oiDt6Nl9KQZY+ho6a1LTMkrYLFK0h4zvuTzRXONsMYxryrFe0omC8sIfc/BZA4+2fn/5K8t3bycmXqVKXhCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:20.095181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6346","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6938a235051138a768ac6c5b62619940a24bdf13397d3cf5a441f789988ffaf3","sha256:62c596e149be0ffe931df2fd44bd4ac2fe25ab8b9fb882fbfb501eb7756aac3c"],"state_sha256":"c716d1e2bce84da58602402d86b0db83e7683d0088805d1e60f5ffaf1f9e6630"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9sDIZWkG+Ja6v5NEIeyq0REOwRgwJ+xa3nH9l9KPFpQMUPuH5OXrLabkQdTKezzGzihNidtHpFPqHtKaYi9qBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:53:06.627859Z","bundle_sha256":"2fae805fd8c4d414336abef1a80ed387f1e1db87320aa68b0fcdf494b4d10704"}}