{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:KE4X5XHREYYMDVTKQQCN2ZXQCU","short_pith_number":"pith:KE4X5XHR","schema_version":"1.0","canonical_sha256":"51397edcf12630c1d66a8404dd66f0151f6f32e8e95de27e10742e64908b73ca","source":{"kind":"arxiv","id":"1212.5161","version":1},"attestation_state":"computed","paper":{"title":"Smooth neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Brian Conrey, Mark Holmstrom, Tara McLaughlin","submitted_at":"2012-12-20T17:42:48Z","abstract_excerpt":"We give a new algorithm that quickly finds smooth neighbors."},"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":"1212.5161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-20T17:42:48Z","cross_cats_sorted":[],"title_canon_sha256":"235244c87055e205a66a15029bcc25096262a5351fed307367f0391da04b1afc","abstract_canon_sha256":"4e838c9e111fc1a8ae367559a8e014a156be5af5f6e46ec34e9e733b6e3ae14b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:05.346933Z","signature_b64":"gQYLslBZ7LCSpuhOmWzcJSViK/dxs4aVXh8GpK10GJPrNtBaZeX40/ZRcdApTGddfeMgU872PZ8pqgnvyVTpDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51397edcf12630c1d66a8404dd66f0151f6f32e8e95de27e10742e64908b73ca","last_reissued_at":"2026-05-18T02:25:05.346541Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:05.346541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Smooth neighbors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Brian Conrey, Mark Holmstrom, Tara McLaughlin","submitted_at":"2012-12-20T17:42:48Z","abstract_excerpt":"We give a new algorithm that quickly finds smooth neighbors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5161","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":"1212.5161","created_at":"2026-05-18T02:25:05.346606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5161v1","created_at":"2026-05-18T02:25:05.346606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5161","created_at":"2026-05-18T02:25:05.346606+00:00"},{"alias_kind":"pith_short_12","alias_value":"KE4X5XHREYYM","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_16","alias_value":"KE4X5XHREYYMDVTK","created_at":"2026-05-18T12:27:11.947152+00:00"},{"alias_kind":"pith_short_8","alias_value":"KE4X5XHR","created_at":"2026-05-18T12:27:11.947152+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.10321","citing_title":"Fast Ramanujan--type Series for Logarithms. Part II","ref_index":5,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU","json":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU.json","graph_json":"https://pith.science/api/pith-number/KE4X5XHREYYMDVTKQQCN2ZXQCU/graph.json","events_json":"https://pith.science/api/pith-number/KE4X5XHREYYMDVTKQQCN2ZXQCU/events.json","paper":"https://pith.science/paper/KE4X5XHR"},"agent_actions":{"view_html":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU","download_json":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU.json","view_paper":"https://pith.science/paper/KE4X5XHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5161&json=true","fetch_graph":"https://pith.science/api/pith-number/KE4X5XHREYYMDVTKQQCN2ZXQCU/graph.json","fetch_events":"https://pith.science/api/pith-number/KE4X5XHREYYMDVTKQQCN2ZXQCU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU/action/storage_attestation","attest_author":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU/action/author_attestation","sign_citation":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU/action/citation_signature","submit_replication":"https://pith.science/pith/KE4X5XHREYYMDVTKQQCN2ZXQCU/action/replication_record"}},"created_at":"2026-05-18T02:25:05.346606+00:00","updated_at":"2026-05-18T02:25:05.346606+00:00"}