{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:O4XZAMMQFMSEXXOU5FOVN4AT4J","short_pith_number":"pith:O4XZAMMQ","schema_version":"1.0","canonical_sha256":"772f9031902b244bddd4e95d56f013e26793ad9dad219db34fd38aaebe657f71","source":{"kind":"arxiv","id":"0808.3112","version":4},"attestation_state":"computed","paper":{"title":"On the decidability of semigroup freeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francois Nicolas, Julien Cassaigne","submitted_at":"2008-08-22T16:37:29Z","abstract_excerpt":"This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoid. In 1991, Klarner, Birget and Satterfield proved the undecidability of the freeness problem over three-by-three integer matrices. Both results led to the publication of many s"},"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":"0808.3112","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2008-08-22T16:37:29Z","cross_cats_sorted":[],"title_canon_sha256":"e9b8867d79daa92a962de0f0a8729cc50cbe71e8e93314e26d4322d29c41e6bf","abstract_canon_sha256":"d617780364ab817db5c685810c8ccbb2b5b7a598dda526549f4f2db32f40dcf8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:24.671589Z","signature_b64":"H5DN4vxapqlXAKCnQQVWEJddbj+tLW0L7TE7gvxGvHKdjda+0BOIfG6V3CeBUjoovXy1i8NCQ8heUChdOeqCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"772f9031902b244bddd4e95d56f013e26793ad9dad219db34fd38aaebe657f71","last_reissued_at":"2026-05-18T03:56:24.670844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:24.670844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the decidability of semigroup freeness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Francois Nicolas, Julien Cassaigne","submitted_at":"2008-08-22T16:37:29Z","abstract_excerpt":"This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoid. In 1991, Klarner, Birget and Satterfield proved the undecidability of the freeness problem over three-by-three integer matrices. Both results led to the publication of many s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0808.3112","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0808.3112","created_at":"2026-05-18T03:56:24.670959+00:00"},{"alias_kind":"arxiv_version","alias_value":"0808.3112v4","created_at":"2026-05-18T03:56:24.670959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0808.3112","created_at":"2026-05-18T03:56:24.670959+00:00"},{"alias_kind":"pith_short_12","alias_value":"O4XZAMMQFMSE","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_16","alias_value":"O4XZAMMQFMSEXXOU","created_at":"2026-05-18T12:25:57.157939+00:00"},{"alias_kind":"pith_short_8","alias_value":"O4XZAMMQ","created_at":"2026-05-18T12:25:57.157939+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/O4XZAMMQFMSEXXOU5FOVN4AT4J","json":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J.json","graph_json":"https://pith.science/api/pith-number/O4XZAMMQFMSEXXOU5FOVN4AT4J/graph.json","events_json":"https://pith.science/api/pith-number/O4XZAMMQFMSEXXOU5FOVN4AT4J/events.json","paper":"https://pith.science/paper/O4XZAMMQ"},"agent_actions":{"view_html":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J","download_json":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J.json","view_paper":"https://pith.science/paper/O4XZAMMQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0808.3112&json=true","fetch_graph":"https://pith.science/api/pith-number/O4XZAMMQFMSEXXOU5FOVN4AT4J/graph.json","fetch_events":"https://pith.science/api/pith-number/O4XZAMMQFMSEXXOU5FOVN4AT4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J/action/storage_attestation","attest_author":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J/action/author_attestation","sign_citation":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J/action/citation_signature","submit_replication":"https://pith.science/pith/O4XZAMMQFMSEXXOU5FOVN4AT4J/action/replication_record"}},"created_at":"2026-05-18T03:56:24.670959+00:00","updated_at":"2026-05-18T03:56:24.670959+00:00"}