{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JWKWI62LMISMLAGFSL3MZEUGVR","short_pith_number":"pith:JWKWI62L","canonical_record":{"source":{"id":"1305.6395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-05-28T07:44:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dc8da8703246c7aecbbfafbd17f4aa08d053cc418cfeca9c065f94b318f79d29","abstract_canon_sha256":"4d0374147afe79475c1f5d24949e8a36850af8237995d1cf17d432605e39ca2b"},"schema_version":"1.0"},"canonical_sha256":"4d95647b4b6224c580c592f6cc9286ac6594e2fb78072d2d3630c407648d6419","source":{"kind":"arxiv","id":"1305.6395","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6395","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6395v3","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6395","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"JWKWI62LMISM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JWKWI62LMISMLAGF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JWKWI62L","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JWKWI62LMISMLAGFSL3MZEUGVR","target":"record","payload":{"canonical_record":{"source":{"id":"1305.6395","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-05-28T07:44:39Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"dc8da8703246c7aecbbfafbd17f4aa08d053cc418cfeca9c065f94b318f79d29","abstract_canon_sha256":"4d0374147afe79475c1f5d24949e8a36850af8237995d1cf17d432605e39ca2b"},"schema_version":"1.0"},"canonical_sha256":"4d95647b4b6224c580c592f6cc9286ac6594e2fb78072d2d3630c407648d6419","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:31.134145Z","signature_b64":"c2uZPC0nClpL6I/3PfqvABHdVKYrcA2wjpOJgDX6xmSY4lNCqi7IqfA2wMGitpwwoh5UKctL00wXUztfvvPgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d95647b4b6224c580c592f6cc9286ac6594e2fb78072d2d3630c407648d6419","last_reissued_at":"2026-05-18T02:32:31.133785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:31.133785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.6395","source_version":3,"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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b32enTFkq3IvkyaoYfk6X1sqVcjjz47I1JnMCan/lCMumOGDEtpbo5baRBzc/jZo3ts9trH8WhqU/h6CMkRxBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:50:20.184527Z"},"content_sha256":"a4559d05e0ad78d94d6ec372a8332aa30e8a29b2a4155def9ea9083bc7e80211","schema_version":"1.0","event_id":"sha256:a4559d05e0ad78d94d6ec372a8332aa30e8a29b2a4155def9ea9083bc7e80211"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JWKWI62LMISMLAGFSL3MZEUGVR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Number of Closed Factors in a Word","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Gabriele Fici, Golnaz Badkobeh, Zsuzsanna Lipt\\'ak","submitted_at":"2013-05-28T07:44:39Z","abstract_excerpt":"A closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of closed factors of words. We show that a word of length $n$ contains at least $n+1$ distinct closed factors, and characterize those words having exactly $n+1$ closed factors. Furthermore, we show that a word of length $n$ can contain $\\Theta(n^{2})$ many distinct closed factors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6395","kind":"arxiv","version":3},"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:32:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z1gL58NkP+JrbcOYdNb8gro0feDyLXLLKYg8vkD8Valmt0oGiGxqrBaDUPVzbpzYLRwFY1nbmti2PwXNc4njAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:50:20.185204Z"},"content_sha256":"021d3fa53f6dfe98f8781da3c6d6de780ed45387ccaba05ed04227e4613f95c1","schema_version":"1.0","event_id":"sha256:021d3fa53f6dfe98f8781da3c6d6de780ed45387ccaba05ed04227e4613f95c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JWKWI62LMISMLAGFSL3MZEUGVR/bundle.json","state_url":"https://pith.science/pith/JWKWI62LMISMLAGFSL3MZEUGVR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JWKWI62LMISMLAGFSL3MZEUGVR/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:50:20Z","links":{"resolver":"https://pith.science/pith/JWKWI62LMISMLAGFSL3MZEUGVR","bundle":"https://pith.science/pith/JWKWI62LMISMLAGFSL3MZEUGVR/bundle.json","state":"https://pith.science/pith/JWKWI62LMISMLAGFSL3MZEUGVR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JWKWI62LMISMLAGFSL3MZEUGVR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JWKWI62LMISMLAGFSL3MZEUGVR","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":"4d0374147afe79475c1f5d24949e8a36850af8237995d1cf17d432605e39ca2b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-05-28T07:44:39Z","title_canon_sha256":"dc8da8703246c7aecbbfafbd17f4aa08d053cc418cfeca9c065f94b318f79d29"},"schema_version":"1.0","source":{"id":"1305.6395","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.6395","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"arxiv_version","alias_value":"1305.6395v3","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.6395","created_at":"2026-05-18T02:32:31Z"},{"alias_kind":"pith_short_12","alias_value":"JWKWI62LMISM","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JWKWI62LMISMLAGF","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JWKWI62L","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:021d3fa53f6dfe98f8781da3c6d6de780ed45387ccaba05ed04227e4613f95c1","target":"graph","created_at":"2026-05-18T02:32:31Z","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 closed word (a.k.a. periodic-like word or complete first return) is a word whose longest border does not have internal occurrences, or, equivalently, whose longest repeated prefix is not right special. We investigate the structure of closed factors of words. We show that a word of length $n$ contains at least $n+1$ distinct closed factors, and characterize those words having exactly $n+1$ closed factors. Furthermore, we show that a word of length $n$ can contain $\\Theta(n^{2})$ many distinct closed factors.","authors_text":"Gabriele Fici, Golnaz Badkobeh, Zsuzsanna Lipt\\'ak","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-05-28T07:44:39Z","title":"On the Number of Closed Factors in a Word"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.6395","kind":"arxiv","version":3},"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:a4559d05e0ad78d94d6ec372a8332aa30e8a29b2a4155def9ea9083bc7e80211","target":"record","created_at":"2026-05-18T02:32:31Z","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":"4d0374147afe79475c1f5d24949e8a36850af8237995d1cf17d432605e39ca2b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-05-28T07:44:39Z","title_canon_sha256":"dc8da8703246c7aecbbfafbd17f4aa08d053cc418cfeca9c065f94b318f79d29"},"schema_version":"1.0","source":{"id":"1305.6395","kind":"arxiv","version":3}},"canonical_sha256":"4d95647b4b6224c580c592f6cc9286ac6594e2fb78072d2d3630c407648d6419","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d95647b4b6224c580c592f6cc9286ac6594e2fb78072d2d3630c407648d6419","first_computed_at":"2026-05-18T02:32:31.133785Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:32:31.133785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c2uZPC0nClpL6I/3PfqvABHdVKYrcA2wjpOJgDX6xmSY4lNCqi7IqfA2wMGitpwwoh5UKctL00wXUztfvvPgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:32:31.134145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.6395","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a4559d05e0ad78d94d6ec372a8332aa30e8a29b2a4155def9ea9083bc7e80211","sha256:021d3fa53f6dfe98f8781da3c6d6de780ed45387ccaba05ed04227e4613f95c1"],"state_sha256":"3395c18423b9806ddaca7a0f2789adbd44e2cd86f58a68187856ea7508e7982d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jqfvPOuV0SK9OGjuNfXutaPFJ2NVygjjlo7KNE5oiUUfo2dSJ2XJ93Gi7fwWc1tickBUyOdOM5StQ2esOdjmCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:50:20.188504Z","bundle_sha256":"43a22ad320c9f8939061ba82cc67e809dd9b2875c2c9bcafca338e35b5d93ef1"}}