{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PMRF5ZMV37GJMOKNVXYVKQSVFK","short_pith_number":"pith:PMRF5ZMV","schema_version":"1.0","canonical_sha256":"7b225ee595dfcc96394dadf15542552aab58ec8ccfead338afdeafbec064e714","source":{"kind":"arxiv","id":"1706.04170","version":4},"attestation_state":"computed","paper":{"title":"Triangles capturing many lattice points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Nicholas F. Marshall, Stefan Steinerberger","submitted_at":"2017-06-13T17:13:58Z","abstract_excerpt":"We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$, $(x,0)$, and $(0,y)$ and fixed area, which one encloses the most lattice points from $\\mathbb{Z}_{>0}^2$? Moreover, does its shape necessarily converge to the isosceles triangle $(x=y)$ as the area becomes large? Laugesen and Liu suggested that, in contrast to similar problems, there might not be a limiting shape. We prove that the limiting set is indeed nontrivial and contains infinitely many elements. We also show that there exist `bad' areas where no triangle"},"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":"1706.04170","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-06-13T17:13:58Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"32bd4f7aef4d285ae2b8525572636519ad84bc6fb73685a3de4b3c1e49cb3d9d","abstract_canon_sha256":"342ef991ef2cb53b39b83cdbabc7b5f20c759a276b0dcf039be6a13490fb4a97"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:09.268396Z","signature_b64":"UIjbWA0Xdw3usm7BB5JxwwAdNtWlr0p5J3KseKf3nZ0S65ifygjR8YIPOID5p2cDDa1MWb6iGbVjqq8ByC1oAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b225ee595dfcc96394dadf15542552aab58ec8ccfead338afdeafbec064e714","last_reissued_at":"2026-05-18T00:17:09.267723Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:09.267723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangles capturing many lattice points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Nicholas F. Marshall, Stefan Steinerberger","submitted_at":"2017-06-13T17:13:58Z","abstract_excerpt":"We study a combinatorial problem that recently arose in the context of shape optimization: among all triangles with vertices $(0,0)$, $(x,0)$, and $(0,y)$ and fixed area, which one encloses the most lattice points from $\\mathbb{Z}_{>0}^2$? Moreover, does its shape necessarily converge to the isosceles triangle $(x=y)$ as the area becomes large? Laugesen and Liu suggested that, in contrast to similar problems, there might not be a limiting shape. We prove that the limiting set is indeed nontrivial and contains infinitely many elements. We also show that there exist `bad' areas where no triangle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04170","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":""},"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":"1706.04170","created_at":"2026-05-18T00:17:09.267844+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.04170v4","created_at":"2026-05-18T00:17:09.267844+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04170","created_at":"2026-05-18T00:17:09.267844+00:00"},{"alias_kind":"pith_short_12","alias_value":"PMRF5ZMV37GJ","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PMRF5ZMV37GJMOKN","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PMRF5ZMV","created_at":"2026-05-18T12:31:37.085036+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/PMRF5ZMV37GJMOKNVXYVKQSVFK","json":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK.json","graph_json":"https://pith.science/api/pith-number/PMRF5ZMV37GJMOKNVXYVKQSVFK/graph.json","events_json":"https://pith.science/api/pith-number/PMRF5ZMV37GJMOKNVXYVKQSVFK/events.json","paper":"https://pith.science/paper/PMRF5ZMV"},"agent_actions":{"view_html":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK","download_json":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK.json","view_paper":"https://pith.science/paper/PMRF5ZMV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.04170&json=true","fetch_graph":"https://pith.science/api/pith-number/PMRF5ZMV37GJMOKNVXYVKQSVFK/graph.json","fetch_events":"https://pith.science/api/pith-number/PMRF5ZMV37GJMOKNVXYVKQSVFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK/action/storage_attestation","attest_author":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK/action/author_attestation","sign_citation":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK/action/citation_signature","submit_replication":"https://pith.science/pith/PMRF5ZMV37GJMOKNVXYVKQSVFK/action/replication_record"}},"created_at":"2026-05-18T00:17:09.267844+00:00","updated_at":"2026-05-18T00:17:09.267844+00:00"}