{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:MY3K4CNLFG5AP6RIQGJPQTOW2Q","short_pith_number":"pith:MY3K4CNL","schema_version":"1.0","canonical_sha256":"6636ae09ab29ba07fa288192f84dd6d402a6c83f6d36e3b82d5533cf467b8565","source":{"kind":"arxiv","id":"1607.07256","version":2},"attestation_state":"computed","paper":{"title":"Covering segments with unit squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ankush Acharyya, Sasanka Roy, Subhas C. Nandy, Supantha Pandit","submitted_at":"2016-07-25T13:13:18Z","abstract_excerpt":"We study several variations of line segment covering problem with axis-parallel unit squares in $I\\!\\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give constant factor approximation algorithms for those problems. For some variations, we have polynomial time exact algorithms. For the general version of the problem, where the segments are of "},"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":"1607.07256","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T13:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"e1903ab25f974dc8f348e6778ae289efc2a9c98e5d1a891943e4e12417771063","abstract_canon_sha256":"01316c8562c8fb526a48973bcaec6ad72e6bc8ff0c6e55f5e2567ad41df0a0c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:48.835979Z","signature_b64":"/GdkMRwZZ20MiO/f9kMHVTise+fzpR4nD6MTWDDnhz0MaSTe6wp1A6ZDW1zDcjz8IpMu5cI9qFyCvVStS2oADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6636ae09ab29ba07fa288192f84dd6d402a6c83f6d36e3b82d5533cf467b8565","last_reissued_at":"2026-05-18T01:03:48.835384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:48.835384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering segments with unit squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Ankush Acharyya, Sasanka Roy, Subhas C. Nandy, Supantha Pandit","submitted_at":"2016-07-25T13:13:18Z","abstract_excerpt":"We study several variations of line segment covering problem with axis-parallel unit squares in $I\\!\\!R^2$. A set $S$ of $n$ line segments is given. The objective is to find the minimum number of axis-parallel unit squares which cover at least one end-point of each segment. The variations depend on the orientation and length of the input segments. We prove some of these problems to be NP-complete, and give constant factor approximation algorithms for those problems. For some variations, we have polynomial time exact algorithms. For the general version of the problem, where the segments are of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07256","kind":"arxiv","version":2},"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":"1607.07256","created_at":"2026-05-18T01:03:48.835495+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.07256v2","created_at":"2026-05-18T01:03:48.835495+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07256","created_at":"2026-05-18T01:03:48.835495+00:00"},{"alias_kind":"pith_short_12","alias_value":"MY3K4CNLFG5A","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"MY3K4CNLFG5AP6RI","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"MY3K4CNL","created_at":"2026-05-18T12:30:32.724797+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/MY3K4CNLFG5AP6RIQGJPQTOW2Q","json":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q.json","graph_json":"https://pith.science/api/pith-number/MY3K4CNLFG5AP6RIQGJPQTOW2Q/graph.json","events_json":"https://pith.science/api/pith-number/MY3K4CNLFG5AP6RIQGJPQTOW2Q/events.json","paper":"https://pith.science/paper/MY3K4CNL"},"agent_actions":{"view_html":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q","download_json":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q.json","view_paper":"https://pith.science/paper/MY3K4CNL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.07256&json=true","fetch_graph":"https://pith.science/api/pith-number/MY3K4CNLFG5AP6RIQGJPQTOW2Q/graph.json","fetch_events":"https://pith.science/api/pith-number/MY3K4CNLFG5AP6RIQGJPQTOW2Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/action/storage_attestation","attest_author":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/action/author_attestation","sign_citation":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/action/citation_signature","submit_replication":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/action/replication_record"}},"created_at":"2026-05-18T01:03:48.835495+00:00","updated_at":"2026-05-18T01:03:48.835495+00:00"}