{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:IU7ZBXUZSKQ4QYNDBABCTYGG5N","short_pith_number":"pith:IU7ZBXUZ","canonical_record":{"source":{"id":"1006.2955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-06-15T10:51:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1db7f3fad41b472efcbf04b1038620b77ed4959296f38be6862d046524dfc96e","abstract_canon_sha256":"ccb063a0f8f810de971ed8348b4afc99407794c020b3257cb0719bb33d14a9b1"},"schema_version":"1.0"},"canonical_sha256":"453f90de9992a1c861a3080229e0c6eb7680378de1119cd098a3119d6c7a66ba","source":{"kind":"arxiv","id":"1006.2955","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2955","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2955v1","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2955","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"IU7ZBXUZSKQ4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IU7ZBXUZSKQ4QYND","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IU7ZBXUZ","created_at":"2026-05-18T12:26:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:IU7ZBXUZSKQ4QYNDBABCTYGG5N","target":"record","payload":{"canonical_record":{"source":{"id":"1006.2955","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-06-15T10:51:44Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1db7f3fad41b472efcbf04b1038620b77ed4959296f38be6862d046524dfc96e","abstract_canon_sha256":"ccb063a0f8f810de971ed8348b4afc99407794c020b3257cb0719bb33d14a9b1"},"schema_version":"1.0"},"canonical_sha256":"453f90de9992a1c861a3080229e0c6eb7680378de1119cd098a3119d6c7a66ba","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:34.420237Z","signature_b64":"N37FgqkKz0jLCtv5WYOd77EpxoIC/2NVW2hr+dB+SbemXrbs3D86QpMDTSPknhaVAC2nwiJSzAztcn/+R6vIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"453f90de9992a1c861a3080229e0c6eb7680378de1119cd098a3119d6c7a66ba","last_reissued_at":"2026-05-18T00:30:34.419540Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:34.419540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1006.2955","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-05-18T00:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RLj/t9kzLAio80r5JtICldqjBcpMMXuvQ9B9hXm2mM6BYBrDq6jxj6T6gMWLx4+piXNfLTpxrx8fhAYg7wuaAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:35:20.507896Z"},"content_sha256":"74907dfd5f4df59e30664535bb035553e3271e27a1f2ee756b4b8fee97afd0b7","schema_version":"1.0","event_id":"sha256:74907dfd5f4df59e30664535bb035553e3271e27a1f2ee756b4b8fee97afd0b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:IU7ZBXUZSKQ4QYNDBABCTYGG5N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Arijit Bishnu, Arobinda Gupta, Dinesh Dash, Subhas C. Nandy","submitted_at":"2010-06-15T10:51:44Z","abstract_excerpt":"The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks. A line segment ` is said to be covered if it intersects the sensing regions of at least one sensor distributed in that region. We show that the problem of finding the minimum number of sensors needed to cover each member in a given set of line segments in a rectangular area is NP-hard. Next, we propose a constant factor approximation algorithm for the problem of covering a set of ax"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2955","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":""},"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-18T00:30:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a7D9c0ENfd1Yl0QmJnVe2F7cCymNE5c0Mdzy0dx5jlf6uWD7z0oTetOKXKm0ZysMsm+u1y5hfG6m8YC9nW71Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:35:20.508367Z"},"content_sha256":"12a8fe7dc17c605ac0f1c7a6db3f952db58f42cf842e01d4c232df445d611d95","schema_version":"1.0","event_id":"sha256:12a8fe7dc17c605ac0f1c7a6db3f952db58f42cf842e01d4c232df445d611d95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IU7ZBXUZSKQ4QYNDBABCTYGG5N/bundle.json","state_url":"https://pith.science/pith/IU7ZBXUZSKQ4QYNDBABCTYGG5N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IU7ZBXUZSKQ4QYNDBABCTYGG5N/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-05-31T16:35:20Z","links":{"resolver":"https://pith.science/pith/IU7ZBXUZSKQ4QYNDBABCTYGG5N","bundle":"https://pith.science/pith/IU7ZBXUZSKQ4QYNDBABCTYGG5N/bundle.json","state":"https://pith.science/pith/IU7ZBXUZSKQ4QYNDBABCTYGG5N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IU7ZBXUZSKQ4QYNDBABCTYGG5N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:IU7ZBXUZSKQ4QYNDBABCTYGG5N","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":"ccb063a0f8f810de971ed8348b4afc99407794c020b3257cb0719bb33d14a9b1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-06-15T10:51:44Z","title_canon_sha256":"1db7f3fad41b472efcbf04b1038620b77ed4959296f38be6862d046524dfc96e"},"schema_version":"1.0","source":{"id":"1006.2955","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1006.2955","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"arxiv_version","alias_value":"1006.2955v1","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1006.2955","created_at":"2026-05-18T00:30:34Z"},{"alias_kind":"pith_short_12","alias_value":"IU7ZBXUZSKQ4","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_16","alias_value":"IU7ZBXUZSKQ4QYND","created_at":"2026-05-18T12:26:09Z"},{"alias_kind":"pith_short_8","alias_value":"IU7ZBXUZ","created_at":"2026-05-18T12:26:09Z"}],"graph_snapshots":[{"event_id":"sha256:12a8fe7dc17c605ac0f1c7a6db3f952db58f42cf842e01d4c232df445d611d95","target":"graph","created_at":"2026-05-18T00:30:34Z","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":"The coverage problem in wireless sensor networks deals with the problem of covering a region or parts of it with sensors. In this paper, we address the problem of covering a set of line segments in sensor networks. A line segment ` is said to be covered if it intersects the sensing regions of at least one sensor distributed in that region. We show that the problem of finding the minimum number of sensors needed to cover each member in a given set of line segments in a rectangular area is NP-hard. Next, we propose a constant factor approximation algorithm for the problem of covering a set of ax","authors_text":"Arijit Bishnu, Arobinda Gupta, Dinesh Dash, Subhas C. Nandy","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-06-15T10:51:44Z","title":"Approximation Algorithm for Line Segment Coverage for Wireless Sensor Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1006.2955","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:74907dfd5f4df59e30664535bb035553e3271e27a1f2ee756b4b8fee97afd0b7","target":"record","created_at":"2026-05-18T00:30:34Z","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":"ccb063a0f8f810de971ed8348b4afc99407794c020b3257cb0719bb33d14a9b1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2010-06-15T10:51:44Z","title_canon_sha256":"1db7f3fad41b472efcbf04b1038620b77ed4959296f38be6862d046524dfc96e"},"schema_version":"1.0","source":{"id":"1006.2955","kind":"arxiv","version":1}},"canonical_sha256":"453f90de9992a1c861a3080229e0c6eb7680378de1119cd098a3119d6c7a66ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"453f90de9992a1c861a3080229e0c6eb7680378de1119cd098a3119d6c7a66ba","first_computed_at":"2026-05-18T00:30:34.419540Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:34.419540Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"N37FgqkKz0jLCtv5WYOd77EpxoIC/2NVW2hr+dB+SbemXrbs3D86QpMDTSPknhaVAC2nwiJSzAztcn/+R6vIAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:34.420237Z","signed_message":"canonical_sha256_bytes"},"source_id":"1006.2955","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74907dfd5f4df59e30664535bb035553e3271e27a1f2ee756b4b8fee97afd0b7","sha256:12a8fe7dc17c605ac0f1c7a6db3f952db58f42cf842e01d4c232df445d611d95"],"state_sha256":"825e59b0eccd9b465db87c544897bbba7e9a4357a354cf9da15d6945973dfa74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5paQUAHJ0fRVQZlJb3lWyu5jLBoKNhN7Sxvqciy4gS3KVg6398TfqOsiRCv7z5C56yKlVm2PeJdeG/Wzx2kiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:35:20.512653Z","bundle_sha256":"4b31e154c7676c6898f630f28ce0ac9c0f168957267fa48dc2c1b546ef05e329"}}