{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:6N5BCUMZS7VOPGKDRRD6ZBNNLK","short_pith_number":"pith:6N5BCUMZ","schema_version":"1.0","canonical_sha256":"f37a11519997eae799438c47ec85ad5abc5c07f5ff2e06ad4a0d4e7817263c05","source":{"kind":"arxiv","id":"1002.2793","version":1},"attestation_state":"computed","paper":{"title":"On Straight Words and Minimal Permutators in Finite Transformation Semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Attila Egri-Nagy, Chrystopher L. Nehaniv","submitted_at":"2010-02-14T19:42:53Z","abstract_excerpt":"Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of special interest are words that permute a given subset of the state set. Certain such words, called minimal permutators, are shown to comprise a code, and the straight ones comprise a finite code. Thus, words that permute a given subset are uniquely factorizable as products of the subset's minimal permutators, and these can be further reduced to straight minim"},"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":"1002.2793","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2010-02-14T19:42:53Z","cross_cats_sorted":[],"title_canon_sha256":"63f8ddeddcdb6955ffce57248960824c66b07e0287a3cf839d8cf5f67b01fbf7","abstract_canon_sha256":"0e049558a779146f3954f554c0d05d546f43bdaa75404d02836806d6a40b4890"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:09:08.419613Z","signature_b64":"AKyh6CyKg9B7myYrJIeRyDFnd7DP9ltgS2ZiRzuwT3R+HD5JzomcPVgt7Cco7kejJ+xyh9txUoPmQVajl9BaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f37a11519997eae799438c47ec85ad5abc5c07f5ff2e06ad4a0d4e7817263c05","last_reissued_at":"2026-05-18T02:09:08.418949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:09:08.418949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Straight Words and Minimal Permutators in Finite Transformation Semigroups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Attila Egri-Nagy, Chrystopher L. Nehaniv","submitted_at":"2010-02-14T19:42:53Z","abstract_excerpt":"Motivated by issues arising in computer science, we investigate the loop-free paths from the identity transformation and corresponding straight words in the Cayley graph of a finite transformation semigroup with a fixed generator set. Of special interest are words that permute a given subset of the state set. Certain such words, called minimal permutators, are shown to comprise a code, and the straight ones comprise a finite code. Thus, words that permute a given subset are uniquely factorizable as products of the subset's minimal permutators, and these can be further reduced to straight minim"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1002.2793","kind":"arxiv","version":1},"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":"1002.2793","created_at":"2026-05-18T02:09:08.419030+00:00"},{"alias_kind":"arxiv_version","alias_value":"1002.2793v1","created_at":"2026-05-18T02:09:08.419030+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1002.2793","created_at":"2026-05-18T02:09:08.419030+00:00"},{"alias_kind":"pith_short_12","alias_value":"6N5BCUMZS7VO","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"6N5BCUMZS7VOPGKD","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"6N5BCUMZ","created_at":"2026-05-18T12:26:04.259169+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/6N5BCUMZS7VOPGKDRRD6ZBNNLK","json":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK.json","graph_json":"https://pith.science/api/pith-number/6N5BCUMZS7VOPGKDRRD6ZBNNLK/graph.json","events_json":"https://pith.science/api/pith-number/6N5BCUMZS7VOPGKDRRD6ZBNNLK/events.json","paper":"https://pith.science/paper/6N5BCUMZ"},"agent_actions":{"view_html":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK","download_json":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK.json","view_paper":"https://pith.science/paper/6N5BCUMZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1002.2793&json=true","fetch_graph":"https://pith.science/api/pith-number/6N5BCUMZS7VOPGKDRRD6ZBNNLK/graph.json","fetch_events":"https://pith.science/api/pith-number/6N5BCUMZS7VOPGKDRRD6ZBNNLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK/action/storage_attestation","attest_author":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK/action/author_attestation","sign_citation":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK/action/citation_signature","submit_replication":"https://pith.science/pith/6N5BCUMZS7VOPGKDRRD6ZBNNLK/action/replication_record"}},"created_at":"2026-05-18T02:09:08.419030+00:00","updated_at":"2026-05-18T02:09:08.419030+00:00"}