{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2UMYUP6NZAADS3PJSTD3WYH476","short_pith_number":"pith:2UMYUP6N","canonical_record":{"source":{"id":"1304.3666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-12T16:09:45Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"827b1746df82f1836ed3c7b872ef4b99a7ee8a0589e2d37e9dcbfa141f04222c","abstract_canon_sha256":"e63ba4ca6d936f65889b5730bb2662d31c7c927a767dbd65e1f91e07184af488"},"schema_version":"1.0"},"canonical_sha256":"d5198a3fcdc800396de994c7bb60fcff9e854308cbcdcf6bf317b9df25d583ef","source":{"kind":"arxiv","id":"1304.3666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3666","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3666v1","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3666","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"2UMYUP6NZAAD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2UMYUP6NZAADS3PJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2UMYUP6N","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2UMYUP6NZAADS3PJSTD3WYH476","target":"record","payload":{"canonical_record":{"source":{"id":"1304.3666","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-12T16:09:45Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"827b1746df82f1836ed3c7b872ef4b99a7ee8a0589e2d37e9dcbfa141f04222c","abstract_canon_sha256":"e63ba4ca6d936f65889b5730bb2662d31c7c927a767dbd65e1f91e07184af488"},"schema_version":"1.0"},"canonical_sha256":"d5198a3fcdc800396de994c7bb60fcff9e854308cbcdcf6bf317b9df25d583ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:06.896078Z","signature_b64":"Pon5S2olOyHZLxEaPdw3X9m4rRBA6L0X5+yllLoHF30p216hGywrNgYXZqLjOKBSSqg97OtMV8S0LaQPZJcWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5198a3fcdc800396de994c7bb60fcff9e854308cbcdcf6bf317b9df25d583ef","last_reissued_at":"2026-05-18T03:28:06.895298Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:06.895298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.3666","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-18T03:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjlfh5X/ahsr1quvf0Fc3CTKz/8hJBezcv595+9paWOnN6bVCXSkJkOipOOmUddRhuAumT8UAeznoL/Vf5GEAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:02:21.364922Z"},"content_sha256":"d3afc836d830b3f0d048472f878c091f12269e167a0279544bf8dcbb92127548","schema_version":"1.0","event_id":"sha256:d3afc836d830b3f0d048472f878c091f12269e167a0279544bf8dcbb92127548"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2UMYUP6NZAADS3PJSTD3WYH476","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sets Represented as the Length-n Factors of a Word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.FL","authors_text":"Jeffrey Shallit, Shuo Tan","submitted_at":"2013-04-12T16:09:45Z","abstract_excerpt":"In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such subsets are represented by words of length t? For the first problem, we give upper and lower bounds of the form alpha^(2^n) in the binary case. For the second problem, we give a weak upper bound and some experimental data. For the third problem, we give a closed-form formula in the case where n <= t < 2n. Algorithmic variants of these problems have previously bee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3666","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-18T03:28:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oGAYMZX+86ItFgUP9W5npdviGFq7tpydHFpB1B3Vd/C8f+SOSDTBn1Cf+4pQyqjYOejCu5383i2WitGKpQUvBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T19:02:21.365358Z"},"content_sha256":"a736e4a21a9d0fcce8a8ad69376276d2261920d784c33c3119f36784f510d087","schema_version":"1.0","event_id":"sha256:a736e4a21a9d0fcce8a8ad69376276d2261920d784c33c3119f36784f510d087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UMYUP6NZAADS3PJSTD3WYH476/bundle.json","state_url":"https://pith.science/pith/2UMYUP6NZAADS3PJSTD3WYH476/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UMYUP6NZAADS3PJSTD3WYH476/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-04T19:02:21Z","links":{"resolver":"https://pith.science/pith/2UMYUP6NZAADS3PJSTD3WYH476","bundle":"https://pith.science/pith/2UMYUP6NZAADS3PJSTD3WYH476/bundle.json","state":"https://pith.science/pith/2UMYUP6NZAADS3PJSTD3WYH476/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UMYUP6NZAADS3PJSTD3WYH476/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2UMYUP6NZAADS3PJSTD3WYH476","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":"e63ba4ca6d936f65889b5730bb2662d31c7c927a767dbd65e1f91e07184af488","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-12T16:09:45Z","title_canon_sha256":"827b1746df82f1836ed3c7b872ef4b99a7ee8a0589e2d37e9dcbfa141f04222c"},"schema_version":"1.0","source":{"id":"1304.3666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.3666","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"arxiv_version","alias_value":"1304.3666v1","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.3666","created_at":"2026-05-18T03:28:06Z"},{"alias_kind":"pith_short_12","alias_value":"2UMYUP6NZAAD","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2UMYUP6NZAADS3PJ","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2UMYUP6N","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:a736e4a21a9d0fcce8a8ad69376276d2261920d784c33c3119f36784f510d087","target":"graph","created_at":"2026-05-18T03:28:06Z","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":"In this paper we consider the following problems: how many different subsets of Sigma^n can occur as set of all length-n factors of a finite word? If a subset is representable, how long a word do we need to represent it? How many such subsets are represented by words of length t? For the first problem, we give upper and lower bounds of the form alpha^(2^n) in the binary case. For the second problem, we give a weak upper bound and some experimental data. For the third problem, we give a closed-form formula in the case where n <= t < 2n. Algorithmic variants of these problems have previously bee","authors_text":"Jeffrey Shallit, Shuo Tan","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-12T16:09:45Z","title":"Sets Represented as the Length-n Factors of a Word"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.3666","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:d3afc836d830b3f0d048472f878c091f12269e167a0279544bf8dcbb92127548","target":"record","created_at":"2026-05-18T03:28:06Z","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":"e63ba4ca6d936f65889b5730bb2662d31c7c927a767dbd65e1f91e07184af488","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-04-12T16:09:45Z","title_canon_sha256":"827b1746df82f1836ed3c7b872ef4b99a7ee8a0589e2d37e9dcbfa141f04222c"},"schema_version":"1.0","source":{"id":"1304.3666","kind":"arxiv","version":1}},"canonical_sha256":"d5198a3fcdc800396de994c7bb60fcff9e854308cbcdcf6bf317b9df25d583ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5198a3fcdc800396de994c7bb60fcff9e854308cbcdcf6bf317b9df25d583ef","first_computed_at":"2026-05-18T03:28:06.895298Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:06.895298Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pon5S2olOyHZLxEaPdw3X9m4rRBA6L0X5+yllLoHF30p216hGywrNgYXZqLjOKBSSqg97OtMV8S0LaQPZJcWCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:06.896078Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.3666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3afc836d830b3f0d048472f878c091f12269e167a0279544bf8dcbb92127548","sha256:a736e4a21a9d0fcce8a8ad69376276d2261920d784c33c3119f36784f510d087"],"state_sha256":"4cff8be33fefbe5e0d5d8ad199aabf2303ca8999b5121c5599c4ee91f9e02536"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gQcuC34cCoT+JhRR9mknjCR2HeWPOxilCTLsLtFjE8SvS2x4aK0stPVoBA4iWAbmHpNp8BMOHDqUBRs8P4qeBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T19:02:21.367517Z","bundle_sha256":"ec8852cd2d91e37e2944d554f9f7288ea5d867fb5d56c532fa2f957157ff3b49"}}