{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6FS43BZMNRSSY3CUUUIAZCRFUJ","short_pith_number":"pith:6FS43BZM","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"},"canonical_sha256":"f165cd872c6c652c6c54a5100c8a25a26892289371eb27a5a1f47a230b9b7af9","source":{"kind":"arxiv","id":"1305.0127","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0127","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0127v7","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0127","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"6FS43BZMNRSS","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6FS43BZMNRSSY3CU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6FS43BZM","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6FS43BZMNRSSY3CUUUIAZCRFUJ","target":"record","payload":{"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"},"canonical_sha256":"f165cd872c6c652c6c54a5100c8a25a26892289371eb27a5a1f47a230b9b7af9","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"},"source_kind":"arxiv","source_id":"1305.0127","source_version":7,"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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GuC66jXR8gFYpta1c711zVo/alRCVPHeZ17OGVoUWn0fsAo7CoK8J60+KJNXIwsETj1lJpEoE+QyNO2bKXZNDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:09:59.245804Z"},"content_sha256":"cd3e20e9d90f5a008697078f57cb5c1915c42b7e27878e87d9d9697ac5a26398","schema_version":"1.0","event_id":"sha256:cd3e20e9d90f5a008697078f57cb5c1915c42b7e27878e87d9d9697ac5a26398"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6FS43BZMNRSSY3CUUUIAZCRFUJ","target":"graph","payload":{"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"},"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:26:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWdQKy8Qt0mOLsjuTwjkVJPAtgQhEScMiHDPIuvRuG0HhTPrs2K5wO2pP/ceT+IoXOIUd5OQqcHnSU38t1k6AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T06:09:59.246174Z"},"content_sha256":"bca9ca8b8d5b69dbb47c8ba6b5d0d54ec073c01098119644a692162a035cac76","schema_version":"1.0","event_id":"sha256:bca9ca8b8d5b69dbb47c8ba6b5d0d54ec073c01098119644a692162a035cac76"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/bundle.json","state_url":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/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-27T06:09:59Z","links":{"resolver":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ","bundle":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/bundle.json","state":"https://pith.science/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6FS43BZMNRSSY3CUUUIAZCRFUJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6FS43BZMNRSSY3CUUUIAZCRFUJ","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":"ce40ab5033067471e7ad67c4bf8713d09b2b1c950610317e8235a72add2150ca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-01T09:09:18Z","title_canon_sha256":"96b03e2e5d7ecb2de172a3f3460ad14302c5f502e7b7dc9989bd270e84c9fd46"},"schema_version":"1.0","source":{"id":"1305.0127","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0127","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0127v7","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0127","created_at":"2026-05-18T02:26:45Z"},{"alias_kind":"pith_short_12","alias_value":"6FS43BZMNRSS","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6FS43BZMNRSSY3CU","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6FS43BZM","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:bca9ca8b8d5b69dbb47c8ba6b5d0d54ec073c01098119644a692162a035cac76","target":"graph","created_at":"2026-05-18T02:26:45Z","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 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","authors_text":"Christophe Reutenauer, Clelia De Felice, Dominique Perrin, Francesco Dolce, Giuseppina Rindone, Julien Leroy, Val\\'erie Berth\\'e","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-01T09:09:18Z","title":"The finite index basis property"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0127","kind":"arxiv","version":7},"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:cd3e20e9d90f5a008697078f57cb5c1915c42b7e27878e87d9d9697ac5a26398","target":"record","created_at":"2026-05-18T02:26:45Z","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":"ce40ab5033067471e7ad67c4bf8713d09b2b1c950610317e8235a72add2150ca","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2013-05-01T09:09:18Z","title_canon_sha256":"96b03e2e5d7ecb2de172a3f3460ad14302c5f502e7b7dc9989bd270e84c9fd46"},"schema_version":"1.0","source":{"id":"1305.0127","kind":"arxiv","version":7}},"canonical_sha256":"f165cd872c6c652c6c54a5100c8a25a26892289371eb27a5a1f47a230b9b7af9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f165cd872c6c652c6c54a5100c8a25a26892289371eb27a5a1f47a230b9b7af9","first_computed_at":"2026-05-18T02:26:45.655112Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:45.655112Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cwUcrhh8yZ557XI/+1Sfb9r1+NUP2KDdyv7vitgD/mUP9ySEJ5k7ityqCqwEGKcgI6sykNbDjpxmeZuyw7nBAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:45.655576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0127","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd3e20e9d90f5a008697078f57cb5c1915c42b7e27878e87d9d9697ac5a26398","sha256:bca9ca8b8d5b69dbb47c8ba6b5d0d54ec073c01098119644a692162a035cac76"],"state_sha256":"0d910a2693a3ac9128aba16206ef9de1b19801072216f0a27373002ba9cd17cd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGlxpct7n+BE5JbtypUfKeO/dEKLmfkcwg1dviuE4EC10N8+iF/KJdEwCT4aQ8gYQYlfXZinBtQj+UKVpsFjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T06:09:59.248930Z","bundle_sha256":"b4f70acf0adb059c04ee3bdcbd13f860c81c99c05a2d4bf042d318cccb3939a7"}}