{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:T5URGI4LLC4D2ZPTQ6QIG2U36P","short_pith_number":"pith:T5URGI4L","canonical_record":{"source":{"id":"1611.09017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-28T08:18:50Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"aacc8fc42404627ae1ab8877a4d0b98b58d729d077eb594c655eadc30b2dc3d1","abstract_canon_sha256":"68ddbf42d41bb7f1a4c2d22b350ac1044cffc5353768ccded672c8857b68078e"},"schema_version":"1.0"},"canonical_sha256":"9f6913238b58b83d65f387a0836a9bf3f7a32019cebe705f494ababffad3c977","source":{"kind":"arxiv","id":"1611.09017","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09017","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09017v1","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09017","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"T5URGI4LLC4D","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T5URGI4LLC4D2ZPT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T5URGI4L","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:T5URGI4LLC4D2ZPTQ6QIG2U36P","target":"record","payload":{"canonical_record":{"source":{"id":"1611.09017","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-28T08:18:50Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"aacc8fc42404627ae1ab8877a4d0b98b58d729d077eb594c655eadc30b2dc3d1","abstract_canon_sha256":"68ddbf42d41bb7f1a4c2d22b350ac1044cffc5353768ccded672c8857b68078e"},"schema_version":"1.0"},"canonical_sha256":"9f6913238b58b83d65f387a0836a9bf3f7a32019cebe705f494ababffad3c977","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:41.940727Z","signature_b64":"ygkN5btJIEHL93uMURa/XDkmpHz/1dygBnguXwX9Y7OlX61Wzr+ZS0SbOoF0svVeDFMxenA4kPUClr0B7tmhDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f6913238b58b83d65f387a0836a9bf3f7a32019cebe705f494ababffad3c977","last_reissued_at":"2026-05-18T00:53:41.940063Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:41.940063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.09017","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"do3hQWeFC5+IhU6AOqHga9kpMIpnU5X96owuqK88AR6J9Fid4KyLy9vqj7Koz4G8cM90vW8/NMiKvfaNiQ80Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:13:42.468154Z"},"content_sha256":"4923c488743ce74b72d22ead6a253d430a1bdf043f9acdcde893ad4d85f16fac","schema_version":"1.0","event_id":"sha256:4923c488743ce74b72d22ead6a253d430a1bdf043f9acdcde893ad4d85f16fac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:T5URGI4LLC4D2ZPTQ6QIG2U36P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Prefix Normal Words and Prefix Normal Forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Frank Ruskey, Gabriele Fici, Joe Sawada, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","submitted_at":"2016-11-28T08:18:50Z","abstract_excerpt":"A $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their fa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09017","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-18T00:53:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tj+wA4XHmttPY+9AE1YoUSLri+OGQFUXUNIWHqlPj1sl77XSzP5S/6xhsVohxZhb1xGwNWaMv4bAtg//cMZgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T13:13:42.468602Z"},"content_sha256":"c0b67dccecbd4ff93df615115e8c343296f295def2b501463243796044791091","schema_version":"1.0","event_id":"sha256:c0b67dccecbd4ff93df615115e8c343296f295def2b501463243796044791091"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T5URGI4LLC4D2ZPTQ6QIG2U36P/bundle.json","state_url":"https://pith.science/pith/T5URGI4LLC4D2ZPTQ6QIG2U36P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T5URGI4LLC4D2ZPTQ6QIG2U36P/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-26T13:13:42Z","links":{"resolver":"https://pith.science/pith/T5URGI4LLC4D2ZPTQ6QIG2U36P","bundle":"https://pith.science/pith/T5URGI4LLC4D2ZPTQ6QIG2U36P/bundle.json","state":"https://pith.science/pith/T5URGI4LLC4D2ZPTQ6QIG2U36P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T5URGI4LLC4D2ZPTQ6QIG2U36P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:T5URGI4LLC4D2ZPTQ6QIG2U36P","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":"68ddbf42d41bb7f1a4c2d22b350ac1044cffc5353768ccded672c8857b68078e","cross_cats_sorted":["cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-28T08:18:50Z","title_canon_sha256":"aacc8fc42404627ae1ab8877a4d0b98b58d729d077eb594c655eadc30b2dc3d1"},"schema_version":"1.0","source":{"id":"1611.09017","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.09017","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"arxiv_version","alias_value":"1611.09017v1","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09017","created_at":"2026-05-18T00:53:41Z"},{"alias_kind":"pith_short_12","alias_value":"T5URGI4LLC4D","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"T5URGI4LLC4D2ZPT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"T5URGI4L","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:c0b67dccecbd4ff93df615115e8c343296f295def2b501463243796044791091","target":"graph","created_at":"2026-05-18T00:53:41Z","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 $1$-prefix normal word is a binary word with the property that no factor has more $1$s than the prefix of the same length; a $0$-prefix normal word is defined analogously. These words arise in the context of indexed binary jumbled pattern matching, where the aim is to decide whether a word has a factor with a given number of $1$s and $0$s (a given Parikh vector). Each binary word has an associated set of Parikh vectors of the factors of the word. Using prefix normal words, we provide a characterization of the equivalence class of binary words having the same set of Parikh vectors of their fa","authors_text":"Frank Ruskey, Gabriele Fici, Joe Sawada, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","cross_cats":["cs.FL","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-28T08:18:50Z","title":"On Prefix Normal Words and Prefix Normal Forms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09017","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:4923c488743ce74b72d22ead6a253d430a1bdf043f9acdcde893ad4d85f16fac","target":"record","created_at":"2026-05-18T00:53:41Z","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":"68ddbf42d41bb7f1a4c2d22b350ac1044cffc5353768ccded672c8857b68078e","cross_cats_sorted":["cs.FL","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2016-11-28T08:18:50Z","title_canon_sha256":"aacc8fc42404627ae1ab8877a4d0b98b58d729d077eb594c655eadc30b2dc3d1"},"schema_version":"1.0","source":{"id":"1611.09017","kind":"arxiv","version":1}},"canonical_sha256":"9f6913238b58b83d65f387a0836a9bf3f7a32019cebe705f494ababffad3c977","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f6913238b58b83d65f387a0836a9bf3f7a32019cebe705f494ababffad3c977","first_computed_at":"2026-05-18T00:53:41.940063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:41.940063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ygkN5btJIEHL93uMURa/XDkmpHz/1dygBnguXwX9Y7OlX61Wzr+ZS0SbOoF0svVeDFMxenA4kPUClr0B7tmhDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:41.940727Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.09017","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4923c488743ce74b72d22ead6a253d430a1bdf043f9acdcde893ad4d85f16fac","sha256:c0b67dccecbd4ff93df615115e8c343296f295def2b501463243796044791091"],"state_sha256":"89a01d99d819e56b2261dcbcf1f0a9c49533e5fc1c3e662c4c8e8f70f915ecb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZWRNhYwlorGknBJi0BZ6aQrtE8Qrbe+xKYK5SgYtQLy5YPpq5NjTu1E4UFSKtUlwiE/+Yx9kWAVXQutod8vZAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T13:13:42.471377Z","bundle_sha256":"320b6da5ef2a9238e2fbe956affe1edcf2c259b67af2ddc346ff54c8ab1eb823"}}