{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2DMKDLT6VLFODMAQLDN4J5LSMR","short_pith_number":"pith:2DMKDLT6","schema_version":"1.0","canonical_sha256":"d0d8a1ae7eaacae1b01058dbc4f5726466f73aff5713465a89c3a56869c32829","source":{"kind":"arxiv","id":"1402.7289","version":1},"attestation_state":"computed","paper":{"title":"On nonpermutational transformation semigroups with an application to syntactic complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Judit Nagy-Gyorgy, Szabolcs Ivan","submitted_at":"2014-02-28T15:56:22Z","abstract_excerpt":"We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same upper bound for the syntactic complexity of (generalized) definite languages as well."},"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":"1402.7289","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-02-28T15:56:22Z","cross_cats_sorted":[],"title_canon_sha256":"82ab74967bfab9ca443272e0ebbf5a4932bcf959fb0272d9366436957ce9a1e6","abstract_canon_sha256":"4ea0c9c528b8eba7028758c3079ebfd8e08b8ee8dfbd0e38b5c68cc6408d7306"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:34.417364Z","signature_b64":"DvuC5PgeH89xdYU9W3hl2rzlBfNOSypN/cm/vHyQ5hp7c2wXfO+o9SDDXiMaYCROHhrvsoaA98DmhsZrtQY1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0d8a1ae7eaacae1b01058dbc4f5726466f73aff5713465a89c3a56869c32829","last_reissued_at":"2026-05-18T02:57:34.416673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:34.416673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On nonpermutational transformation semigroups with an application to syntactic complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Judit Nagy-Gyorgy, Szabolcs Ivan","submitted_at":"2014-02-28T15:56:22Z","abstract_excerpt":"We give an upper bound of $n((n-1)!-(n-3)!)$ for the possible largest size of a subsemigroup of the full transformational semigroup over $n$ elements consisting only of nonpermutational transformations. As an application we gain the same upper bound for the syntactic complexity of (generalized) definite languages as well."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7289","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":"1402.7289","created_at":"2026-05-18T02:57:34.416784+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7289v1","created_at":"2026-05-18T02:57:34.416784+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7289","created_at":"2026-05-18T02:57:34.416784+00:00"},{"alias_kind":"pith_short_12","alias_value":"2DMKDLT6VLFO","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"2DMKDLT6VLFODMAQ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"2DMKDLT6","created_at":"2026-05-18T12:28:09.283467+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/2DMKDLT6VLFODMAQLDN4J5LSMR","json":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR.json","graph_json":"https://pith.science/api/pith-number/2DMKDLT6VLFODMAQLDN4J5LSMR/graph.json","events_json":"https://pith.science/api/pith-number/2DMKDLT6VLFODMAQLDN4J5LSMR/events.json","paper":"https://pith.science/paper/2DMKDLT6"},"agent_actions":{"view_html":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR","download_json":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR.json","view_paper":"https://pith.science/paper/2DMKDLT6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7289&json=true","fetch_graph":"https://pith.science/api/pith-number/2DMKDLT6VLFODMAQLDN4J5LSMR/graph.json","fetch_events":"https://pith.science/api/pith-number/2DMKDLT6VLFODMAQLDN4J5LSMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR/action/storage_attestation","attest_author":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR/action/author_attestation","sign_citation":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR/action/citation_signature","submit_replication":"https://pith.science/pith/2DMKDLT6VLFODMAQLDN4J5LSMR/action/replication_record"}},"created_at":"2026-05-18T02:57:34.416784+00:00","updated_at":"2026-05-18T02:57:34.416784+00:00"}