{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:TIJXYVD5SDLBGMMVA7CMJENXEX","short_pith_number":"pith:TIJXYVD5","schema_version":"1.0","canonical_sha256":"9a137c547d90d613319507c4c491b725d28ace8432de42b1afe409639e8cc8b5","source":{"kind":"arxiv","id":"1301.5588","version":3},"attestation_state":"computed","paper":{"title":"The Undecidability of the Definability of Principal Subcongruences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Matthew Moore","submitted_at":"2013-01-22T13:33:53Z","abstract_excerpt":"For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is undecidable for a finite algebra. A consequence of this is that there is no algorithm that takes as input a finite algebra a decides whether that algebra is finitely based."},"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":"1301.5588","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-01-22T13:33:53Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a220899cb8784430ce389e9fb0c742f308a824550cc58f0f93f4ca195a07e7a8","abstract_canon_sha256":"1c42271b7dd6fab5c739843783a0710ff66b973c53c6a22b73f73d2c045ca86f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:05.051606Z","signature_b64":"25Dahsq/yK1/uUCZ9rNMEWue/shI0K+ILPq7YfbHmupLP2E7lSx+68+WHeksxyMgdwEx12y8u3qD0YUDJeeZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a137c547d90d613319507c4c491b725d28ace8432de42b1afe409639e8cc8b5","last_reissued_at":"2026-05-17T23:44:05.051123Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:05.051123Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Undecidability of the Definability of Principal Subcongruences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Matthew Moore","submitted_at":"2013-01-22T13:33:53Z","abstract_excerpt":"For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is undecidable for a finite algebra. A consequence of this is that there is no algorithm that takes as input a finite algebra a decides whether that algebra is finitely based."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5588","kind":"arxiv","version":3},"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":"1301.5588","created_at":"2026-05-17T23:44:05.051195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5588v3","created_at":"2026-05-17T23:44:05.051195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5588","created_at":"2026-05-17T23:44:05.051195+00:00"},{"alias_kind":"pith_short_12","alias_value":"TIJXYVD5SDLB","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_16","alias_value":"TIJXYVD5SDLBGMMV","created_at":"2026-05-18T12:28:02.375192+00:00"},{"alias_kind":"pith_short_8","alias_value":"TIJXYVD5","created_at":"2026-05-18T12:28:02.375192+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/TIJXYVD5SDLBGMMVA7CMJENXEX","json":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX.json","graph_json":"https://pith.science/api/pith-number/TIJXYVD5SDLBGMMVA7CMJENXEX/graph.json","events_json":"https://pith.science/api/pith-number/TIJXYVD5SDLBGMMVA7CMJENXEX/events.json","paper":"https://pith.science/paper/TIJXYVD5"},"agent_actions":{"view_html":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX","download_json":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX.json","view_paper":"https://pith.science/paper/TIJXYVD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5588&json=true","fetch_graph":"https://pith.science/api/pith-number/TIJXYVD5SDLBGMMVA7CMJENXEX/graph.json","fetch_events":"https://pith.science/api/pith-number/TIJXYVD5SDLBGMMVA7CMJENXEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX/action/storage_attestation","attest_author":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX/action/author_attestation","sign_citation":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX/action/citation_signature","submit_replication":"https://pith.science/pith/TIJXYVD5SDLBGMMVA7CMJENXEX/action/replication_record"}},"created_at":"2026-05-17T23:44:05.051195+00:00","updated_at":"2026-05-17T23:44:05.051195+00:00"}