{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:HXTV7UKL7QY5ZSBB3TILYMHOOK","short_pith_number":"pith:HXTV7UKL","schema_version":"1.0","canonical_sha256":"3de75fd14bfc31dcc821dcd0bc30ee728fb98fd2216b49373ef00ca345498ff3","source":{"kind":"arxiv","id":"1707.00682","version":4},"attestation_state":"computed","paper":{"title":"Stretching convex domains to capture many lattice points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.MG","authors_text":"Nicholas F. Marshall","submitted_at":"2017-07-01T21:42:43Z","abstract_excerpt":"We consider an optimal stretching problem for strictly convex domains in $\\mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant $1$. Specifically, we prove that the stretched convex domain which captures the most positive lattice points in the large volume limit is balanced: the $(d-1)$-dimensional measures of the intersections of the domain with each coordinate hyperplane are equal. Our results extend those of Antunes & Freitas, van den Berg, Bucur & Gittins, Ariturk & Laugesen, van den Berg &"},"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":"1707.00682","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2017-07-01T21:42:43Z","cross_cats_sorted":["math.SP"],"title_canon_sha256":"673c6e462df62b651385b730a987667b2502b49828d8f3af70b500c6a465e08d","abstract_canon_sha256":"973f315f6e9625941c0fbd20487f94eca291ccfd6d7e951887a33deea3d265e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:01:28.672446Z","signature_b64":"2p5p5tQy+wX3w6PGZOWyQBsBzUDCCQXZxWAZHjHdd6fCqaOoEBQbNqk5Kr0iaTUuLMdQlTveHnAM3bUv5kp8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3de75fd14bfc31dcc821dcd0bc30ee728fb98fd2216b49373ef00ca345498ff3","last_reissued_at":"2026-07-05T04:01:28.671971Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:01:28.671971Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stretching convex domains to capture many lattice points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.SP"],"primary_cat":"math.MG","authors_text":"Nicholas F. Marshall","submitted_at":"2017-07-01T21:42:43Z","abstract_excerpt":"We consider an optimal stretching problem for strictly convex domains in $\\mathbb{R}^d$ that are symmetric with respect to each coordinate hyperplane, where stretching refers to transformation by a diagonal matrix of determinant $1$. Specifically, we prove that the stretched convex domain which captures the most positive lattice points in the large volume limit is balanced: the $(d-1)$-dimensional measures of the intersections of the domain with each coordinate hyperplane are equal. Our results extend those of Antunes & Freitas, van den Berg, Bucur & Gittins, Ariturk & Laugesen, van den Berg &"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.00682","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1707.00682/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1707.00682","created_at":"2026-07-05T04:01:28.672028+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.00682v4","created_at":"2026-07-05T04:01:28.672028+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.00682","created_at":"2026-07-05T04:01:28.672028+00:00"},{"alias_kind":"pith_short_12","alias_value":"HXTV7UKL7QY5","created_at":"2026-07-05T04:01:28.672028+00:00"},{"alias_kind":"pith_short_16","alias_value":"HXTV7UKL7QY5ZSBB","created_at":"2026-07-05T04:01:28.672028+00:00"},{"alias_kind":"pith_short_8","alias_value":"HXTV7UKL","created_at":"2026-07-05T04:01:28.672028+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.08441","citing_title":"Optimal unions of scaled copies of domains and P\\'olya's conjecture","ref_index":27,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK","json":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK.json","graph_json":"https://pith.science/api/pith-number/HXTV7UKL7QY5ZSBB3TILYMHOOK/graph.json","events_json":"https://pith.science/api/pith-number/HXTV7UKL7QY5ZSBB3TILYMHOOK/events.json","paper":"https://pith.science/paper/HXTV7UKL"},"agent_actions":{"view_html":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK","download_json":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK.json","view_paper":"https://pith.science/paper/HXTV7UKL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.00682&json=true","fetch_graph":"https://pith.science/api/pith-number/HXTV7UKL7QY5ZSBB3TILYMHOOK/graph.json","fetch_events":"https://pith.science/api/pith-number/HXTV7UKL7QY5ZSBB3TILYMHOOK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK/action/storage_attestation","attest_author":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK/action/author_attestation","sign_citation":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK/action/citation_signature","submit_replication":"https://pith.science/pith/HXTV7UKL7QY5ZSBB3TILYMHOOK/action/replication_record"}},"created_at":"2026-07-05T04:01:28.672028+00:00","updated_at":"2026-07-05T04:01:28.672028+00:00"}