{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:X7H6NIY3ZYEFRODVWAB4BHF6UL","short_pith_number":"pith:X7H6NIY3","canonical_record":{"source":{"id":"1011.5369","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T13:32:50Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4b08a956a8a5336e39587243d26b041d79f7ea705e1a75a96950b8d8fbf1fd08","abstract_canon_sha256":"80a0e719fa89141d13dc5b5d7d18c243cd6f3b0f8aa2574297113dae41b472c4"},"schema_version":"1.0"},"canonical_sha256":"bfcfe6a31bce0858b875b003c09cbea2fc3f6706a2cbedd9d7cc0e047f17104c","source":{"kind":"arxiv","id":"1011.5369","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5369","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5369v4","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5369","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"X7H6NIY3ZYEF","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"X7H6NIY3ZYEFRODV","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"X7H6NIY3","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:X7H6NIY3ZYEFRODVWAB4BHF6UL","target":"record","payload":{"canonical_record":{"source":{"id":"1011.5369","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T13:32:50Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"4b08a956a8a5336e39587243d26b041d79f7ea705e1a75a96950b8d8fbf1fd08","abstract_canon_sha256":"80a0e719fa89141d13dc5b5d7d18c243cd6f3b0f8aa2574297113dae41b472c4"},"schema_version":"1.0"},"canonical_sha256":"bfcfe6a31bce0858b875b003c09cbea2fc3f6706a2cbedd9d7cc0e047f17104c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:34.704401Z","signature_b64":"5UwVaP7ku3VAEcq9fTFcACqy3mYu2uv9pfbI0VCt9/1MqxP1Ez7brwDom9hmz763c+QRBXKPk2wjLR+hoIYECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bfcfe6a31bce0858b875b003c09cbea2fc3f6706a2cbedd9d7cc0e047f17104c","last_reissued_at":"2026-05-18T03:15:34.703857Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:34.703857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.5369","source_version":4,"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:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"COXFoiFfQpM1T1Zeaez3bgc5rEB6Xz2jRsrypYJ4bX+adjwxCu/VTo403ONTlCSme5IEC5t0TNfl/dAVxl8YBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:09:04.659480Z"},"content_sha256":"5b3ee115ddefbec83dfdf03dc6dd4aa7665538d0c6e122cf92c15af1d5f1c3f5","schema_version":"1.0","event_id":"sha256:5b3ee115ddefbec83dfdf03dc6dd4aa7665538d0c6e122cf92c15af1d5f1c3f5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:X7H6NIY3ZYEFRODVWAB4BHF6UL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bifix codes and Sturmian words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.CO","authors_text":"Christophe Reutenauer, Clelia De Felice, Dominique Perrin, Giuseppina Rindone, Jean Berstel","submitted_at":"2010-11-24T13:32:50Z","abstract_excerpt":"We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes maximal in a recurrent set $F$ of words ($F$-maximal bifix codes). In the case of bifix codes contained in Sturmian sets of words, we obtain several new results. Let $F$ be a Sturmian set of words, defined as the set of factors of a strict episturmian word. Our results express the fact that an $F$-maximal bifix code of degree $d$ behaves just as the set of wo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5369","kind":"arxiv","version":4},"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:15:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+eqohhOGmtBBjKoDQtlOMvrIvOcl4H4PbZQ88jDymFZrL3Evswcn5KCgm+7JYBGrnkFpSWUtaPPsFY8UT8ugBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T16:09:04.660040Z"},"content_sha256":"02b6eb219ce2e9069369f8d328f453b076d4336c49e0fcc6628cce3ad8f29b4e","schema_version":"1.0","event_id":"sha256:02b6eb219ce2e9069369f8d328f453b076d4336c49e0fcc6628cce3ad8f29b4e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X7H6NIY3ZYEFRODVWAB4BHF6UL/bundle.json","state_url":"https://pith.science/pith/X7H6NIY3ZYEFRODVWAB4BHF6UL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X7H6NIY3ZYEFRODVWAB4BHF6UL/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-11T16:09:04Z","links":{"resolver":"https://pith.science/pith/X7H6NIY3ZYEFRODVWAB4BHF6UL","bundle":"https://pith.science/pith/X7H6NIY3ZYEFRODVWAB4BHF6UL/bundle.json","state":"https://pith.science/pith/X7H6NIY3ZYEFRODVWAB4BHF6UL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X7H6NIY3ZYEFRODVWAB4BHF6UL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:X7H6NIY3ZYEFRODVWAB4BHF6UL","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":"80a0e719fa89141d13dc5b5d7d18c243cd6f3b0f8aa2574297113dae41b472c4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T13:32:50Z","title_canon_sha256":"4b08a956a8a5336e39587243d26b041d79f7ea705e1a75a96950b8d8fbf1fd08"},"schema_version":"1.0","source":{"id":"1011.5369","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.5369","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"arxiv_version","alias_value":"1011.5369v4","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.5369","created_at":"2026-05-18T03:15:34Z"},{"alias_kind":"pith_short_12","alias_value":"X7H6NIY3ZYEF","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"X7H6NIY3ZYEFRODV","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"X7H6NIY3","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:02b6eb219ce2e9069369f8d328f453b076d4336c49e0fcc6628cce3ad8f29b4e","target":"graph","created_at":"2026-05-18T03:15:34Z","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":"We prove new results concerning the relation between bifix codes, episturmian words and subgroups offree groups. We study bifix codes in factorial sets of words. We generalize most properties of ordinary maximal bifix codes to bifix codes maximal in a recurrent set $F$ of words ($F$-maximal bifix codes). In the case of bifix codes contained in Sturmian sets of words, we obtain several new results. Let $F$ be a Sturmian set of words, defined as the set of factors of a strict episturmian word. Our results express the fact that an $F$-maximal bifix code of degree $d$ behaves just as the set of wo","authors_text":"Christophe Reutenauer, Clelia De Felice, Dominique Perrin, Giuseppina Rindone, Jean Berstel","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T13:32:50Z","title":"Bifix codes and Sturmian words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.5369","kind":"arxiv","version":4},"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:5b3ee115ddefbec83dfdf03dc6dd4aa7665538d0c6e122cf92c15af1d5f1c3f5","target":"record","created_at":"2026-05-18T03:15:34Z","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":"80a0e719fa89141d13dc5b5d7d18c243cd6f3b0f8aa2574297113dae41b472c4","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-11-24T13:32:50Z","title_canon_sha256":"4b08a956a8a5336e39587243d26b041d79f7ea705e1a75a96950b8d8fbf1fd08"},"schema_version":"1.0","source":{"id":"1011.5369","kind":"arxiv","version":4}},"canonical_sha256":"bfcfe6a31bce0858b875b003c09cbea2fc3f6706a2cbedd9d7cc0e047f17104c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bfcfe6a31bce0858b875b003c09cbea2fc3f6706a2cbedd9d7cc0e047f17104c","first_computed_at":"2026-05-18T03:15:34.703857Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:34.703857Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5UwVaP7ku3VAEcq9fTFcACqy3mYu2uv9pfbI0VCt9/1MqxP1Ez7brwDom9hmz763c+QRBXKPk2wjLR+hoIYECQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:34.704401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.5369","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b3ee115ddefbec83dfdf03dc6dd4aa7665538d0c6e122cf92c15af1d5f1c3f5","sha256:02b6eb219ce2e9069369f8d328f453b076d4336c49e0fcc6628cce3ad8f29b4e"],"state_sha256":"a1a5fcb01eea119e5f613bafe8adb6093e440089b07d5923bd5a69232b66cec4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vy07YwzcNYbYs6vC5k5CNP1dOkSzJAHV4zCR9rjiIAojNTaDQ/tXL+erRT3pcrMPeWMpXovBvqMhj7Ek2dheDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T16:09:04.664430Z","bundle_sha256":"75e7e04b399c22eeff07ba72d2e90bda723535682ade8781d0bdb948bb5340b2"}}