{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KQIB2EJJFTLCRHQIFKDMFJML4L","short_pith_number":"pith:KQIB2EJJ","schema_version":"1.0","canonical_sha256":"54101d11292cd6289e082a86c2a58be2df0a6df6c27a3ef42ae9a7ca91d8f17f","source":{"kind":"arxiv","id":"1406.3523","version":4},"attestation_state":"computed","paper":{"title":"Algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.RA","authors_text":"Dandan Huang, Yingpu Deng","submitted_at":"2014-06-13T12:52:39Z","abstract_excerpt":"We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime or prime power. The main algorithm is based on basis representation of finite rings which is computed via Hermite and Smith normal forms."},"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":"1406.3523","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2014-06-13T12:52:39Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"f237ea73ecaa406a0a9341b9f027c478e160a12c0d6ff482dcb1dbae2659bd02","abstract_canon_sha256":"5289bf10ad7e77e436b278cf0f3e95767180eccb5de84dd3ab3732388b53b958"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:43.431120Z","signature_b64":"etZQFYARzEJolQIbzV2oNolG/buwAanPZscDbJV2q4Nkv/L/QfotzmK1S9EH+IFtyMdQ4RDi4aR7W6v5wYWuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54101d11292cd6289e082a86c2a58be2df0a6df6c27a3ef42ae9a7ca91d8f17f","last_reissued_at":"2026-05-18T00:47:43.430383Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:43.430383Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm for computing the factor ring of an ideal in Dedekind domain with finite rank","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"math.RA","authors_text":"Dandan Huang, Yingpu Deng","submitted_at":"2014-06-13T12:52:39Z","abstract_excerpt":"We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime or prime power. The main algorithm is based on basis representation of finite rings which is computed via Hermite and Smith normal forms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3523","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":"1406.3523","created_at":"2026-05-18T00:47:43.430500+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3523v4","created_at":"2026-05-18T00:47:43.430500+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3523","created_at":"2026-05-18T00:47:43.430500+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQIB2EJJFTLC","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQIB2EJJFTLCRHQI","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQIB2EJJ","created_at":"2026-05-18T12:28:35.611951+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/KQIB2EJJFTLCRHQIFKDMFJML4L","json":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L.json","graph_json":"https://pith.science/api/pith-number/KQIB2EJJFTLCRHQIFKDMFJML4L/graph.json","events_json":"https://pith.science/api/pith-number/KQIB2EJJFTLCRHQIFKDMFJML4L/events.json","paper":"https://pith.science/paper/KQIB2EJJ"},"agent_actions":{"view_html":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L","download_json":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L.json","view_paper":"https://pith.science/paper/KQIB2EJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3523&json=true","fetch_graph":"https://pith.science/api/pith-number/KQIB2EJJFTLCRHQIFKDMFJML4L/graph.json","fetch_events":"https://pith.science/api/pith-number/KQIB2EJJFTLCRHQIFKDMFJML4L/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L/action/storage_attestation","attest_author":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L/action/author_attestation","sign_citation":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L/action/citation_signature","submit_replication":"https://pith.science/pith/KQIB2EJJFTLCRHQIFKDMFJML4L/action/replication_record"}},"created_at":"2026-05-18T00:47:43.430500+00:00","updated_at":"2026-05-18T00:47:43.430500+00:00"}