{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7FDBN2QJED5Y2FAPKNLIWTJ3ON","short_pith_number":"pith:7FDBN2QJ","canonical_record":{"source":{"id":"1407.2626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-07-09T20:09:37Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"598dca080ca2c0c8c014f9da4f4d44d2d46cf060cb0ef6406e7a805ed9154375","abstract_canon_sha256":"d3ac17c35cff5ebc59b71cd5317015d30761560eade82dcf4dc41814c1d469c4"},"schema_version":"1.0"},"canonical_sha256":"f94616ea0920fb8d140f53568b4d3b73469b7a821716df0d4d1f3d58aa0f9526","source":{"kind":"arxiv","id":"1407.2626","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2626","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2626v2","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2626","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"7FDBN2QJED5Y","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FDBN2QJED5Y2FAP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FDBN2QJ","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7FDBN2QJED5Y2FAPKNLIWTJ3ON","target":"record","payload":{"canonical_record":{"source":{"id":"1407.2626","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-07-09T20:09:37Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"598dca080ca2c0c8c014f9da4f4d44d2d46cf060cb0ef6406e7a805ed9154375","abstract_canon_sha256":"d3ac17c35cff5ebc59b71cd5317015d30761560eade82dcf4dc41814c1d469c4"},"schema_version":"1.0"},"canonical_sha256":"f94616ea0920fb8d140f53568b4d3b73469b7a821716df0d4d1f3d58aa0f9526","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:25.045884Z","signature_b64":"/ophi3QCszQMBsxAaEbZ9baD6Lb2qpBRCZ6k1b2ynx8G6qDvb7zzrKroqgaFsoPD9ZO5OAvGuUKg5bWdXmIvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f94616ea0920fb8d140f53568b4d3b73469b7a821716df0d4d1f3d58aa0f9526","last_reissued_at":"2026-05-18T00:15:25.045135Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:25.045135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.2626","source_version":2,"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-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S3T6+9DJgBG6ILwgE7jBzEPlaXFDk5OE0QG2eqxZVKkFmqoNS3la1m2HR93zIJM8rwQULPbh8I5gxhKlWuxfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:04:52.121604Z"},"content_sha256":"e56665112e975da2f9f1f4686a9fecdfd58d082c6cfe81672dfeddf4e0cf1748","schema_version":"1.0","event_id":"sha256:e56665112e975da2f9f1f4686a9fecdfd58d082c6cfe81672dfeddf4e0cf1748"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7FDBN2QJED5Y2FAPKNLIWTJ3ON","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Primes in Computable UFDs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"math.LO","authors_text":"Damir D. Dzhafarov, Joseph R. Mileti","submitted_at":"2014-07-09T20:09:37Z","abstract_excerpt":"In many simple integral domains, such as $\\mathbb{Z}$ or $\\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact that such a naive approach does not immediately translate to integral domains like $\\mathbb{Z}[x]$ or the ring of integers in an algebraic number field, there still exist computational procedures that work to determine the prime elements in these cases. In contrast, we will show how to computably extend $\\mathbb{Z}$ in such a way that we can control the ordina"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2626","kind":"arxiv","version":2},"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-18T00:15:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qA9HMPL420jFPPTm8VeWHuNzFfngPP9EnsEeu8WmaZdLheRWJAouK5bc1MYoveA8qyx9/1a0C47j2FcWiIdVCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T12:04:52.122046Z"},"content_sha256":"2320012b8260b163c5842d48acc881c057deccb63b4e26f756d258abdd5d21b2","schema_version":"1.0","event_id":"sha256:2320012b8260b163c5842d48acc881c057deccb63b4e26f756d258abdd5d21b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7FDBN2QJED5Y2FAPKNLIWTJ3ON/bundle.json","state_url":"https://pith.science/pith/7FDBN2QJED5Y2FAPKNLIWTJ3ON/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7FDBN2QJED5Y2FAPKNLIWTJ3ON/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-05-28T12:04:52Z","links":{"resolver":"https://pith.science/pith/7FDBN2QJED5Y2FAPKNLIWTJ3ON","bundle":"https://pith.science/pith/7FDBN2QJED5Y2FAPKNLIWTJ3ON/bundle.json","state":"https://pith.science/pith/7FDBN2QJED5Y2FAPKNLIWTJ3ON/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7FDBN2QJED5Y2FAPKNLIWTJ3ON/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7FDBN2QJED5Y2FAPKNLIWTJ3ON","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":"d3ac17c35cff5ebc59b71cd5317015d30761560eade82dcf4dc41814c1d469c4","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-07-09T20:09:37Z","title_canon_sha256":"598dca080ca2c0c8c014f9da4f4d44d2d46cf060cb0ef6406e7a805ed9154375"},"schema_version":"1.0","source":{"id":"1407.2626","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.2626","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"arxiv_version","alias_value":"1407.2626v2","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.2626","created_at":"2026-05-18T00:15:25Z"},{"alias_kind":"pith_short_12","alias_value":"7FDBN2QJED5Y","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"7FDBN2QJED5Y2FAP","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"7FDBN2QJ","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:2320012b8260b163c5842d48acc881c057deccb63b4e26f756d258abdd5d21b2","target":"graph","created_at":"2026-05-18T00:15:25Z","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":"In many simple integral domains, such as $\\mathbb{Z}$ or $\\mathbb{Z}[i]$, there is a straightforward procedure to determine if an element is prime by simply reducing to a direct check of finitely many potential divisors. Despite the fact that such a naive approach does not immediately translate to integral domains like $\\mathbb{Z}[x]$ or the ring of integers in an algebraic number field, there still exist computational procedures that work to determine the prime elements in these cases. In contrast, we will show how to computably extend $\\mathbb{Z}$ in such a way that we can control the ordina","authors_text":"Damir D. Dzhafarov, Joseph R. Mileti","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-07-09T20:09:37Z","title":"The Complexity of Primes in Computable UFDs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.2626","kind":"arxiv","version":2},"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:e56665112e975da2f9f1f4686a9fecdfd58d082c6cfe81672dfeddf4e0cf1748","target":"record","created_at":"2026-05-18T00:15:25Z","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":"d3ac17c35cff5ebc59b71cd5317015d30761560eade82dcf4dc41814c1d469c4","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2014-07-09T20:09:37Z","title_canon_sha256":"598dca080ca2c0c8c014f9da4f4d44d2d46cf060cb0ef6406e7a805ed9154375"},"schema_version":"1.0","source":{"id":"1407.2626","kind":"arxiv","version":2}},"canonical_sha256":"f94616ea0920fb8d140f53568b4d3b73469b7a821716df0d4d1f3d58aa0f9526","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f94616ea0920fb8d140f53568b4d3b73469b7a821716df0d4d1f3d58aa0f9526","first_computed_at":"2026-05-18T00:15:25.045135Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:25.045135Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/ophi3QCszQMBsxAaEbZ9baD6Lb2qpBRCZ6k1b2ynx8G6qDvb7zzrKroqgaFsoPD9ZO5OAvGuUKg5bWdXmIvAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:25.045884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.2626","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e56665112e975da2f9f1f4686a9fecdfd58d082c6cfe81672dfeddf4e0cf1748","sha256:2320012b8260b163c5842d48acc881c057deccb63b4e26f756d258abdd5d21b2"],"state_sha256":"1abd76d2790e2e99e6d242ad8276818d0b7af404311e8b8f61d65283b62534b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdpvIm+yvq6b9qNwhXHSrpY8orvz/P6J4bx64PMIoDZGi8Dg/UNc1GwhyNQ6i/0hvK7F4yJs9nQKxCzla4D6Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T12:04:52.124808Z","bundle_sha256":"a2abbb37caf51191446a2133c27de83dbb39b37b13c6906ee8f0e41789e5c8a5"}}