{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:G4AL4NMDPRVC55MYE2OJ7UXMGS","short_pith_number":"pith:G4AL4NMD","schema_version":"1.0","canonical_sha256":"3700be35837c6a2ef598269c9fd2ec34b7054b809c0a087cd02a3e6fbc43502e","source":{"kind":"arxiv","id":"1212.4800","version":1},"attestation_state":"computed","paper":{"title":"Random diophantine equations, I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J\\\"org Br\\\"udern, Rainer Dietmann","submitted_at":"2012-12-19T19:21:18Z","abstract_excerpt":"We consider additive diophantine equations of degree $k$ in $s$ variables and establish that whenever $s\\ge 3k+2$ then almost all such equations satisfy the Hasse principle. The equations that are soluble form a set of positive density, and among the soluble ones almost all equations admit a small solution. Our bound for the smallest solution is nearly best possible."},"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.4800","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-12-19T19:21:18Z","cross_cats_sorted":[],"title_canon_sha256":"06a0cbc030286588f3a90262b16bb257e691f8f5a39751b72fe5d78034c77a0f","abstract_canon_sha256":"da3e4fdb4010ffed32d0a22333c01f78c13731ce6ed977a34df1662bfd2b7209"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:05.341948Z","signature_b64":"zSpt53UJ/keWkBWQdH68Z93jIujyyg5s6pi5amKL/3O/LMXWlznlwWMLoIeWOuislQp6i1IlMRbFkHnoL6zIBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3700be35837c6a2ef598269c9fd2ec34b7054b809c0a087cd02a3e6fbc43502e","last_reissued_at":"2026-05-18T03:38:05.341423Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:05.341423Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random diophantine equations, I","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J\\\"org Br\\\"udern, Rainer Dietmann","submitted_at":"2012-12-19T19:21:18Z","abstract_excerpt":"We consider additive diophantine equations of degree $k$ in $s$ variables and establish that whenever $s\\ge 3k+2$ then almost all such equations satisfy the Hasse principle. The equations that are soluble form a set of positive density, and among the soluble ones almost all equations admit a small solution. Our bound for the smallest solution is nearly best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.4800","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.4800","created_at":"2026-05-18T03:38:05.341505+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.4800v1","created_at":"2026-05-18T03:38:05.341505+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.4800","created_at":"2026-05-18T03:38:05.341505+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4AL4NMDPRVC","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4AL4NMDPRVC55MY","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4AL4NMD","created_at":"2026-05-18T12:27:06.952714+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/G4AL4NMDPRVC55MYE2OJ7UXMGS","json":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS.json","graph_json":"https://pith.science/api/pith-number/G4AL4NMDPRVC55MYE2OJ7UXMGS/graph.json","events_json":"https://pith.science/api/pith-number/G4AL4NMDPRVC55MYE2OJ7UXMGS/events.json","paper":"https://pith.science/paper/G4AL4NMD"},"agent_actions":{"view_html":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS","download_json":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS.json","view_paper":"https://pith.science/paper/G4AL4NMD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.4800&json=true","fetch_graph":"https://pith.science/api/pith-number/G4AL4NMDPRVC55MYE2OJ7UXMGS/graph.json","fetch_events":"https://pith.science/api/pith-number/G4AL4NMDPRVC55MYE2OJ7UXMGS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS/action/storage_attestation","attest_author":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS/action/author_attestation","sign_citation":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS/action/citation_signature","submit_replication":"https://pith.science/pith/G4AL4NMDPRVC55MYE2OJ7UXMGS/action/replication_record"}},"created_at":"2026-05-18T03:38:05.341505+00:00","updated_at":"2026-05-18T03:38:05.341505+00:00"}