{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GKGQIY7BZAFZQGB2FF5U5Y6XCT","short_pith_number":"pith:GKGQIY7B","canonical_record":{"source":{"id":"1209.2035","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-09-10T15:35:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"88f7914115f083f11e1e561806d32cd318479e9f3402a961a9799949ed30627c","abstract_canon_sha256":"2e901ce7cf1743c0c0123a0207a6bec4abb777bba1ef85deebc42ca716819120"},"schema_version":"1.0"},"canonical_sha256":"328d0463e1c80b98183a297b4ee3d714ffbf9bb1c566db79f0baa15620484514","source":{"kind":"arxiv","id":"1209.2035","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2035","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2035v4","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2035","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"GKGQIY7BZAFZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GKGQIY7BZAFZQGB2","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GKGQIY7B","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GKGQIY7BZAFZQGB2FF5U5Y6XCT","target":"record","payload":{"canonical_record":{"source":{"id":"1209.2035","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-09-10T15:35:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"88f7914115f083f11e1e561806d32cd318479e9f3402a961a9799949ed30627c","abstract_canon_sha256":"2e901ce7cf1743c0c0123a0207a6bec4abb777bba1ef85deebc42ca716819120"},"schema_version":"1.0"},"canonical_sha256":"328d0463e1c80b98183a297b4ee3d714ffbf9bb1c566db79f0baa15620484514","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:42.835063Z","signature_b64":"UI1jMqHDkFIUEwnkCQH22jNy0t9s/eZ/h3ssIZYJo3jLBDevddhPCygpKu3cBRXUUgPw3RLYvaprVdpeSxJpAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"328d0463e1c80b98183a297b4ee3d714ffbf9bb1c566db79f0baa15620484514","last_reissued_at":"2026-05-18T00:57:42.834699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:42.834699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.2035","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-18T00:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u5IBu84TKUY/dqHUVSTj9S8slcobDUVVnqozGRK1I9U9WWUcT0F4YBHfkkAD0GpXvFVX9jw12NFXljmGDUqbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:27:39.904174Z"},"content_sha256":"ce3e5db4e5720bb1ec917108b34c8082972197ae224ddf64227bddeb026bccef","schema_version":"1.0","event_id":"sha256:ce3e5db4e5720bb1ec917108b34c8082972197ae224ddf64227bddeb026bccef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GKGQIY7BZAFZQGB2FF5U5Y6XCT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Completely reducible sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.FL","authors_text":"Dominique Perrin","submitted_at":"2012-09-10T15:35:50Z","abstract_excerpt":"We study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the submonoids generated by bifix codes and, by a result of Berstel and Reutenauer, the cyclic sets. We study the closure properties of this family. We prove a result on linear representations of monoids which gives a generalization of the result concerning the complete reducibility of the submonoid generated by a bifix code to sets called birecurrent. We also give"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2035","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-18T00:57:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GODXAzML1wIURYar1ftYlk8vDPUH8/WdgKZrflOoQgGRws9+pkVEi741B6fqbR3LSNDn8/JtSYaLLi/L7XP8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:27:39.904544Z"},"content_sha256":"1b19d72aebdd308e4edca456f2d0b49b0ccaacf2bf53e003cabc01af3f6d33a9","schema_version":"1.0","event_id":"sha256:1b19d72aebdd308e4edca456f2d0b49b0ccaacf2bf53e003cabc01af3f6d33a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKGQIY7BZAFZQGB2FF5U5Y6XCT/bundle.json","state_url":"https://pith.science/pith/GKGQIY7BZAFZQGB2FF5U5Y6XCT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKGQIY7BZAFZQGB2FF5U5Y6XCT/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-30T19:27:39Z","links":{"resolver":"https://pith.science/pith/GKGQIY7BZAFZQGB2FF5U5Y6XCT","bundle":"https://pith.science/pith/GKGQIY7BZAFZQGB2FF5U5Y6XCT/bundle.json","state":"https://pith.science/pith/GKGQIY7BZAFZQGB2FF5U5Y6XCT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKGQIY7BZAFZQGB2FF5U5Y6XCT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GKGQIY7BZAFZQGB2FF5U5Y6XCT","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":"2e901ce7cf1743c0c0123a0207a6bec4abb777bba1ef85deebc42ca716819120","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-09-10T15:35:50Z","title_canon_sha256":"88f7914115f083f11e1e561806d32cd318479e9f3402a961a9799949ed30627c"},"schema_version":"1.0","source":{"id":"1209.2035","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.2035","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"arxiv_version","alias_value":"1209.2035v4","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2035","created_at":"2026-05-18T00:57:42Z"},{"alias_kind":"pith_short_12","alias_value":"GKGQIY7BZAFZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GKGQIY7BZAFZQGB2","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GKGQIY7B","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:1b19d72aebdd308e4edca456f2d0b49b0ccaacf2bf53e003cabc01af3f6d33a9","target":"graph","created_at":"2026-05-18T00:57:42Z","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 study the family of rational sets of words, called completely reducible and which are such that the syntactic representation of their characteristic series is completely reducible. This family contains, by a result of Reutenauer, the submonoids generated by bifix codes and, by a result of Berstel and Reutenauer, the cyclic sets. We study the closure properties of this family. We prove a result on linear representations of monoids which gives a generalization of the result concerning the complete reducibility of the submonoid generated by a bifix code to sets called birecurrent. We also give","authors_text":"Dominique Perrin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-09-10T15:35:50Z","title":"Completely reducible sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2035","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:ce3e5db4e5720bb1ec917108b34c8082972197ae224ddf64227bddeb026bccef","target":"record","created_at":"2026-05-18T00:57:42Z","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":"2e901ce7cf1743c0c0123a0207a6bec4abb777bba1ef85deebc42ca716819120","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-09-10T15:35:50Z","title_canon_sha256":"88f7914115f083f11e1e561806d32cd318479e9f3402a961a9799949ed30627c"},"schema_version":"1.0","source":{"id":"1209.2035","kind":"arxiv","version":4}},"canonical_sha256":"328d0463e1c80b98183a297b4ee3d714ffbf9bb1c566db79f0baa15620484514","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"328d0463e1c80b98183a297b4ee3d714ffbf9bb1c566db79f0baa15620484514","first_computed_at":"2026-05-18T00:57:42.834699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:42.834699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UI1jMqHDkFIUEwnkCQH22jNy0t9s/eZ/h3ssIZYJo3jLBDevddhPCygpKu3cBRXUUgPw3RLYvaprVdpeSxJpAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:42.835063Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.2035","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce3e5db4e5720bb1ec917108b34c8082972197ae224ddf64227bddeb026bccef","sha256:1b19d72aebdd308e4edca456f2d0b49b0ccaacf2bf53e003cabc01af3f6d33a9"],"state_sha256":"3a66bce7d94066d04eb37d16697c4b467178b5572ac6b60d9182fb99ffb6dafb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kk8I3OijI5NKDcgUNnrT5XNc7WW+awwMDId0U6GX8jHVwGpjxEr02tc+tlzn3lfnjzIpbpNSF1Hd26jWy9rZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:27:39.907093Z","bundle_sha256":"f3ac6cd1728edc967a4e6e1ed8ba621fe74aed1e236911a359cc349abec838a8"}}