{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:C2P5F526M22I5KNDNWNFWK4XMR","short_pith_number":"pith:C2P5F526","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"},"canonical_sha256":"169fd2f75e66b48ea9a36d9a5b2b976462e8854c0473ceb54f3eec10a8805d34","source":{"kind":"arxiv","id":"2307.13257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.13257","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"2307.13257v1","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13257","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"C2P5F526M22I","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"pith_short_16","alias_value":"C2P5F526M22I5KND","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"pith_short_8","alias_value":"C2P5F526","created_at":"2026-07-05T06:34:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:C2P5F526M22I5KNDNWNFWK4XMR","target":"record","payload":{"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"},"canonical_sha256":"169fd2f75e66b48ea9a36d9a5b2b976462e8854c0473ceb54f3eec10a8805d34","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"},"source_kind":"arxiv","source_id":"2307.13257","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZcl1UQMI7Ap4+XleQ1jWBpbWUpPykHxCMt+gnHZ7jiR0gCAEFjIPBWSa/8OmyJG3PkdUsz4XhXg1ox1NNKjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T01:10:57.224385Z"},"content_sha256":"4ce3a163935b7d635643af9e7ff0f154fafa6dd212dc1c4212e076be7ef92db9","schema_version":"1.0","event_id":"sha256:4ce3a163935b7d635643af9e7ff0f154fafa6dd212dc1c4212e076be7ef92db9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:C2P5F526M22I5KNDNWNFWK4XMR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:34:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FGQ3B14XBmB6Qb0I4jr7pDKYXvcLxh5cHWLnjhdR38Geeyjr2uTPoYiNSskpmhfrKZ5/5CFQBY5v09/8684CBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T01:10:57.225014Z"},"content_sha256":"43204902dba179d430c36cb050b2d356c860d401d5a3174f4337bb0e1a50f75a","schema_version":"1.0","event_id":"sha256:43204902dba179d430c36cb050b2d356c860d401d5a3174f4337bb0e1a50f75a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/bundle.json","state_url":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C2P5F526M22I5KNDNWNFWK4XMR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T01:10:57Z","links":{"resolver":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR","bundle":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/bundle.json","state":"https://pith.science/pith/C2P5F526M22I5KNDNWNFWK4XMR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C2P5F526M22I5KNDNWNFWK4XMR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:C2P5F526M22I5KNDNWNFWK4XMR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"584ad4f5a9bc9d1b29fcfa1dbd28a0d8ca54d67141f23950170ce5bf1abfd28f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-25T04:59:34Z","title_canon_sha256":"c452cc975bb8b1ce41aee3fe0e75cfb6214a0d59f22de6262b7512bc1e385339"},"schema_version":"1.0","source":{"id":"2307.13257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.13257","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"arxiv_version","alias_value":"2307.13257v1","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13257","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"pith_short_12","alias_value":"C2P5F526M22I","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"pith_short_16","alias_value":"C2P5F526M22I5KND","created_at":"2026-07-05T06:34:11Z"},{"alias_kind":"pith_short_8","alias_value":"C2P5F526","created_at":"2026-07-05T06:34:11Z"}],"graph_snapshots":[{"event_id":"sha256:43204902dba179d430c36cb050b2d356c860d401d5a3174f4337bb0e1a50f75a","target":"graph","created_at":"2026-07-05T06:34:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2307.13257/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Abdul Basit, Alexander Clifton, Paul Horn","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-25T04:59:34Z","title":"Covering triangular grids with multiplicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13257","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4ce3a163935b7d635643af9e7ff0f154fafa6dd212dc1c4212e076be7ef92db9","target":"record","created_at":"2026-07-05T06:34:11Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"584ad4f5a9bc9d1b29fcfa1dbd28a0d8ca54d67141f23950170ce5bf1abfd28f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-07-25T04:59:34Z","title_canon_sha256":"c452cc975bb8b1ce41aee3fe0e75cfb6214a0d59f22de6262b7512bc1e385339"},"schema_version":"1.0","source":{"id":"2307.13257","kind":"arxiv","version":1}},"canonical_sha256":"169fd2f75e66b48ea9a36d9a5b2b976462e8854c0473ceb54f3eec10a8805d34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"169fd2f75e66b48ea9a36d9a5b2b976462e8854c0473ceb54f3eec10a8805d34","first_computed_at":"2026-07-05T06:34:11.537807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:34:11.537807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l4dGhBSn+7ZFWFTsjglpvi073vrWlLMXWPKhgCBFscD/gr1IFnYLZfjHu2qAKmO4e6zKygjU/J7HYDoFiRqODA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:34:11.538227Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.13257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ce3a163935b7d635643af9e7ff0f154fafa6dd212dc1c4212e076be7ef92db9","sha256:43204902dba179d430c36cb050b2d356c860d401d5a3174f4337bb0e1a50f75a"],"state_sha256":"2c93d0bdb0966e5dcfd33e5a7f76d3bd43d0a017a32a2f69db9aa3877d6dbb3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wLEkiNpgA7ORRPqHJxLaN8arXrZnodkMGRPJQDQbZ/Zz4SwRmxWcLuxz0MXPGFgi6PJoRx40f5VudiXrkPxPBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T01:10:57.228919Z","bundle_sha256":"67dab9f4a2826a5f792846880f0cdc6ba61ed299a7988f3a16fcba249334b4b1"}}