{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RPYVI4DJ7WYAMEQW6UQPLPJZJT","short_pith_number":"pith:RPYVI4DJ","schema_version":"1.0","canonical_sha256":"8bf1547069fdb0061216f520f5bd394cfb8fcc3ca79b0f57edf6d38ab96e7ef2","source":{"kind":"arxiv","id":"2604.13137","version":2},"attestation_state":"computed","paper":{"title":"$p$-adic Linear Regression for Random Sampling with Digitwise Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise.","cross_cats":["math.NT","math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"Tomoki Mihara","submitted_at":"2026-04-14T11:23:40Z","abstract_excerpt":"We propose a new probabilistic algorithm of $p$-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo $p$ linear regression."},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2604.13137","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2026-04-14T11:23:40Z","cross_cats_sorted":["math.NT","math.ST","stat.TH"],"title_canon_sha256":"cd35ec1597e48ac2a9819a24108e305d436a79ee83e8474d6fc7c8b5a0e3d8a2","abstract_canon_sha256":"7c3cc79ea29e4c3cc74e5b7dce010d5e193ce85fa9a6dbfd6b269bcdb0ba5a57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:37.943897Z","signature_b64":"0QwjwNQUH3g0aoCl7ViSaHOXkCStr+oivPnFfYxvbAZxAm699UjFPmhNwulANYxcAy2/W+0L8jnZ0BUgsKoXAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8bf1547069fdb0061216f520f5bd394cfb8fcc3ca79b0f57edf6d38ab96e7ef2","last_reissued_at":"2026-05-20T00:00:37.943361Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:37.943361Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$p$-adic Linear Regression for Random Sampling with Digitwise Noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise.","cross_cats":["math.NT","math.ST","stat.TH"],"primary_cat":"stat.CO","authors_text":"Tomoki Mihara","submitted_at":"2026-04-14T11:23:40Z","abstract_excerpt":"We propose a new probabilistic algorithm of $p$-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo $p$ linear regression."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We propose a new probabilistic algorithm of p-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo p linear regression.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That digitwise noise admits a natural probabilistic model within the p-adic metric that allows a regression algorithm to recover the underlying linear relation with non-trivial success probability.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Proposes a probabilistic algorithm for p-adic linear regression under digitwise noise, including a modulo p version.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"91487fde13de936ce62775a944d8c2509c9c80d3ad20f91f5169c0b685f9fde8"},"source":{"id":"2604.13137","kind":"arxiv","version":2},"verdict":{"id":"7a771aff-c5df-41f5-96bf-e300212ba519","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T17:50:15.747908Z","strongest_claim":"We propose a new probabilistic algorithm of p-adic linear regression for random sampling with digitwise noise. This includes a new probabilistic algorithm of modulo p linear regression.","one_line_summary":"Proposes a probabilistic algorithm for p-adic linear regression under digitwise noise, including a modulo p version.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That digitwise noise admits a natural probabilistic model within the p-adic metric that allows a regression algorithm to recover the underlying linear relation with non-trivial success probability.","pith_extraction_headline":"A new probabilistic algorithm recovers linear relations from random p-adic samples with digitwise noise."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.13137/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":22,"sample":[{"doi":"","year":1995,"title":"E.\\ Amaldi and V.\\ Kann, The complexity and approximability of finding maximum feasible subsystems of linear relations , Theoretical Computer Science, Volume 147, pp.\\ 181--210, 1995","work_id":"0a240fed-ede0-4cab-a826-1788b59d8f9f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"S.\\ Albeverio, A.\\ Khrennikov, and B.\\ Tirrozi, p -Adic Dynamical Systems and Neural Networks , Mathematical Models and Methods in Applied Sciences, Volume 09, Issue 09, pp.\\ 1417--1437, 1999","work_id":"da8dda7a-3641-4d8b-987e-c53fb82f0873","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1990,"title":"V.\\ G.\\ Berkovich, Spectral Theory and Analytic Geometry over non-\\ Fields , Mathematical Surveys and Monographs, Number 33, the American Mathematical Society, 1990","work_id":"df2acce9-2d9e-4e27-9e8e-7e9d2e7ace97","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":", F.\\ Bambozzi and T,\\ Mihara, Derived Analytic Geometry for -Valued Functions Part I: Topological Properties , Bulletin of the Iranian Mathematical Society, Volume 50, Issue 4, article number 58, 202","work_id":"19f9dc91-0cc5-4764-bcb8-3651cbedd8eb","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"G.\\ D.\\ Baker, S.\\ Mccallum, and D.\\ Pattinson, Linear Regression in p -adic Metric Spaces , p -Adic Numbers, Ultrametric Analysis and Applications, Volume 17, Issue 4, pp.\\ 333--347, 2025","work_id":"87715657-7f8e-475f-be4c-bceb9e062d18","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":22,"snapshot_sha256":"a6dc76b2a11f46837bdaa268fbde48e30ae1326613e737a2fbc217c0dd427b12","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"19a6fbd3a18e4f8ea893e3bb75fbf4fedc7e9a3c66782f145252352856820b62"},"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":"2604.13137","created_at":"2026-05-20T00:00:37.943463+00:00"},{"alias_kind":"arxiv_version","alias_value":"2604.13137v2","created_at":"2026-05-20T00:00:37.943463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.13137","created_at":"2026-05-20T00:00:37.943463+00:00"},{"alias_kind":"pith_short_12","alias_value":"RPYVI4DJ7WYA","created_at":"2026-05-20T00:00:37.943463+00:00"},{"alias_kind":"pith_short_16","alias_value":"RPYVI4DJ7WYAMEQW","created_at":"2026-05-20T00:00:37.943463+00:00"},{"alias_kind":"pith_short_8","alias_value":"RPYVI4DJ","created_at":"2026-05-20T00:00:37.943463+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.04374","citing_title":"$p$-adic Manifold Learning and Benchmark Tasks from Impartial Games","ref_index":21,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT","json":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT.json","graph_json":"https://pith.science/api/pith-number/RPYVI4DJ7WYAMEQW6UQPLPJZJT/graph.json","events_json":"https://pith.science/api/pith-number/RPYVI4DJ7WYAMEQW6UQPLPJZJT/events.json","paper":"https://pith.science/paper/RPYVI4DJ"},"agent_actions":{"view_html":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT","download_json":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT.json","view_paper":"https://pith.science/paper/RPYVI4DJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2604.13137&json=true","fetch_graph":"https://pith.science/api/pith-number/RPYVI4DJ7WYAMEQW6UQPLPJZJT/graph.json","fetch_events":"https://pith.science/api/pith-number/RPYVI4DJ7WYAMEQW6UQPLPJZJT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/action/storage_attestation","attest_author":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/action/author_attestation","sign_citation":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/action/citation_signature","submit_replication":"https://pith.science/pith/RPYVI4DJ7WYAMEQW6UQPLPJZJT/action/replication_record"}},"created_at":"2026-05-20T00:00:37.943463+00:00","updated_at":"2026-05-20T00:00:37.943463+00:00"}