{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:UAEVNNVUOQQEOK7X6H6LYSYLEO","short_pith_number":"pith:UAEVNNVU","canonical_record":{"source":{"id":"2305.00825","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-01T13:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"325f3128b2c1d39233a484af3f46499ea914b62fe2020ade623152191ed2ca7b","abstract_canon_sha256":"69080c8b6bed64e3b572a1892bac5f7f0424c945290f36686a04981bc7a6d4cc"},"schema_version":"1.0"},"canonical_sha256":"a00956b6b47420472bf7f1fcbc4b0b23ba6cef89a460c8f88c5f407c5cb48300","source":{"kind":"arxiv","id":"2305.00825","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.00825","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"2305.00825v1","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00825","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"UAEVNNVUOQQE","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"pith_short_16","alias_value":"UAEVNNVUOQQEOK7X","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"pith_short_8","alias_value":"UAEVNNVU","created_at":"2026-07-05T06:05:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:UAEVNNVUOQQEOK7X6H6LYSYLEO","target":"record","payload":{"canonical_record":{"source":{"id":"2305.00825","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-01T13:51:32Z","cross_cats_sorted":[],"title_canon_sha256":"325f3128b2c1d39233a484af3f46499ea914b62fe2020ade623152191ed2ca7b","abstract_canon_sha256":"69080c8b6bed64e3b572a1892bac5f7f0424c945290f36686a04981bc7a6d4cc"},"schema_version":"1.0"},"canonical_sha256":"a00956b6b47420472bf7f1fcbc4b0b23ba6cef89a460c8f88c5f407c5cb48300","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:05:45.624286Z","signature_b64":"1cC1OZ5e2b6/yZ8ZdRaWC64qFd5InwKC4nwFDAWgREyuZaQsw3tE3t6B/J41BztGAKRphyjX+eoAly0/vAohDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a00956b6b47420472bf7f1fcbc4b0b23ba6cef89a460c8f88c5f407c5cb48300","last_reissued_at":"2026-07-05T06:05:45.623879Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:05:45.623879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.00825","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:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0iavu2W+lWdK+dmUSLvDFdUgkaRvO7tlvtrV8RtsmOqNgGTZAxfbfVuOyIOC5MypgwQz1iQLc9vNHX+e+PxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T01:33:10.716340Z"},"content_sha256":"301c408c562998d69f15a48970f484e9132bb0c9a8677eda8de0496702711092","schema_version":"1.0","event_id":"sha256:301c408c562998d69f15a48970f484e9132bb0c9a8677eda8de0496702711092"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:UAEVNNVUOQQEOK7X6H6LYSYLEO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering grids with multiplicity","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anurag Bishnoi, Shagnik Das, Simona Boyadzhiyska, Yvonne den Bakker","submitted_at":"2023-05-01T13:51:32Z","abstract_excerpt":"Given a finite grid in $\\mathbb{R}^2$, how many lines are needed to cover all but one point at least $k$ times? Problems of this nature have been studied for decades, with a general lower bound having been established by Ball and Serra. We solve this problem for various types of grids, in particular showing the tightness of the Ball--Serra bound when one side is much larger than the other. In other cases, we prove new lower bounds that improve upon Ball--Serra and provide an asymptotic answer for almost all grids. For the standard grid $\\{0,\\ldots,n-1\\} \\times \\{0,\\ldots,n-1\\}$, we prove nontr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00825","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/2305.00825/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:05:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z+a3kAYndovo+47jADjpPtN/T5wyme970L785QKSfX16+N2WxGDlboo9/OumvkQcGOT8T+6+f70vnfCB3Z0sBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T01:33:10.716867Z"},"content_sha256":"24b6058800ccc076e258e32f1553ddf82e9e28e9627152216f8fd6bf6f682e53","schema_version":"1.0","event_id":"sha256:24b6058800ccc076e258e32f1553ddf82e9e28e9627152216f8fd6bf6f682e53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UAEVNNVUOQQEOK7X6H6LYSYLEO/bundle.json","state_url":"https://pith.science/pith/UAEVNNVUOQQEOK7X6H6LYSYLEO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UAEVNNVUOQQEOK7X6H6LYSYLEO/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-15T01:33:10Z","links":{"resolver":"https://pith.science/pith/UAEVNNVUOQQEOK7X6H6LYSYLEO","bundle":"https://pith.science/pith/UAEVNNVUOQQEOK7X6H6LYSYLEO/bundle.json","state":"https://pith.science/pith/UAEVNNVUOQQEOK7X6H6LYSYLEO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UAEVNNVUOQQEOK7X6H6LYSYLEO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:UAEVNNVUOQQEOK7X6H6LYSYLEO","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":"69080c8b6bed64e3b572a1892bac5f7f0424c945290f36686a04981bc7a6d4cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-01T13:51:32Z","title_canon_sha256":"325f3128b2c1d39233a484af3f46499ea914b62fe2020ade623152191ed2ca7b"},"schema_version":"1.0","source":{"id":"2305.00825","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.00825","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"arxiv_version","alias_value":"2305.00825v1","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.00825","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"pith_short_12","alias_value":"UAEVNNVUOQQE","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"pith_short_16","alias_value":"UAEVNNVUOQQEOK7X","created_at":"2026-07-05T06:05:45Z"},{"alias_kind":"pith_short_8","alias_value":"UAEVNNVU","created_at":"2026-07-05T06:05:45Z"}],"graph_snapshots":[{"event_id":"sha256:24b6058800ccc076e258e32f1553ddf82e9e28e9627152216f8fd6bf6f682e53","target":"graph","created_at":"2026-07-05T06:05:45Z","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/2305.00825/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a finite grid in $\\mathbb{R}^2$, how many lines are needed to cover all but one point at least $k$ times? Problems of this nature have been studied for decades, with a general lower bound having been established by Ball and Serra. We solve this problem for various types of grids, in particular showing the tightness of the Ball--Serra bound when one side is much larger than the other. In other cases, we prove new lower bounds that improve upon Ball--Serra and provide an asymptotic answer for almost all grids. For the standard grid $\\{0,\\ldots,n-1\\} \\times \\{0,\\ldots,n-1\\}$, we prove nontr","authors_text":"Anurag Bishnoi, Shagnik Das, Simona Boyadzhiyska, Yvonne den Bakker","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-01T13:51:32Z","title":"Covering grids with multiplicity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.00825","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:301c408c562998d69f15a48970f484e9132bb0c9a8677eda8de0496702711092","target":"record","created_at":"2026-07-05T06:05:45Z","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":"69080c8b6bed64e3b572a1892bac5f7f0424c945290f36686a04981bc7a6d4cc","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-05-01T13:51:32Z","title_canon_sha256":"325f3128b2c1d39233a484af3f46499ea914b62fe2020ade623152191ed2ca7b"},"schema_version":"1.0","source":{"id":"2305.00825","kind":"arxiv","version":1}},"canonical_sha256":"a00956b6b47420472bf7f1fcbc4b0b23ba6cef89a460c8f88c5f407c5cb48300","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a00956b6b47420472bf7f1fcbc4b0b23ba6cef89a460c8f88c5f407c5cb48300","first_computed_at":"2026-07-05T06:05:45.623879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:05:45.623879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1cC1OZ5e2b6/yZ8ZdRaWC64qFd5InwKC4nwFDAWgREyuZaQsw3tE3t6B/J41BztGAKRphyjX+eoAly0/vAohDg==","signature_status":"signed_v1","signed_at":"2026-07-05T06:05:45.624286Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.00825","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:301c408c562998d69f15a48970f484e9132bb0c9a8677eda8de0496702711092","sha256:24b6058800ccc076e258e32f1553ddf82e9e28e9627152216f8fd6bf6f682e53"],"state_sha256":"f809d1dd220652876b3d0d5b40fc57abb60418ea8985f28d09a24a0f6691bc88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7T7OAYMb5SBdpV05reCycoI2Ur0Y740a+5a+RMLTIyh30l5nhk11uRG0KH/M01lxCrFgTlcUJsPKVhpK9XmUBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T01:33:10.725927Z","bundle_sha256":"769a1621681cce92161a26bfd0daeade8b01c3d8242ffcdf66e7fd7b964eef6d"}}