{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BU6D77JFL6SCE73275VYHVPVYZ","short_pith_number":"pith:BU6D77JF","schema_version":"1.0","canonical_sha256":"0d3c3ffd255fa4227f7aff6b83d5f5c66cacad27a98a64c8444ff6dcd1fdac81","source":{"kind":"arxiv","id":"1303.0214","version":1},"attestation_state":"computed","paper":{"title":"Unary FA-presentable binary relations: transitivity and classification results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan J. Cain, Nik Ru\\v{s}kuc","submitted_at":"2013-03-01T16:37:05Z","abstract_excerpt":"Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. A particular focus of research has been the classification of those structures of some species that admit FA-presentations. Whilst some successes have been obtained, this appears to be a difficult problem in general. A restricted problem, also of significant interest, is to ask this question for unary FA-presentations: that is, FA-presentations over a one-letter alphabet. This paper studies unary FA-present"},"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":"1303.0214","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-03-01T16:37:05Z","cross_cats_sorted":[],"title_canon_sha256":"d046094b6b72c973286b968294b105c24782b7f037e25678c3f73f3640fd7588","abstract_canon_sha256":"8edc6c03ce75d154646f287f4e42853e1a2f3ccc25a529d39fc4cf6b98523a91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:06.550654Z","signature_b64":"JjEMaF/1LRUY0NYocwOiQdzaz2c4bGjNFdRz6KbXe8C3S5zFpqMJzdMCdlv1DxEu2MVJIqho1DCcmwir0cefDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d3c3ffd255fa4227f7aff6b83d5f5c66cacad27a98a64c8444ff6dcd1fdac81","last_reissued_at":"2026-05-18T03:32:06.550057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:06.550057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unary FA-presentable binary relations: transitivity and classification results","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alan J. Cain, Nik Ru\\v{s}kuc","submitted_at":"2013-03-01T16:37:05Z","abstract_excerpt":"Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. A particular focus of research has been the classification of those structures of some species that admit FA-presentations. Whilst some successes have been obtained, this appears to be a difficult problem in general. A restricted problem, also of significant interest, is to ask this question for unary FA-presentations: that is, FA-presentations over a one-letter alphabet. This paper studies unary FA-present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0214","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":"1303.0214","created_at":"2026-05-18T03:32:06.550135+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.0214v1","created_at":"2026-05-18T03:32:06.550135+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0214","created_at":"2026-05-18T03:32:06.550135+00:00"},{"alias_kind":"pith_short_12","alias_value":"BU6D77JFL6SC","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BU6D77JFL6SCE732","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BU6D77JF","created_at":"2026-05-18T12:27:40.988391+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/BU6D77JFL6SCE73275VYHVPVYZ","json":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ.json","graph_json":"https://pith.science/api/pith-number/BU6D77JFL6SCE73275VYHVPVYZ/graph.json","events_json":"https://pith.science/api/pith-number/BU6D77JFL6SCE73275VYHVPVYZ/events.json","paper":"https://pith.science/paper/BU6D77JF"},"agent_actions":{"view_html":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ","download_json":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ.json","view_paper":"https://pith.science/paper/BU6D77JF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.0214&json=true","fetch_graph":"https://pith.science/api/pith-number/BU6D77JFL6SCE73275VYHVPVYZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BU6D77JFL6SCE73275VYHVPVYZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ/action/storage_attestation","attest_author":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ/action/author_attestation","sign_citation":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ/action/citation_signature","submit_replication":"https://pith.science/pith/BU6D77JFL6SCE73275VYHVPVYZ/action/replication_record"}},"created_at":"2026-05-18T03:32:06.550135+00:00","updated_at":"2026-05-18T03:32:06.550135+00:00"}