{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:JADOHYKCILLH7L4KLK6CU7QDXM","short_pith_number":"pith:JADOHYKC","canonical_record":{"source":{"id":"2501.11156","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T20:01:04Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"77f4e6bcc2595afb92a45b1cc86e1c645deb25cb6775ffd79f20f684157f1131","abstract_canon_sha256":"79620f89bf0aa146ee53822a9381d1d9ca7920beb0477a87ead3fc724722f500"},"schema_version":"1.0"},"canonical_sha256":"4806e3e14242d67faf8a5abc2a7e03bb0e0681a422d88103a11e86ced64eb78b","source":{"kind":"arxiv","id":"2501.11156","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11156","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11156v3","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11156","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"JADOHYKCILLH","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"JADOHYKCILLH7L4K","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"JADOHYKC","created_at":"2026-06-12T01:09:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:JADOHYKCILLH7L4KLK6CU7QDXM","target":"record","payload":{"canonical_record":{"source":{"id":"2501.11156","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T20:01:04Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"77f4e6bcc2595afb92a45b1cc86e1c645deb25cb6775ffd79f20f684157f1131","abstract_canon_sha256":"79620f89bf0aa146ee53822a9381d1d9ca7920beb0477a87ead3fc724722f500"},"schema_version":"1.0"},"canonical_sha256":"4806e3e14242d67faf8a5abc2a7e03bb0e0681a422d88103a11e86ced64eb78b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:06.856701Z","signature_b64":"5HpY+E2VClNOInBw81WtXjE3XzEIrTA7QOmriq06xFz3kUYMIuu+gYjvijCDKiAX4wfUQZKhXnn7BQk+B2SvAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4806e3e14242d67faf8a5abc2a7e03bb0e0681a422d88103a11e86ced64eb78b","last_reissued_at":"2026-06-12T01:09:06.855683Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:06.855683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.11156","source_version":3,"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-06-12T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5AUiUMLTaxKpDZHW8YNIvkFwonnw7BgBoTJIg8a8fg9u307LjfJKPkbiOT8myuer8wPO+DYv3kGP1pZIZKMbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:47:21.053133Z"},"content_sha256":"2fae81be4e7ed88d57778182d81368eda20aef947a416e600a3b36e1925be30b","schema_version":"1.0","event_id":"sha256:2fae81be4e7ed88d57778182d81368eda20aef947a416e600a3b36e1925be30b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:JADOHYKCILLH7L4KLK6CU7QDXM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering half-grids with lines and planes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Shantanu Nene","submitted_at":"2025-01-19T20:01:04Z","abstract_excerpt":"We study hyperplane covering problems for finite grid-like structures in $\\mathbb{R}^d$. We call a set $\\mathcal{C}$ of points in $\\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\\mathcal{C}$ in exactly $i$ points, for some $a_1 > \\cdots > a_n \\in \\mathbb{R}$. We prove that the number of lines required to cover every point of such a grid at least $k$ times is at least $nk\\left(1-\\frac{1}{e}-O(\\frac{1}{n}) \\right)$. If the grid $\\mathcal{C}$ is obtained by cutting an $m \\times n$ grid of points in half along one of the diagonals, then we prove the lower bound of $mk\\left(1-e^{-\\f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11156","kind":"arxiv","version":3},"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/2501.11156/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-06-12T01:09:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qe0q/fT2SD6EeB/vuVm0zsS5txtZC+/u9ZVDs75V/0kyhZcRnCGD4r0auY1cB6JPwwqUymRckAQBTzo+MVKhDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T17:47:21.054124Z"},"content_sha256":"574a321c61496fa6223e8ce912f155afb1d2d92179b8891acba03e34f8b41e43","schema_version":"1.0","event_id":"sha256:574a321c61496fa6223e8ce912f155afb1d2d92179b8891acba03e34f8b41e43"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JADOHYKCILLH7L4KLK6CU7QDXM/bundle.json","state_url":"https://pith.science/pith/JADOHYKCILLH7L4KLK6CU7QDXM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JADOHYKCILLH7L4KLK6CU7QDXM/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-06T17:47:21Z","links":{"resolver":"https://pith.science/pith/JADOHYKCILLH7L4KLK6CU7QDXM","bundle":"https://pith.science/pith/JADOHYKCILLH7L4KLK6CU7QDXM/bundle.json","state":"https://pith.science/pith/JADOHYKCILLH7L4KLK6CU7QDXM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JADOHYKCILLH7L4KLK6CU7QDXM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:JADOHYKCILLH7L4KLK6CU7QDXM","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":"79620f89bf0aa146ee53822a9381d1d9ca7920beb0477a87ead3fc724722f500","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T20:01:04Z","title_canon_sha256":"77f4e6bcc2595afb92a45b1cc86e1c645deb25cb6775ffd79f20f684157f1131"},"schema_version":"1.0","source":{"id":"2501.11156","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.11156","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"arxiv_version","alias_value":"2501.11156v3","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11156","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_12","alias_value":"JADOHYKCILLH","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_16","alias_value":"JADOHYKCILLH7L4K","created_at":"2026-06-12T01:09:06Z"},{"alias_kind":"pith_short_8","alias_value":"JADOHYKC","created_at":"2026-06-12T01:09:06Z"}],"graph_snapshots":[{"event_id":"sha256:574a321c61496fa6223e8ce912f155afb1d2d92179b8891acba03e34f8b41e43","target":"graph","created_at":"2026-06-12T01:09:06Z","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/2501.11156/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study hyperplane covering problems for finite grid-like structures in $\\mathbb{R}^d$. We call a set $\\mathcal{C}$ of points in $\\mathbb{R}^2$ a conical grid if the line $y = a_i$ intersects $\\mathcal{C}$ in exactly $i$ points, for some $a_1 > \\cdots > a_n \\in \\mathbb{R}$. We prove that the number of lines required to cover every point of such a grid at least $k$ times is at least $nk\\left(1-\\frac{1}{e}-O(\\frac{1}{n}) \\right)$. If the grid $\\mathcal{C}$ is obtained by cutting an $m \\times n$ grid of points in half along one of the diagonals, then we prove the lower bound of $mk\\left(1-e^{-\\f","authors_text":"Anurag Bishnoi, Shantanu Nene","cross_cats":["cs.CG"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T20:01:04Z","title":"Covering half-grids with lines and planes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11156","kind":"arxiv","version":3},"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:2fae81be4e7ed88d57778182d81368eda20aef947a416e600a3b36e1925be30b","target":"record","created_at":"2026-06-12T01:09:06Z","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":"79620f89bf0aa146ee53822a9381d1d9ca7920beb0477a87ead3fc724722f500","cross_cats_sorted":["cs.CG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-19T20:01:04Z","title_canon_sha256":"77f4e6bcc2595afb92a45b1cc86e1c645deb25cb6775ffd79f20f684157f1131"},"schema_version":"1.0","source":{"id":"2501.11156","kind":"arxiv","version":3}},"canonical_sha256":"4806e3e14242d67faf8a5abc2a7e03bb0e0681a422d88103a11e86ced64eb78b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4806e3e14242d67faf8a5abc2a7e03bb0e0681a422d88103a11e86ced64eb78b","first_computed_at":"2026-06-12T01:09:06.855683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:06.855683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5HpY+E2VClNOInBw81WtXjE3XzEIrTA7QOmriq06xFz3kUYMIuu+gYjvijCDKiAX4wfUQZKhXnn7BQk+B2SvAA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:06.856701Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.11156","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2fae81be4e7ed88d57778182d81368eda20aef947a416e600a3b36e1925be30b","sha256:574a321c61496fa6223e8ce912f155afb1d2d92179b8891acba03e34f8b41e43"],"state_sha256":"cb6b78cf7f9e8e534f8c594f56f4fc46927d3049881c36d489d0c57207f930d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lwKD/a7fgPKlRQZa+dJjeWyMUi+r3raft7TZcK7PFSVGI86Q4o8djsMbFDJZXqD/SaSglIfI9f4/G4p7+f3gDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T17:47:21.061515Z","bundle_sha256":"cbbf58af90a24789315689a7cee482480bd2d8a2bd9d0c3d7094a5dd27630025"}}