{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2004:GMCZXTML6AJLX4IZ52IOXSXI53","short_pith_number":"pith:GMCZXTML","schema_version":"1.0","canonical_sha256":"33059bcd8bf012bbf119ee90ebcae8eef7068d97e4ea8a91cdf38777d15f08ec","source":{"kind":"arxiv","id":"math/0406505","version":1},"attestation_state":"computed","paper":{"title":"The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Wesley Calvert","submitted_at":"2004-06-24T19:09:54Z","abstract_excerpt":"Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out a sequence of examples.\n  We follow recent work by Goncharov and Knight in using the degree of the isomorphism problem for a class to distinguish classifiable classes from non-classifiable. In this paper, we calculate the degree of the isomorphism pro"},"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":"math/0406505","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"2004-06-24T19:09:54Z","cross_cats_sorted":[],"title_canon_sha256":"2becdc78c86c9254bdfc9cb35851dff460015e8934edc6acc2646751af426af8","abstract_canon_sha256":"70166028eae10023baa9ef838b597d45c182319276f80a8256012379ece20b55"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:26.261917Z","signature_b64":"KGGMY53xj6sgrhrPmPepxlqu7+M75VGkLuTHUeq7kIdJQOtyiWD2NVMZF6//aUTA8Xu+kNSbYlJtXWJJCxkaAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33059bcd8bf012bbf119ee90ebcae8eef7068d97e4ea8a91cdf38777d15f08ec","last_reissued_at":"2026-05-18T01:05:26.261305Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:26.261305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Isomorphism Problem for Computable Abelian p-Groups of Bounded Length","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Wesley Calvert","submitted_at":"2004-06-24T19:09:54Z","abstract_excerpt":"Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider only countable members. This paper explores such a notion for classes of computable structures by working out a sequence of examples.\n  We follow recent work by Goncharov and Knight in using the degree of the isomorphism problem for a class to distinguish classifiable classes from non-classifiable. In this paper, we calculate the degree of the isomorphism pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0406505","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":"math/0406505","created_at":"2026-05-18T01:05:26.261426+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0406505v1","created_at":"2026-05-18T01:05:26.261426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0406505","created_at":"2026-05-18T01:05:26.261426+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMCZXTML6AJL","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMCZXTML6AJLX4IZ","created_at":"2026-05-18T12:25:52.687210+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMCZXTML","created_at":"2026-05-18T12:25:52.687210+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/GMCZXTML6AJLX4IZ52IOXSXI53","json":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53.json","graph_json":"https://pith.science/api/pith-number/GMCZXTML6AJLX4IZ52IOXSXI53/graph.json","events_json":"https://pith.science/api/pith-number/GMCZXTML6AJLX4IZ52IOXSXI53/events.json","paper":"https://pith.science/paper/GMCZXTML"},"agent_actions":{"view_html":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53","download_json":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53.json","view_paper":"https://pith.science/paper/GMCZXTML","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0406505&json=true","fetch_graph":"https://pith.science/api/pith-number/GMCZXTML6AJLX4IZ52IOXSXI53/graph.json","fetch_events":"https://pith.science/api/pith-number/GMCZXTML6AJLX4IZ52IOXSXI53/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53/action/storage_attestation","attest_author":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53/action/author_attestation","sign_citation":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53/action/citation_signature","submit_replication":"https://pith.science/pith/GMCZXTML6AJLX4IZ52IOXSXI53/action/replication_record"}},"created_at":"2026-05-18T01:05:26.261426+00:00","updated_at":"2026-05-18T01:05:26.261426+00:00"}