{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:MY3K4CNLFG5AP6RIQGJPQTOW2Q","short_pith_number":"pith:MY3K4CNL","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"},"canonical_sha256":"6636ae09ab29ba07fa288192f84dd6d402a6c83f6d36e3b82d5533cf467b8565","source":{"kind":"arxiv","id":"1607.07256","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07256","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07256v2","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07256","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"MY3K4CNLFG5A","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MY3K4CNLFG5AP6RI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MY3K4CNL","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:MY3K4CNLFG5AP6RIQGJPQTOW2Q","target":"record","payload":{"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"},"canonical_sha256":"6636ae09ab29ba07fa288192f84dd6d402a6c83f6d36e3b82d5533cf467b8565","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"},"source_kind":"arxiv","source_id":"1607.07256","source_version":2,"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-05-18T01:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YThUwVX5llSwKtLxUqNjmim012urJ8Rl8Wk3CrHOlpUL/ifLNGQ/2pHHZ2uA4CF8dLAO+wmX/PMeDx2dYJtNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:36:20.653345Z"},"content_sha256":"2ae25131cd277e987e962bb830aba65e89f458ef1649c071e7b7908d546e0612","schema_version":"1.0","event_id":"sha256:2ae25131cd277e987e962bb830aba65e89f458ef1649c071e7b7908d546e0612"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:MY3K4CNLFG5AP6RIQGJPQTOW2Q","target":"graph","payload":{"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"},"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-05-18T01:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PiIe7ISEXIRtaLZa2lBsVZjhUkKwwN0rwjPDVWN3fjnVQyHHT+r2D63tD+MOmFddsqwwMEw58wQkaNKOrISGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T15:36:20.653694Z"},"content_sha256":"8c8a70a42a58c6c2b1d627b23deb3b7e7804ffcb67e732e42f8b45e21e81df6a","schema_version":"1.0","event_id":"sha256:8c8a70a42a58c6c2b1d627b23deb3b7e7804ffcb67e732e42f8b45e21e81df6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/bundle.json","state_url":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/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-06-03T15:36:20Z","links":{"resolver":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q","bundle":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/bundle.json","state":"https://pith.science/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MY3K4CNLFG5AP6RIQGJPQTOW2Q/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:MY3K4CNLFG5AP6RIQGJPQTOW2Q","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":"01316c8562c8fb526a48973bcaec6ad72e6bc8ff0c6e55f5e2567ad41df0a0c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T13:13:18Z","title_canon_sha256":"e1903ab25f974dc8f348e6778ae289efc2a9c98e5d1a891943e4e12417771063"},"schema_version":"1.0","source":{"id":"1607.07256","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.07256","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"1607.07256v2","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.07256","created_at":"2026-05-18T01:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"MY3K4CNLFG5A","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"MY3K4CNLFG5AP6RI","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"MY3K4CNL","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:8c8a70a42a58c6c2b1d627b23deb3b7e7804ffcb67e732e42f8b45e21e81df6a","target":"graph","created_at":"2026-05-18T01:03:48Z","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"},"paper":{"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 ","authors_text":"Ankush Acharyya, Sasanka Roy, Subhas C. Nandy, Supantha Pandit","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T13:13:18Z","title":"Covering segments with unit squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.07256","kind":"arxiv","version":2},"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:2ae25131cd277e987e962bb830aba65e89f458ef1649c071e7b7908d546e0612","target":"record","created_at":"2026-05-18T01:03:48Z","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":"01316c8562c8fb526a48973bcaec6ad72e6bc8ff0c6e55f5e2567ad41df0a0c2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2016-07-25T13:13:18Z","title_canon_sha256":"e1903ab25f974dc8f348e6778ae289efc2a9c98e5d1a891943e4e12417771063"},"schema_version":"1.0","source":{"id":"1607.07256","kind":"arxiv","version":2}},"canonical_sha256":"6636ae09ab29ba07fa288192f84dd6d402a6c83f6d36e3b82d5533cf467b8565","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6636ae09ab29ba07fa288192f84dd6d402a6c83f6d36e3b82d5533cf467b8565","first_computed_at":"2026-05-18T01:03:48.835384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:48.835384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/GdkMRwZZ20MiO/f9kMHVTise+fzpR4nD6MTWDDnhz0MaSTe6wp1A6ZDW1zDcjz8IpMu5cI9qFyCvVStS2oADA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:48.835979Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.07256","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2ae25131cd277e987e962bb830aba65e89f458ef1649c071e7b7908d546e0612","sha256:8c8a70a42a58c6c2b1d627b23deb3b7e7804ffcb67e732e42f8b45e21e81df6a"],"state_sha256":"29616f64cacd7d9074c0baf1db7ead9c6a51687de9a0944a7323d0ca28de2190"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/n1bE/eqBXZrM9rCOeLos3Di3V6rKmDYUO3HlgvGdUVKqFthU8sqWtQeKvyeu1B3r/IG3kk/l7gJLrg9H/YGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T15:36:20.655617Z","bundle_sha256":"1efb3765b943343f85f6c2d8168a7dd80d750b0c92a2c3ea733e54d58bb8acd5"}}