{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZIUL5HNLFGYCWSLLJH6HVAGPH5","short_pith_number":"pith:ZIUL5HNL","canonical_record":{"source":{"id":"1708.06459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:47:56Z","cross_cats_sorted":[],"title_canon_sha256":"26994cf80bdf5a0109aa0619eac64e73193deedb92cba152d4e33abddc55926f","abstract_canon_sha256":"b6445d12526b2fb1dd6d6354553576029c0576800601b4bf2812ce286266f680"},"schema_version":"1.0"},"canonical_sha256":"ca28be9dab29b02b496b49fc7a80cf3f652fa63c311f366c54b6b5bfadc79f92","source":{"kind":"arxiv","id":"1708.06459","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06459","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06459v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06459","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZIUL5HNLFGYC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZIUL5HNLFGYCWSLL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZIUL5HNL","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZIUL5HNLFGYCWSLLJH6HVAGPH5","target":"record","payload":{"canonical_record":{"source":{"id":"1708.06459","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:47:56Z","cross_cats_sorted":[],"title_canon_sha256":"26994cf80bdf5a0109aa0619eac64e73193deedb92cba152d4e33abddc55926f","abstract_canon_sha256":"b6445d12526b2fb1dd6d6354553576029c0576800601b4bf2812ce286266f680"},"schema_version":"1.0"},"canonical_sha256":"ca28be9dab29b02b496b49fc7a80cf3f652fa63c311f366c54b6b5bfadc79f92","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:41.461983Z","signature_b64":"PFfv+myADjApeFEsDUkx0P2wwutBzxX6sgwp9s+qbqaBNk6F+t5TXRrIefrS6LVUYhPQAuLPPMLleWqQY7HQAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca28be9dab29b02b496b49fc7a80cf3f652fa63c311f366c54b6b5bfadc79f92","last_reissued_at":"2026-05-18T00:37:41.461276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:41.461276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.06459","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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bTOQwFSY54FrKS6wfeUCMGeEztO9cGDynxXZBeHjZdLEPgiuOyJWjfYRplfI8iIA4W/Ba1eFtT+SjPphCKItAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:19:02.038834Z"},"content_sha256":"c29c2370149c04ce672e258d0b5b46319e9ceb2b96762b134d4fa6196b0cfda6","schema_version":"1.0","event_id":"sha256:c29c2370149c04ce672e258d0b5b46319e9ceb2b96762b134d4fa6196b0cfda6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZIUL5HNLFGYCWSLLJH6HVAGPH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Unavoidable Sets of Partial Words of Uniform Length","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"F. Blanchet-Sadri (Department of Computer Science, Joey Becker (Department of Mathematics, Laure Flapan (Department of Mathematics, Stephen Watkins (Department of Mathematics, University of Nebraska), University of North Carolina), Vanderbilt University), Yale University)","submitted_at":"2017-08-22T00:47:56Z","abstract_excerpt":"A set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether or not a given finite set of n partial words over a k-letter alphabet is avoidable is NP-hard, even when we restrict to a set of partial words of uniform length. So classifying such sets, with parameters k and n, as avoidable or unavoidable becomes an interesting problem. In this paper, we work towards this classification problem by investigating the maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06459","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:37:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2np4DABUNCgDpPh7aySBxnnEcdy06xcv9w9H5/D46t2eHgomnXZo4cS+DgZ7SphYdpZAzMkdUgEbQeqIkk49Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T06:19:02.039182Z"},"content_sha256":"362f401d3a46c23c0d91a762f4b0f28aeb5c191990388ecf51f321f06e5c1121","schema_version":"1.0","event_id":"sha256:362f401d3a46c23c0d91a762f4b0f28aeb5c191990388ecf51f321f06e5c1121"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZIUL5HNLFGYCWSLLJH6HVAGPH5/bundle.json","state_url":"https://pith.science/pith/ZIUL5HNLFGYCWSLLJH6HVAGPH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZIUL5HNLFGYCWSLLJH6HVAGPH5/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-25T06:19:02Z","links":{"resolver":"https://pith.science/pith/ZIUL5HNLFGYCWSLLJH6HVAGPH5","bundle":"https://pith.science/pith/ZIUL5HNLFGYCWSLLJH6HVAGPH5/bundle.json","state":"https://pith.science/pith/ZIUL5HNLFGYCWSLLJH6HVAGPH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZIUL5HNLFGYCWSLLJH6HVAGPH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZIUL5HNLFGYCWSLLJH6HVAGPH5","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":"b6445d12526b2fb1dd6d6354553576029c0576800601b4bf2812ce286266f680","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:47:56Z","title_canon_sha256":"26994cf80bdf5a0109aa0619eac64e73193deedb92cba152d4e33abddc55926f"},"schema_version":"1.0","source":{"id":"1708.06459","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.06459","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"arxiv_version","alias_value":"1708.06459v1","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06459","created_at":"2026-05-18T00:37:41Z"},{"alias_kind":"pith_short_12","alias_value":"ZIUL5HNLFGYC","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZIUL5HNLFGYCWSLL","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZIUL5HNL","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:362f401d3a46c23c0d91a762f4b0f28aeb5c191990388ecf51f321f06e5c1121","target":"graph","created_at":"2026-05-18T00:37: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 set X of partial words over a finite alphabet A is called unavoidable if every two-sided infinite word over A has a factor compatible with an element of X. Unlike the case of a set of words without holes, the problem of deciding whether or not a given finite set of n partial words over a k-letter alphabet is avoidable is NP-hard, even when we restrict to a set of partial words of uniform length. So classifying such sets, with parameters k and n, as avoidable or unavoidable becomes an interesting problem. In this paper, we work towards this classification problem by investigating the maximum ","authors_text":"F. Blanchet-Sadri (Department of Computer Science, Joey Becker (Department of Mathematics, Laure Flapan (Department of Mathematics, Stephen Watkins (Department of Mathematics, University of Nebraska), University of North Carolina), Vanderbilt University), Yale University)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:47:56Z","title":"Unavoidable Sets of Partial Words of Uniform Length"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06459","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:c29c2370149c04ce672e258d0b5b46319e9ceb2b96762b134d4fa6196b0cfda6","target":"record","created_at":"2026-05-18T00:37: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":"b6445d12526b2fb1dd6d6354553576029c0576800601b4bf2812ce286266f680","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-08-22T00:47:56Z","title_canon_sha256":"26994cf80bdf5a0109aa0619eac64e73193deedb92cba152d4e33abddc55926f"},"schema_version":"1.0","source":{"id":"1708.06459","kind":"arxiv","version":1}},"canonical_sha256":"ca28be9dab29b02b496b49fc7a80cf3f652fa63c311f366c54b6b5bfadc79f92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca28be9dab29b02b496b49fc7a80cf3f652fa63c311f366c54b6b5bfadc79f92","first_computed_at":"2026-05-18T00:37:41.461276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:41.461276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PFfv+myADjApeFEsDUkx0P2wwutBzxX6sgwp9s+qbqaBNk6F+t5TXRrIefrS6LVUYhPQAuLPPMLleWqQY7HQAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:41.461983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.06459","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c29c2370149c04ce672e258d0b5b46319e9ceb2b96762b134d4fa6196b0cfda6","sha256:362f401d3a46c23c0d91a762f4b0f28aeb5c191990388ecf51f321f06e5c1121"],"state_sha256":"38b613b86be7a3bd5564a16c4c2f9384d2d2027a4b233e108dcda320a1f79318"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x/96K6w3ghCRWs3vBdHHjdMC+JvbdQkYnMeUETi8T2wjZrMvBFRdpj7zMTWNg/eyJb70l+e0uTlUvT16Ah1mDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T06:19:02.041125Z","bundle_sha256":"171b9ef870d8d6dea91ea65dbf30e4ca440dba8ddce53a8e24f2a3b3a0de08dc"}}