{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4A6VNXNQNF2PVIKXXPFJOCFQ4I","short_pith_number":"pith:4A6VNXNQ","canonical_record":{"source":{"id":"1404.2824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-01T07:55:57Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"30a3d8f410bd41c0e3380757453c4fd432c51eac714aa7252db7f3a2f47a639a","abstract_canon_sha256":"ee38537e6abb4b74aecacbcf86d87732366e911105d8db292cbe604f137bbf98"},"schema_version":"1.0"},"canonical_sha256":"e03d56ddb06974faa157bbca9708b0e2025f9543ba83853d8482895b29b72d40","source":{"kind":"arxiv","id":"1404.2824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2824","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2824v1","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2824","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"4A6VNXNQNF2P","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4A6VNXNQNF2PVIKX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4A6VNXNQ","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4A6VNXNQNF2PVIKXXPFJOCFQ4I","target":"record","payload":{"canonical_record":{"source":{"id":"1404.2824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-01T07:55:57Z","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"title_canon_sha256":"30a3d8f410bd41c0e3380757453c4fd432c51eac714aa7252db7f3a2f47a639a","abstract_canon_sha256":"ee38537e6abb4b74aecacbcf86d87732366e911105d8db292cbe604f137bbf98"},"schema_version":"1.0"},"canonical_sha256":"e03d56ddb06974faa157bbca9708b0e2025f9543ba83853d8482895b29b72d40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:19.938214Z","signature_b64":"0CsW7R7IGzJdUlYXW3L/CEsU+c9pz9O1gYrwRfk3nWpKV4FK2kM+5pzqyKmOxbXbVDhkZsDeqNA+eeLWcnk/Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e03d56ddb06974faa157bbca9708b0e2025f9543ba83853d8482895b29b72d40","last_reissued_at":"2026-05-18T02:49:19.937626Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:19.937626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.2824","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IdGJZfVo0OqU56PHe6f97jBjLVGUnX10vmBmdPMs6y+AaNHNJuqriF95wnmHyLNV4AxLfK+7CYCgfF5/+QHtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:21:00.935107Z"},"content_sha256":"adea2a347cf9d6fadd7f742292bd5a16f2996f4b11a50067c320e89c150cb2e2","schema_version":"1.0","event_id":"sha256:adea2a347cf9d6fadd7f742292bd5a16f2996f4b11a50067c320e89c150cb2e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4A6VNXNQNF2PVIKXXPFJOCFQ4I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Normal, Abby Normal, Prefix Normal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.CO"],"primary_cat":"cs.FL","authors_text":"Frank Ruskey, Gabriele Fici, Joe Sawada, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","submitted_at":"2014-04-01T07:55:57Z","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 results about the number $pnw(n)$ of prefix normal words of length $n$, showing that $pnw(n) =\\Omega\\left(2^{n - c\\sqrt{n\\ln n}}\\right)$ for some $c$ and $pnw(n) = O \\left(\\frac{2^n (\\ln n)^2}{n}\\right)$. We introduce efficient algorithms for testing the prefix normal property and a \"mechanical algorithm\" for computing prefix normal forms. We also include games which"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2824","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:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pu0nPUygcmau8i5SowLCu/F0v1kPMkfWEp+GZiDYq5xKAX5yIEo2aTN9aVC7WKte8LB2VHyR85CgGUE6WPXXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:21:00.935934Z"},"content_sha256":"d833c9746c92cddfa93f930f95bd6c32041888f8b77d0b37b5824abd692786a5","schema_version":"1.0","event_id":"sha256:d833c9746c92cddfa93f930f95bd6c32041888f8b77d0b37b5824abd692786a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4A6VNXNQNF2PVIKXXPFJOCFQ4I/bundle.json","state_url":"https://pith.science/pith/4A6VNXNQNF2PVIKXXPFJOCFQ4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4A6VNXNQNF2PVIKXXPFJOCFQ4I/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-31T06:21:00Z","links":{"resolver":"https://pith.science/pith/4A6VNXNQNF2PVIKXXPFJOCFQ4I","bundle":"https://pith.science/pith/4A6VNXNQNF2PVIKXXPFJOCFQ4I/bundle.json","state":"https://pith.science/pith/4A6VNXNQNF2PVIKXXPFJOCFQ4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4A6VNXNQNF2PVIKXXPFJOCFQ4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4A6VNXNQNF2PVIKXXPFJOCFQ4I","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":"ee38537e6abb4b74aecacbcf86d87732366e911105d8db292cbe604f137bbf98","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-01T07:55:57Z","title_canon_sha256":"30a3d8f410bd41c0e3380757453c4fd432c51eac714aa7252db7f3a2f47a639a"},"schema_version":"1.0","source":{"id":"1404.2824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.2824","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"arxiv_version","alias_value":"1404.2824v1","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.2824","created_at":"2026-05-18T02:49:19Z"},{"alias_kind":"pith_short_12","alias_value":"4A6VNXNQNF2P","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4A6VNXNQNF2PVIKX","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4A6VNXNQ","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:d833c9746c92cddfa93f930f95bd6c32041888f8b77d0b37b5824abd692786a5","target":"graph","created_at":"2026-05-18T02:49:19Z","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 results about the number $pnw(n)$ of prefix normal words of length $n$, showing that $pnw(n) =\\Omega\\left(2^{n - c\\sqrt{n\\ln n}}\\right)$ for some $c$ and $pnw(n) = O \\left(\\frac{2^n (\\ln n)^2}{n}\\right)$. We introduce efficient algorithms for testing the prefix normal property and a \"mechanical algorithm\" for computing prefix normal forms. We also include games which","authors_text":"Frank Ruskey, Gabriele Fici, Joe Sawada, P\\'eter Burcsi, Zsuzsanna Lipt\\'ak","cross_cats":["cs.DM","cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-01T07:55:57Z","title":"Normal, Abby Normal, Prefix Normal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.2824","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:adea2a347cf9d6fadd7f742292bd5a16f2996f4b11a50067c320e89c150cb2e2","target":"record","created_at":"2026-05-18T02:49:19Z","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":"ee38537e6abb4b74aecacbcf86d87732366e911105d8db292cbe604f137bbf98","cross_cats_sorted":["cs.DM","cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-01T07:55:57Z","title_canon_sha256":"30a3d8f410bd41c0e3380757453c4fd432c51eac714aa7252db7f3a2f47a639a"},"schema_version":"1.0","source":{"id":"1404.2824","kind":"arxiv","version":1}},"canonical_sha256":"e03d56ddb06974faa157bbca9708b0e2025f9543ba83853d8482895b29b72d40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e03d56ddb06974faa157bbca9708b0e2025f9543ba83853d8482895b29b72d40","first_computed_at":"2026-05-18T02:49:19.937626Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:19.937626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0CsW7R7IGzJdUlYXW3L/CEsU+c9pz9O1gYrwRfk3nWpKV4FK2kM+5pzqyKmOxbXbVDhkZsDeqNA+eeLWcnk/Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:19.938214Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.2824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:adea2a347cf9d6fadd7f742292bd5a16f2996f4b11a50067c320e89c150cb2e2","sha256:d833c9746c92cddfa93f930f95bd6c32041888f8b77d0b37b5824abd692786a5"],"state_sha256":"ae67c0a419872a06f6dff5ea6e04f2992a4025618524bf410a455e8242f4c183"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RskqmrQbD3SA5OuEa9y3GROTMrYWRUNGDiMPuVPlRcIwlxZ+cq1B+9RV5d1Ibjem+Wdd13fW/xilLoZDxGX7Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:21:00.940055Z","bundle_sha256":"3632446a20588b18f5f77451bab9d48305c9bb20143c6fa6971e6e6c0daad6ae"}}