{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ORYLVN65IAMUWD6KJNEMEHTEGX","short_pith_number":"pith:ORYLVN65","schema_version":"1.0","canonical_sha256":"7470bab7dd40194b0fca4b48c21e6435c80c1ea15306ee8a53af44d65061bdf5","source":{"kind":"arxiv","id":"1710.10109","version":4},"attestation_state":"computed","paper":{"title":"The word and order problems for self-similar and automata groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.GR","authors_text":"Ivan Mitrofanov, Laurent Bartholdi","submitted_at":"2017-10-27T12:51:10Z","abstract_excerpt":"We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting."},"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":"1710.10109","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2017-10-27T12:51:10Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"eb5986f8cc4c689d39127764150252018679ed15524c1e99b20b4a153403b8c6","abstract_canon_sha256":"d0c58cba5189e5f2f52f387aa8e2233d92a9abceaea7e94c4d15f6dc58b11c25"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:36.561303Z","signature_b64":"S8Pe1LDnWI+t6L4JXfzIgVBM4cnibIni5tZZigVE/QP0qkvJtnZy4SjvsKDrvMdo0enF5VwGofbkSbKQNjX3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7470bab7dd40194b0fca4b48c21e6435c80c1ea15306ee8a53af44d65061bdf5","last_reissued_at":"2026-05-18T00:29:36.560661Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:36.560661Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The word and order problems for self-similar and automata groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.GR","authors_text":"Ivan Mitrofanov, Laurent Bartholdi","submitted_at":"2017-10-27T12:51:10Z","abstract_excerpt":"We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10109","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":"1710.10109","created_at":"2026-05-18T00:29:36.560758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10109v4","created_at":"2026-05-18T00:29:36.560758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10109","created_at":"2026-05-18T00:29:36.560758+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORYLVN65IAMU","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORYLVN65IAMUWD6K","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORYLVN65","created_at":"2026-05-18T12:31:34.259226+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/ORYLVN65IAMUWD6KJNEMEHTEGX","json":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX.json","graph_json":"https://pith.science/api/pith-number/ORYLVN65IAMUWD6KJNEMEHTEGX/graph.json","events_json":"https://pith.science/api/pith-number/ORYLVN65IAMUWD6KJNEMEHTEGX/events.json","paper":"https://pith.science/paper/ORYLVN65"},"agent_actions":{"view_html":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX","download_json":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX.json","view_paper":"https://pith.science/paper/ORYLVN65","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10109&json=true","fetch_graph":"https://pith.science/api/pith-number/ORYLVN65IAMUWD6KJNEMEHTEGX/graph.json","fetch_events":"https://pith.science/api/pith-number/ORYLVN65IAMUWD6KJNEMEHTEGX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX/action/storage_attestation","attest_author":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX/action/author_attestation","sign_citation":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX/action/citation_signature","submit_replication":"https://pith.science/pith/ORYLVN65IAMUWD6KJNEMEHTEGX/action/replication_record"}},"created_at":"2026-05-18T00:29:36.560758+00:00","updated_at":"2026-05-18T00:29:36.560758+00:00"}