{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:7LW24ZFPLK36HY23U6QEDXIKFH","short_pith_number":"pith:7LW24ZFP","canonical_record":{"source":{"id":"1704.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-08T04:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"f73871dd98d024346278da249efbbe847e5bab19e91f1c43ac535383ad655e75","abstract_canon_sha256":"a7f17484ca535db7c08e661902761fb52a7c4e95ca658e110f8828907e52b757"},"schema_version":"1.0"},"canonical_sha256":"faedae64af5ab7e3e35ba7a041dd0a29d9b0c096fccc4f14803aa43733a9fd60","source":{"kind":"arxiv","id":"1704.02436","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02436","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02436v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02436","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"7LW24ZFPLK36","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7LW24ZFPLK36HY23","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7LW24ZFP","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:7LW24ZFPLK36HY23U6QEDXIKFH","target":"record","payload":{"canonical_record":{"source":{"id":"1704.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-08T04:01:33Z","cross_cats_sorted":[],"title_canon_sha256":"f73871dd98d024346278da249efbbe847e5bab19e91f1c43ac535383ad655e75","abstract_canon_sha256":"a7f17484ca535db7c08e661902761fb52a7c4e95ca658e110f8828907e52b757"},"schema_version":"1.0"},"canonical_sha256":"faedae64af5ab7e3e35ba7a041dd0a29d9b0c096fccc4f14803aa43733a9fd60","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:45.551112Z","signature_b64":"HIWlWCPWGXdpmysafpGRURAH7bc3zUF7+x4i19eJnzCqPJSS2koKV20OgTxfUGQ+gAVXs6pdQUp71aEURIdqBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faedae64af5ab7e3e35ba7a041dd0a29d9b0c096fccc4f14803aa43733a9fd60","last_reissued_at":"2026-05-18T00:46:45.550375Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:45.550375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.02436","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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mwCLeM1pKMNur/vKbqBFSiAD6cSLwpOmvR8Y05akuS7ECDY4M2Oup4DyB46aPzbkrZ/mK0ZT3Iyvj4dfWgzDDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:04:59.807140Z"},"content_sha256":"7bfed49d06420b688e59339e6f2f95de0b36618c3d3e72396a1801d08e72a140","schema_version":"1.0","event_id":"sha256:7bfed49d06420b688e59339e6f2f95de0b36618c3d3e72396a1801d08e72a140"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:7LW24ZFPLK36HY23U6QEDXIKFH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Barrier Sweep Coverage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Barun Gorain, Partha Sarathi Mandal","submitted_at":"2017-04-08T04:01:33Z","abstract_excerpt":"Time-varying coverage, namely sweep coverage is a recent development in the area of wireless sensor networks, where a small number of mobile sensors sweep or monitor comparatively large number of locations periodically. In this article we study barrier sweep coverage with mobile sensors where the barrier is considered as a finite length continuous curve on a plane. The coverage at every point on the curve is time-variant. We propose an optimal solution for sweep coverage of a finite length continuous curve. Usually energy source of a mobile sensor is battery with limited power, so energy restr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02436","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:46:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cpedIKr8zazFfFe+ryPsWOhgsWRKBqqK/mJZ7sKS0d89flZuL8l+m834oM6tjSGb2PrJTZikkDPLoAFePoJgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T11:04:59.807502Z"},"content_sha256":"e6b94dc2102b8ce13426bb614015423fbd265d117a5f8428f021ce66944c1061","schema_version":"1.0","event_id":"sha256:e6b94dc2102b8ce13426bb614015423fbd265d117a5f8428f021ce66944c1061"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7LW24ZFPLK36HY23U6QEDXIKFH/bundle.json","state_url":"https://pith.science/pith/7LW24ZFPLK36HY23U6QEDXIKFH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7LW24ZFPLK36HY23U6QEDXIKFH/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-03T11:04:59Z","links":{"resolver":"https://pith.science/pith/7LW24ZFPLK36HY23U6QEDXIKFH","bundle":"https://pith.science/pith/7LW24ZFPLK36HY23U6QEDXIKFH/bundle.json","state":"https://pith.science/pith/7LW24ZFPLK36HY23U6QEDXIKFH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7LW24ZFPLK36HY23U6QEDXIKFH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:7LW24ZFPLK36HY23U6QEDXIKFH","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":"a7f17484ca535db7c08e661902761fb52a7c4e95ca658e110f8828907e52b757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-08T04:01:33Z","title_canon_sha256":"f73871dd98d024346278da249efbbe847e5bab19e91f1c43ac535383ad655e75"},"schema_version":"1.0","source":{"id":"1704.02436","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.02436","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"arxiv_version","alias_value":"1704.02436v1","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.02436","created_at":"2026-05-18T00:46:45Z"},{"alias_kind":"pith_short_12","alias_value":"7LW24ZFPLK36","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"7LW24ZFPLK36HY23","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"7LW24ZFP","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:e6b94dc2102b8ce13426bb614015423fbd265d117a5f8428f021ce66944c1061","target":"graph","created_at":"2026-05-18T00:46: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"},"paper":{"abstract_excerpt":"Time-varying coverage, namely sweep coverage is a recent development in the area of wireless sensor networks, where a small number of mobile sensors sweep or monitor comparatively large number of locations periodically. In this article we study barrier sweep coverage with mobile sensors where the barrier is considered as a finite length continuous curve on a plane. The coverage at every point on the curve is time-variant. We propose an optimal solution for sweep coverage of a finite length continuous curve. Usually energy source of a mobile sensor is battery with limited power, so energy restr","authors_text":"Barun Gorain, Partha Sarathi Mandal","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-08T04:01:33Z","title":"Approximation Algorithms for Barrier Sweep Coverage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.02436","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:7bfed49d06420b688e59339e6f2f95de0b36618c3d3e72396a1801d08e72a140","target":"record","created_at":"2026-05-18T00:46: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":"a7f17484ca535db7c08e661902761fb52a7c4e95ca658e110f8828907e52b757","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-04-08T04:01:33Z","title_canon_sha256":"f73871dd98d024346278da249efbbe847e5bab19e91f1c43ac535383ad655e75"},"schema_version":"1.0","source":{"id":"1704.02436","kind":"arxiv","version":1}},"canonical_sha256":"faedae64af5ab7e3e35ba7a041dd0a29d9b0c096fccc4f14803aa43733a9fd60","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faedae64af5ab7e3e35ba7a041dd0a29d9b0c096fccc4f14803aa43733a9fd60","first_computed_at":"2026-05-18T00:46:45.550375Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:45.550375Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HIWlWCPWGXdpmysafpGRURAH7bc3zUF7+x4i19eJnzCqPJSS2koKV20OgTxfUGQ+gAVXs6pdQUp71aEURIdqBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:45.551112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.02436","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7bfed49d06420b688e59339e6f2f95de0b36618c3d3e72396a1801d08e72a140","sha256:e6b94dc2102b8ce13426bb614015423fbd265d117a5f8428f021ce66944c1061"],"state_sha256":"13d6df6a0ebd5933fedb13920a70561ae29461f9351649c3f6695637a998ef95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nx2lWIqjVVrcBU9ubw7hzwfatlRlu+wic6magWhveIgY2z1ZNVKRdhKqj6X1xYptb9gxyVeylEVRoOH9wI87DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T11:04:59.809446Z","bundle_sha256":"ccaf3c59bd9dd057a586b8394973871c333e15d12eb75a04a768d83debc77cb7"}}