{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MGEM7JXBRTCPBAINKRLU2OZT2G","short_pith_number":"pith:MGEM7JXB","schema_version":"1.0","canonical_sha256":"6188cfa6e18cc4f0810d54574d3b33d19884442cff7f723ac9ae799afccaca43","source":{"kind":"arxiv","id":"1412.2310","version":1},"attestation_state":"computed","paper":{"title":"Walks on Primes in Imaginary Quadratic Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Siddharth Prasad","submitted_at":"2014-12-07T03:20:31Z","abstract_excerpt":"We generalize the Gaussian moat problem to the finitely many imaginary quadratic fields exhibiting unique factorization in their integers. We map this problem to the Euclidean minimum spanning tree problem and use Delaunay triangulation and Kruskal's algorithm to find moats in these fields in $O(|\\mathbf{P}| \\log |\\mathbf{P}|)$ time, where $\\mathbf{P}$ denotes the set of primes we are searching through. Our algorithm uses symmetry and boundaries to correctly and efficiently identify all moats, in order of increasing length, along with the farthest prime reached for each moat, in an underlying "},"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":"1412.2310","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-07T03:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"9ddb1c64091bd2fba2e8fb7e26d72cbf28bdd2a08bbaa856e9934bf79838a167","abstract_canon_sha256":"fa067bde9e85f3a495b813ec850c8d1129729cb712283a63c9a7c99bda97b553"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:58.376422Z","signature_b64":"QqLFhA0eM4+kKR1hpBwdvyOHXIOoKAIlR1NRSUnlfDbWiLk7o+fH7wMIhO6/ETW7cSxaotT5/Mrn93Tcmf/PBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6188cfa6e18cc4f0810d54574d3b33d19884442cff7f723ac9ae799afccaca43","last_reissued_at":"2026-05-18T02:31:58.375880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:58.375880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Walks on Primes in Imaginary Quadratic Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Siddharth Prasad","submitted_at":"2014-12-07T03:20:31Z","abstract_excerpt":"We generalize the Gaussian moat problem to the finitely many imaginary quadratic fields exhibiting unique factorization in their integers. We map this problem to the Euclidean minimum spanning tree problem and use Delaunay triangulation and Kruskal's algorithm to find moats in these fields in $O(|\\mathbf{P}| \\log |\\mathbf{P}|)$ time, where $\\mathbf{P}$ denotes the set of primes we are searching through. Our algorithm uses symmetry and boundaries to correctly and efficiently identify all moats, in order of increasing length, along with the farthest prime reached for each moat, in an underlying "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2310","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":"1412.2310","created_at":"2026-05-18T02:31:58.375963+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.2310v1","created_at":"2026-05-18T02:31:58.375963+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2310","created_at":"2026-05-18T02:31:58.375963+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGEM7JXBRTCP","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGEM7JXBRTCPBAIN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGEM7JXB","created_at":"2026-05-18T12:28:38.356838+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/MGEM7JXBRTCPBAINKRLU2OZT2G","json":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G.json","graph_json":"https://pith.science/api/pith-number/MGEM7JXBRTCPBAINKRLU2OZT2G/graph.json","events_json":"https://pith.science/api/pith-number/MGEM7JXBRTCPBAINKRLU2OZT2G/events.json","paper":"https://pith.science/paper/MGEM7JXB"},"agent_actions":{"view_html":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G","download_json":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G.json","view_paper":"https://pith.science/paper/MGEM7JXB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.2310&json=true","fetch_graph":"https://pith.science/api/pith-number/MGEM7JXBRTCPBAINKRLU2OZT2G/graph.json","fetch_events":"https://pith.science/api/pith-number/MGEM7JXBRTCPBAINKRLU2OZT2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/action/storage_attestation","attest_author":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/action/author_attestation","sign_citation":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/action/citation_signature","submit_replication":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/action/replication_record"}},"created_at":"2026-05-18T02:31:58.375963+00:00","updated_at":"2026-05-18T02:31:58.375963+00:00"}