{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MGEM7JXBRTCPBAINKRLU2OZT2G","short_pith_number":"pith:MGEM7JXB","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"},"canonical_sha256":"6188cfa6e18cc4f0810d54574d3b33d19884442cff7f723ac9ae799afccaca43","source":{"kind":"arxiv","id":"1412.2310","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2310","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2310v1","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2310","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"MGEM7JXBRTCP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MGEM7JXBRTCPBAIN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MGEM7JXB","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MGEM7JXBRTCPBAINKRLU2OZT2G","target":"record","payload":{"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"},"canonical_sha256":"6188cfa6e18cc4f0810d54574d3b33d19884442cff7f723ac9ae799afccaca43","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"},"source_kind":"arxiv","source_id":"1412.2310","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aykfHFyLAOZhUjKPCTv28eR8Xc9YuyBTO2diZe3mUiSX7dvlC5jJ390Ok+xioO3O5EWuDmcAbi7fsjXvAq+pAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:30:51.944703Z"},"content_sha256":"02644602821f7dcd95c20ffd92bfb4ec6544f8200b28e843706fcf2b28c69af3","schema_version":"1.0","event_id":"sha256:02644602821f7dcd95c20ffd92bfb4ec6544f8200b28e843706fcf2b28c69af3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MGEM7JXBRTCPBAINKRLU2OZT2G","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:31:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wHuCnCk6rMXNRYuWOAX65RKlYRLJRu9TIwL6OzxwGffPH66OfBMBnKbTVjjxScD/HBmYiG8NTFNQAi3iteY1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:30:51.945050Z"},"content_sha256":"455335c27b746ab6b8cba855d44be01b25672b6f9eac1f222fc08285ae8155f8","schema_version":"1.0","event_id":"sha256:455335c27b746ab6b8cba855d44be01b25672b6f9eac1f222fc08285ae8155f8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/bundle.json","state_url":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-25T20:30:51Z","links":{"resolver":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G","bundle":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/bundle.json","state":"https://pith.science/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MGEM7JXBRTCPBAINKRLU2OZT2G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MGEM7JXBRTCPBAINKRLU2OZT2G","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fa067bde9e85f3a495b813ec850c8d1129729cb712283a63c9a7c99bda97b553","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-07T03:20:31Z","title_canon_sha256":"9ddb1c64091bd2fba2e8fb7e26d72cbf28bdd2a08bbaa856e9934bf79838a167"},"schema_version":"1.0","source":{"id":"1412.2310","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.2310","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"arxiv_version","alias_value":"1412.2310v1","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.2310","created_at":"2026-05-18T02:31:58Z"},{"alias_kind":"pith_short_12","alias_value":"MGEM7JXBRTCP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MGEM7JXBRTCPBAIN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MGEM7JXB","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:455335c27b746ab6b8cba855d44be01b25672b6f9eac1f222fc08285ae8155f8","target":"graph","created_at":"2026-05-18T02:31:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Siddharth Prasad","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-07T03:20:31Z","title":"Walks on Primes in Imaginary Quadratic Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.2310","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:02644602821f7dcd95c20ffd92bfb4ec6544f8200b28e843706fcf2b28c69af3","target":"record","created_at":"2026-05-18T02:31:58Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fa067bde9e85f3a495b813ec850c8d1129729cb712283a63c9a7c99bda97b553","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-12-07T03:20:31Z","title_canon_sha256":"9ddb1c64091bd2fba2e8fb7e26d72cbf28bdd2a08bbaa856e9934bf79838a167"},"schema_version":"1.0","source":{"id":"1412.2310","kind":"arxiv","version":1}},"canonical_sha256":"6188cfa6e18cc4f0810d54574d3b33d19884442cff7f723ac9ae799afccaca43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6188cfa6e18cc4f0810d54574d3b33d19884442cff7f723ac9ae799afccaca43","first_computed_at":"2026-05-18T02:31:58.375880Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:58.375880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QqLFhA0eM4+kKR1hpBwdvyOHXIOoKAIlR1NRSUnlfDbWiLk7o+fH7wMIhO6/ETW7cSxaotT5/Mrn93Tcmf/PBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:58.376422Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.2310","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02644602821f7dcd95c20ffd92bfb4ec6544f8200b28e843706fcf2b28c69af3","sha256:455335c27b746ab6b8cba855d44be01b25672b6f9eac1f222fc08285ae8155f8"],"state_sha256":"8c340ecc2a103044f04a7599266bd2525d22cf2554daffade6cabe815957c0a6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3DkV7vsTGT87QFOI0L6RsWQ8bpqQ5sKUy9gOlDjsXE9j4Wkd3LFFLI3eLRbuLYZGIDa//rkQ/PDBSE2Sg790Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:30:51.946957Z","bundle_sha256":"d973e39f4a9777eedbb56ae1d18c9e58389a9e6aad014bbc430bf6ed7b61d579"}}