{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GK4QS5M6DXYQQOG6FP2MB6GQPA","short_pith_number":"pith:GK4QS5M6","schema_version":"1.0","canonical_sha256":"32b909759e1df10838de2bf4c0f8d07831ce84a560e829e99700e9f94b8dce2f","source":{"kind":"arxiv","id":"1708.07317","version":2},"attestation_state":"computed","paper":{"title":"On the error term of a lattice counting problem, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Olivier Bordell\\`es","submitted_at":"2017-08-24T08:59:49Z","abstract_excerpt":"Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of polynomials and a device due to Popov allowing us to get an improved main term in the sums of certain fractional parts of polynomials."},"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":"1708.07317","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-08-24T08:59:49Z","cross_cats_sorted":[],"title_canon_sha256":"cd59d121b87b6f5f7533500ec19495c0ed50526f8fdf45426096a80fda154926","abstract_canon_sha256":"7ca48416822a9fe5402d48aaecccc4ed3765db1b4b719697d51eae950b6a8ef2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:22.316036Z","signature_b64":"Kr/0lPY0RsMiC8C4IguWLFegyFMXXAOe70Uteyz/kjQ5ff+b5b2rn28HhUd0/qPezbm1e+oF6icOIwZWuDuuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32b909759e1df10838de2bf4c0f8d07831ce84a560e829e99700e9f94b8dce2f","last_reissued_at":"2026-05-18T00:34:22.315496Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:22.315496Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the error term of a lattice counting problem, II","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Olivier Bordell\\`es","submitted_at":"2017-08-24T08:59:49Z","abstract_excerpt":"Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of polynomials and a device due to Popov allowing us to get an improved main term in the sums of certain fractional parts of polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07317","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1708.07317","created_at":"2026-05-18T00:34:22.315591+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07317v2","created_at":"2026-05-18T00:34:22.315591+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07317","created_at":"2026-05-18T00:34:22.315591+00:00"},{"alias_kind":"pith_short_12","alias_value":"GK4QS5M6DXYQ","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GK4QS5M6DXYQQOG6","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GK4QS5M6","created_at":"2026-05-18T12:31:18.294218+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/GK4QS5M6DXYQQOG6FP2MB6GQPA","json":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA.json","graph_json":"https://pith.science/api/pith-number/GK4QS5M6DXYQQOG6FP2MB6GQPA/graph.json","events_json":"https://pith.science/api/pith-number/GK4QS5M6DXYQQOG6FP2MB6GQPA/events.json","paper":"https://pith.science/paper/GK4QS5M6"},"agent_actions":{"view_html":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA","download_json":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA.json","view_paper":"https://pith.science/paper/GK4QS5M6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07317&json=true","fetch_graph":"https://pith.science/api/pith-number/GK4QS5M6DXYQQOG6FP2MB6GQPA/graph.json","fetch_events":"https://pith.science/api/pith-number/GK4QS5M6DXYQQOG6FP2MB6GQPA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA/action/storage_attestation","attest_author":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA/action/author_attestation","sign_citation":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA/action/citation_signature","submit_replication":"https://pith.science/pith/GK4QS5M6DXYQQOG6FP2MB6GQPA/action/replication_record"}},"created_at":"2026-05-18T00:34:22.315591+00:00","updated_at":"2026-05-18T00:34:22.315591+00:00"}