{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:C2P5F526M22I5KNDNWNFWK4XMR","short_pith_number":"pith:C2P5F526","schema_version":"1.0","canonical_sha256":"169fd2f75e66b48ea9a36d9a5b2b976462e8854c0473ceb54f3eec10a8805d34","source":{"kind":"arxiv","id":"2307.13257","version":1},"attestation_state":"computed","paper":{"title":"Covering triangular grids with multiplicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdul Basit, Alexander Clifton, Paul Horn","submitted_at":"2023-07-25T04:59:34Z","abstract_excerpt":"Motivated by classical work of Alon and F\\\"uredi, we introduce and address the following problem: determine the minimum number of affine hyperplanes in $\\mathbb{R}^d$ needed to cover every point of the triangular grid $T_d(n) := \\{(x_1,\\dots,x_d)\\in\\mathbb{Z}_{\\ge 0}^d\\mid x_1+\\dots+x_d\\le n-1\\}$ at least $k$ times. For $d = 2$, we solve the problem exactly for $k \\leq 4$, and obtain a partial solution for $k > 4$. We also obtain an asymptotic formula (in $n$) for all $d \\geq k - 2$. The proofs rely on combinatorial arguments and linear programming."},"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":"2307.13257","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-25T04:59:34Z","cross_cats_sorted":[],"title_canon_sha256":"c452cc975bb8b1ce41aee3fe0e75cfb6214a0d59f22de6262b7512bc1e385339","abstract_canon_sha256":"584ad4f5a9bc9d1b29fcfa1dbd28a0d8ca54d67141f23950170ce5bf1abfd28f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:11.538227Z","signature_b64":"l4dGhBSn+7ZFWFTsjglpvi073vrWlLMXWPKhgCBFscD/gr1IFnYLZfjHu2qAKmO4e6zKygjU/J7HYDoFiRqODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"169fd2f75e66b48ea9a36d9a5b2b976462e8854c0473ceb54f3eec10a8805d34","last_reissued_at":"2026-07-05T06:34:11.537807Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:11.537807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering triangular grids with multiplicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abdul Basit, Alexander Clifton, Paul Horn","submitted_at":"2023-07-25T04:59:34Z","abstract_excerpt":"Motivated by classical work of Alon and F\\\"uredi, we introduce and address the following problem: determine the minimum number of affine hyperplanes in $\\mathbb{R}^d$ needed to cover every point of the triangular grid $T_d(n) := \\{(x_1,\\dots,x_d)\\in\\mathbb{Z}_{\\ge 0}^d\\mid x_1+\\dots+x_d\\le n-1\\}$ at least $k$ times. For $d = 2$, we solve the problem exactly for $k \\leq 4$, and obtain a partial solution for $k > 4$. We also obtain an asymptotic formula (in $n$) for all $d \\geq k - 2$. The proofs rely on combinatorial arguments and linear programming."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13257","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2307.13257/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":"2307.13257","created_at":"2026-07-05T06:34:11.537863+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13257v1","created_at":"2026-07-05T06:34:11.537863+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13257","created_at":"2026-07-05T06:34:11.537863+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2P5F526M22I","created_at":"2026-07-05T06:34:11.537863+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2P5F526M22I5KND","created_at":"2026-07-05T06:34:11.537863+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2P5F526","created_at":"2026-07-05T06:34:11.537863+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.11156","citing_title":"Covering half-grids with lines and planes","ref_index":4,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR","json":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR.json","graph_json":"https://pith.science/api/pith-number/C2P5F526M22I5KNDNWNFWK4XMR/graph.json","events_json":"https://pith.science/api/pith-number/C2P5F526M22I5KNDNWNFWK4XMR/events.json","paper":"https://pith.science/paper/C2P5F526"},"agent_actions":{"view_html":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR","download_json":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR.json","view_paper":"https://pith.science/paper/C2P5F526","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13257&json=true","fetch_graph":"https://pith.science/api/pith-number/C2P5F526M22I5KNDNWNFWK4XMR/graph.json","fetch_events":"https://pith.science/api/pith-number/C2P5F526M22I5KNDNWNFWK4XMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/action/storage_attestation","attest_author":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/action/author_attestation","sign_citation":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/action/citation_signature","submit_replication":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/action/replication_record"}},"created_at":"2026-07-05T06:34:11.537863+00:00","updated_at":"2026-07-05T06:34:11.537863+00:00"}