{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:UCGVLWCMPUPQFTY7RSM4DYGZX3","short_pith_number":"pith:UCGVLWCM","schema_version":"1.0","canonical_sha256":"a08d55d84c7d1f02cf1f8c99c1e0d9bec6f9a3e5100f7e3f9042acd0d7fb09fa","source":{"kind":"arxiv","id":"1501.04313","version":1},"attestation_state":"computed","paper":{"title":"Thompson's group F is 1-counter graph automatic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.GR","authors_text":"Jennifer Taback, Murray Elder","submitted_at":"2015-01-18T15:12:59Z","abstract_excerpt":"It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group e"},"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":"1501.04313","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2015-01-18T15:12:59Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"86f7351df747f719b2e399013c830a3921364e7298691074ec75fc2e559a0d3c","abstract_canon_sha256":"24fb7785d5e27b3bbc19fe1fee579a3b19f28aef8e2483b0b865fd325f3ba69d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:03.226884Z","signature_b64":"BJfP+C7P8g9Yp3o3aopqPEKYZHM8DCWPTt9W+/v6mD8tw7tXefT3Y4UVGGgksvsY7gqFoCvvBgvEc3beniR8BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a08d55d84c7d1f02cf1f8c99c1e0d9bec6f9a3e5100f7e3f9042acd0d7fb09fa","last_reissued_at":"2026-05-18T02:29:03.226311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:03.226311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Thompson's group F is 1-counter graph automatic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"math.GR","authors_text":"Jennifer Taback, Murray Elder","submitted_at":"2015-01-18T15:12:59Z","abstract_excerpt":"It is not known whether Thompson's group F is automatic. With the recent extensions of the notion of an automatic group to graph automatic by Kharlampovich, Khoussainov and Miasnikov and then to C-graph automatic by the authors, a compelling question is whether F is graph automatic or C-graph automatic for an appropriate language class C. The extended definitions allow the use of a symbol alphabet for the normal form language, replacing the dependence on generating set. In this paper we construct a 1-counter graph automatic structure for F based on the standard infinite normal form for group e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.04313","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":"1501.04313","created_at":"2026-05-18T02:29:03.226418+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.04313v1","created_at":"2026-05-18T02:29:03.226418+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.04313","created_at":"2026-05-18T02:29:03.226418+00:00"},{"alias_kind":"pith_short_12","alias_value":"UCGVLWCMPUPQ","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"UCGVLWCMPUPQFTY7","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"UCGVLWCM","created_at":"2026-05-18T12:29:44.643036+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/UCGVLWCMPUPQFTY7RSM4DYGZX3","json":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3.json","graph_json":"https://pith.science/api/pith-number/UCGVLWCMPUPQFTY7RSM4DYGZX3/graph.json","events_json":"https://pith.science/api/pith-number/UCGVLWCMPUPQFTY7RSM4DYGZX3/events.json","paper":"https://pith.science/paper/UCGVLWCM"},"agent_actions":{"view_html":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3","download_json":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3.json","view_paper":"https://pith.science/paper/UCGVLWCM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.04313&json=true","fetch_graph":"https://pith.science/api/pith-number/UCGVLWCMPUPQFTY7RSM4DYGZX3/graph.json","fetch_events":"https://pith.science/api/pith-number/UCGVLWCMPUPQFTY7RSM4DYGZX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3/action/storage_attestation","attest_author":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3/action/author_attestation","sign_citation":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3/action/citation_signature","submit_replication":"https://pith.science/pith/UCGVLWCMPUPQFTY7RSM4DYGZX3/action/replication_record"}},"created_at":"2026-05-18T02:29:03.226418+00:00","updated_at":"2026-05-18T02:29:03.226418+00:00"}