{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6FS43BZMNRSSY3CUUUIAZCRFUJ","short_pith_number":"pith:6FS43BZM","schema_version":"1.0","canonical_sha256":"f165cd872c6c652c6c54a5100c8a25a26892289371eb27a5a1f47a230b9b7af9","source":{"kind":"arxiv","id":"1305.0127","version":7},"attestation_state":"computed","paper":{"title":"The finite index basis property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christophe Reutenauer, Clelia De Felice, Dominique Perrin, Francesco Dolce, Giuseppina Rindone, Julien Leroy, Val\\'erie Berth\\'e","submitted_at":"2013-05-01T09:09:18Z","abstract_excerpt":"We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbolic systems corresponding to Sturmian words. We introduce a class of sets of factors of an infinite word with linear factor complexity containing Sturmian sets and regular interval exchange sets, namemly the class of tree sets. We prove as a main result that for a uniformly recurrent tree set $F$, a finite bifix code $X$ on the alphabet $A$ is $F$-maximal of $F$-degree $d$ if and only if it is the basis of a subgroup"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1305.0127","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-01T09:09:18Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"96b03e2e5d7ecb2de172a3f3460ad14302c5f502e7b7dc9989bd270e84c9fd46","abstract_canon_sha256":"ce40ab5033067471e7ad67c4bf8713d09b2b1c950610317e8235a72add2150ca"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:45.655576Z","signature_b64":"cwUcrhh8yZ557XI/+1Sfb9r1+NUP2KDdyv7vitgD/mUP9ySEJ5k7ityqCqwEGKcgI6sykNbDjpxmeZuyw7nBAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f165cd872c6c652c6c54a5100c8a25a26892289371eb27a5a1f47a230b9b7af9","last_reissued_at":"2026-05-18T02:26:45.655112Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:45.655112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The finite index basis property","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Christophe Reutenauer, Clelia De Felice, Dominique Perrin, Francesco Dolce, Giuseppina Rindone, Julien Leroy, Val\\'erie Berth\\'e","submitted_at":"2013-05-01T09:09:18Z","abstract_excerpt":"We describe in this paper a connection between bifix codes, symbolic dynamical systems and free groups. This is in the spirit of the connection established previously for the symbolic systems corresponding to Sturmian words. We introduce a class of sets of factors of an infinite word with linear factor complexity containing Sturmian sets and regular interval exchange sets, namemly the class of tree sets. We prove as a main result that for a uniformly recurrent tree set $F$, a finite bifix code $X$ on the alphabet $A$ is $F$-maximal of $F$-degree $d$ if and only if it is the basis of a subgroup"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0127","kind":"arxiv","version":7},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.0127","created_at":"2026-05-18T02:26:45.655195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.0127v7","created_at":"2026-05-18T02:26:45.655195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0127","created_at":"2026-05-18T02:26:45.655195+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FS43BZMNRSS","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FS43BZMNRSSY3CU","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FS43BZM","created_at":"2026-05-18T12:27:36.564083+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ","json":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ.json","graph_json":"https://pith.science/api/pith-number/6FS43BZMNRSSY3CUUUIAZCRFUJ/graph.json","events_json":"https://pith.science/api/pith-number/6FS43BZMNRSSY3CUUUIAZCRFUJ/events.json","paper":"https://pith.science/paper/6FS43BZM"},"agent_actions":{"view_html":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ","download_json":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ.json","view_paper":"https://pith.science/paper/6FS43BZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.0127&json=true","fetch_graph":"https://pith.science/api/pith-number/6FS43BZMNRSSY3CUUUIAZCRFUJ/graph.json","fetch_events":"https://pith.science/api/pith-number/6FS43BZMNRSSY3CUUUIAZCRFUJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/action/storage_attestation","attest_author":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/action/author_attestation","sign_citation":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/action/citation_signature","submit_replication":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/action/replication_record"}},"created_at":"2026-05-18T02:26:45.655195+00:00","updated_at":"2026-05-18T02:26:45.655195+00:00"}