{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZFNKOUPJD2VERTPJLF7VV7UUSZ","short_pith_number":"pith:ZFNKOUPJ","schema_version":"1.0","canonical_sha256":"c95aa751e91eaa48cde9597f5afe949642d6c5719ee6b2b5f5b55d34ef57b668","source":{"kind":"arxiv","id":"1705.08714","version":1},"attestation_state":"computed","paper":{"title":"On the error term of a lattice counting problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Florian Luca, Igor E. Shparlinski","submitted_at":"2017-05-24T11:57:42Z","abstract_excerpt":"We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums coupled with the use of Vaaler 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":"1705.08714","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-05-24T11:57:42Z","cross_cats_sorted":[],"title_canon_sha256":"164051b8258ab51a8dfca1012d22e7d08b3a4a994a85056c5db99ec17f2dd5c0","abstract_canon_sha256":"41b8bb2ad94445b17fedea7565803ed4b407a632515ece1c165b352951b41e8e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:44.461996Z","signature_b64":"2D48nv78atUxe40KU1J6qXNuPfDXMB9H2b1ajZUcqaFCUsrBfhOtjlCV/BnFDV20W/NIrLZhjHSYJXl1o3WfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c95aa751e91eaa48cde9597f5afe949642d6c5719ee6b2b5f5b55d34ef57b668","last_reissued_at":"2026-05-18T00:43:44.461266Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:44.461266Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the error term of a lattice counting problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Florian Luca, Igor E. Shparlinski","submitted_at":"2017-05-24T11:57:42Z","abstract_excerpt":"We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums coupled with the use of Vaaler polynomials."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08714","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":"1705.08714","created_at":"2026-05-18T00:43:44.461405+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08714v1","created_at":"2026-05-18T00:43:44.461405+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08714","created_at":"2026-05-18T00:43:44.461405+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZFNKOUPJD2VE","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZFNKOUPJD2VERTPJ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZFNKOUPJ","created_at":"2026-05-18T12:31:59.375834+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/ZFNKOUPJD2VERTPJLF7VV7UUSZ","json":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ.json","graph_json":"https://pith.science/api/pith-number/ZFNKOUPJD2VERTPJLF7VV7UUSZ/graph.json","events_json":"https://pith.science/api/pith-number/ZFNKOUPJD2VERTPJLF7VV7UUSZ/events.json","paper":"https://pith.science/paper/ZFNKOUPJ"},"agent_actions":{"view_html":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ","download_json":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ.json","view_paper":"https://pith.science/paper/ZFNKOUPJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08714&json=true","fetch_graph":"https://pith.science/api/pith-number/ZFNKOUPJD2VERTPJLF7VV7UUSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZFNKOUPJD2VERTPJLF7VV7UUSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ/action/storage_attestation","attest_author":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ/action/author_attestation","sign_citation":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ/action/citation_signature","submit_replication":"https://pith.science/pith/ZFNKOUPJD2VERTPJLF7VV7UUSZ/action/replication_record"}},"created_at":"2026-05-18T00:43:44.461405+00:00","updated_at":"2026-05-18T00:43:44.461405+00:00"}