{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HBQIXYR3Q5DZKMUUCHDVA4EKXU","short_pith_number":"pith:HBQIXYR3","schema_version":"1.0","canonical_sha256":"38608be23b874795329411c750708abd375b8d6101effafb627e1418fe8bc6d0","source":{"kind":"arxiv","id":"1606.06913","version":1},"attestation_state":"computed","paper":{"title":"Towards Strong Reverse Minkowski-type Inequalities for Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.FA","math.PR"],"primary_cat":"math.MG","authors_text":"Daniel Dadush, Oded Regev","submitted_at":"2016-06-22T11:50:09Z","abstract_excerpt":"We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits a surprising wealth of connections to various areas in mathematics and computer science, including a conjecture motivated by integer programming by Kannan and Lov\\'asz (Annals of Math. 1988), a question from additive combinatorics asked by Green, a question on Brownian motions asked by Saloff-Coste (Colloq. Math. 2010), a theorem by Milman and Pisier from co"},"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":"1606.06913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2016-06-22T11:50:09Z","cross_cats_sorted":["cs.CC","math.FA","math.PR"],"title_canon_sha256":"f35287f221bc084f063c556771cd88699759e9853588da69ddc31c53c92a7123","abstract_canon_sha256":"36be07dd8b81763ecca770da73fd87360663bc183361f1f9f3f113dd763ec577"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:00.921359Z","signature_b64":"X7aiuqDPrxIpG7k4R/na279qkLxGClIyNdgqZkyxWwE3/ss3vHbn8ydVZ71OAZRrl2rtXGMD2eMkHMopSM6ZDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38608be23b874795329411c750708abd375b8d6101effafb627e1418fe8bc6d0","last_reissued_at":"2026-05-18T01:12:00.920993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:00.920993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Strong Reverse Minkowski-type Inequalities for Lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.FA","math.PR"],"primary_cat":"math.MG","authors_text":"Daniel Dadush, Oded Regev","submitted_at":"2016-06-22T11:50:09Z","abstract_excerpt":"We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits a surprising wealth of connections to various areas in mathematics and computer science, including a conjecture motivated by integer programming by Kannan and Lov\\'asz (Annals of Math. 1988), a question from additive combinatorics asked by Green, a question on Brownian motions asked by Saloff-Coste (Colloq. Math. 2010), a theorem by Milman and Pisier from co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.06913","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":"1606.06913","created_at":"2026-05-18T01:12:00.921065+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.06913v1","created_at":"2026-05-18T01:12:00.921065+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.06913","created_at":"2026-05-18T01:12:00.921065+00:00"},{"alias_kind":"pith_short_12","alias_value":"HBQIXYR3Q5DZ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HBQIXYR3Q5DZKMUU","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HBQIXYR3","created_at":"2026-05-18T12:30:19.053100+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/HBQIXYR3Q5DZKMUUCHDVA4EKXU","json":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU.json","graph_json":"https://pith.science/api/pith-number/HBQIXYR3Q5DZKMUUCHDVA4EKXU/graph.json","events_json":"https://pith.science/api/pith-number/HBQIXYR3Q5DZKMUUCHDVA4EKXU/events.json","paper":"https://pith.science/paper/HBQIXYR3"},"agent_actions":{"view_html":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU","download_json":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU.json","view_paper":"https://pith.science/paper/HBQIXYR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.06913&json=true","fetch_graph":"https://pith.science/api/pith-number/HBQIXYR3Q5DZKMUUCHDVA4EKXU/graph.json","fetch_events":"https://pith.science/api/pith-number/HBQIXYR3Q5DZKMUUCHDVA4EKXU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU/action/storage_attestation","attest_author":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU/action/author_attestation","sign_citation":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU/action/citation_signature","submit_replication":"https://pith.science/pith/HBQIXYR3Q5DZKMUUCHDVA4EKXU/action/replication_record"}},"created_at":"2026-05-18T01:12:00.921065+00:00","updated_at":"2026-05-18T01:12:00.921065+00:00"}