{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XON2XIGYKR6JNHU5VCXQHSWMJN","short_pith_number":"pith:XON2XIGY","canonical_record":{"source":{"id":"1402.2140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T13:30:25Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"6ab05d30ef0b25676cb87da21ddd164df48725dc72ec44cc104d1e6cde5edf7b","abstract_canon_sha256":"4f878d2890d4b8cea5af8a9e84c1a7b9714c3e932e105feab56ae468a3895d6b"},"schema_version":"1.0"},"canonical_sha256":"bb9baba0d8547c969e9da8af03cacc4b76629920dde466c3044d6949f7d969b8","source":{"kind":"arxiv","id":"1402.2140","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2140","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2140v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2140","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"XON2XIGYKR6J","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XON2XIGYKR6JNHU5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XON2XIGY","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XON2XIGYKR6JNHU5VCXQHSWMJN","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2140","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T13:30:25Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"6ab05d30ef0b25676cb87da21ddd164df48725dc72ec44cc104d1e6cde5edf7b","abstract_canon_sha256":"4f878d2890d4b8cea5af8a9e84c1a7b9714c3e932e105feab56ae468a3895d6b"},"schema_version":"1.0"},"canonical_sha256":"bb9baba0d8547c969e9da8af03cacc4b76629920dde466c3044d6949f7d969b8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:32.214570Z","signature_b64":"hwCQo3KKssJiWzVWlSguQg9EjxAKL7BnJ7woyen3PPELAhyiEtY16nbxUxXNGNlhZp9E3OZj3NzZbfUp/Z3+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb9baba0d8547c969e9da8af03cacc4b76629920dde466c3044d6949f7d969b8","last_reissued_at":"2026-05-18T02:59:32.213793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:32.213793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2140","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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"45NdHtc/RG5Wh/BdkF/UAYykxnw3A/cNd37VSuzHDcMQjXRkTkTbI3xtzQO5TFzVDA4iP6BzVqkD7XLgfX7GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:08:47.502277Z"},"content_sha256":"051313d53d1dc73f35a77508ff64e876d9dfd99eb273c3ba951c449e4b19edc8","schema_version":"1.0","event_id":"sha256:051313d53d1dc73f35a77508ff64e876d9dfd99eb273c3ba951c449e4b19edc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XON2XIGYKR6JNHU5VCXQHSWMJN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Vertex Cover Algorithms For Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Aybars Ural, Orhan Dagdeviren, Vedat Kavalci","submitted_at":"2014-02-10T13:30:25Z","abstract_excerpt":"Vertex covering has important applications for wireless sensor networks such as monitoring link failures, facility location, clustering, and data aggregation. In this study, we designed three algorithms for constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the Parnas & Ron's algorithm, is a greedy approach that finds a vertex cover by using the degrees of the nodes. The second algorithm finds a vertex cover from graph matching where Hoepman's weighted matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2140","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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wvJX2whoaVXqtCEve2OOLXvEdzYyZCAghSlEs4lQF2k4/C4Q3JU6i64ugXq7Li3sjFfKy/ePaETXb6bdN3FgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T13:08:47.502869Z"},"content_sha256":"70223341f4ce951d1d072da160120cf84a21da7a0517a1dd0097bc0aafb48c15","schema_version":"1.0","event_id":"sha256:70223341f4ce951d1d072da160120cf84a21da7a0517a1dd0097bc0aafb48c15"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XON2XIGYKR6JNHU5VCXQHSWMJN/bundle.json","state_url":"https://pith.science/pith/XON2XIGYKR6JNHU5VCXQHSWMJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XON2XIGYKR6JNHU5VCXQHSWMJN/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-16T13:08:47Z","links":{"resolver":"https://pith.science/pith/XON2XIGYKR6JNHU5VCXQHSWMJN","bundle":"https://pith.science/pith/XON2XIGYKR6JNHU5VCXQHSWMJN/bundle.json","state":"https://pith.science/pith/XON2XIGYKR6JNHU5VCXQHSWMJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XON2XIGYKR6JNHU5VCXQHSWMJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XON2XIGYKR6JNHU5VCXQHSWMJN","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":"4f878d2890d4b8cea5af8a9e84c1a7b9714c3e932e105feab56ae468a3895d6b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T13:30:25Z","title_canon_sha256":"6ab05d30ef0b25676cb87da21ddd164df48725dc72ec44cc104d1e6cde5edf7b"},"schema_version":"1.0","source":{"id":"1402.2140","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2140","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2140v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2140","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"XON2XIGYKR6J","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XON2XIGYKR6JNHU5","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XON2XIGY","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:70223341f4ce951d1d072da160120cf84a21da7a0517a1dd0097bc0aafb48c15","target":"graph","created_at":"2026-05-18T02:59:32Z","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":"Vertex covering has important applications for wireless sensor networks such as monitoring link failures, facility location, clustering, and data aggregation. In this study, we designed three algorithms for constructing vertex cover in wireless sensor networks. The first algorithm, which is an adaption of the Parnas & Ron's algorithm, is a greedy approach that finds a vertex cover by using the degrees of the nodes. The second algorithm finds a vertex cover from graph matching where Hoepman's weighted matching algorithm is used. The third algorithm firstly forms a breadth-first search tree and ","authors_text":"Aybars Ural, Orhan Dagdeviren, Vedat Kavalci","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T13:30:25Z","title":"Distributed Vertex Cover Algorithms For Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2140","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:051313d53d1dc73f35a77508ff64e876d9dfd99eb273c3ba951c449e4b19edc8","target":"record","created_at":"2026-05-18T02:59:32Z","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":"4f878d2890d4b8cea5af8a9e84c1a7b9714c3e932e105feab56ae468a3895d6b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-02-10T13:30:25Z","title_canon_sha256":"6ab05d30ef0b25676cb87da21ddd164df48725dc72ec44cc104d1e6cde5edf7b"},"schema_version":"1.0","source":{"id":"1402.2140","kind":"arxiv","version":1}},"canonical_sha256":"bb9baba0d8547c969e9da8af03cacc4b76629920dde466c3044d6949f7d969b8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb9baba0d8547c969e9da8af03cacc4b76629920dde466c3044d6949f7d969b8","first_computed_at":"2026-05-18T02:59:32.213793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:32.213793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hwCQo3KKssJiWzVWlSguQg9EjxAKL7BnJ7woyen3PPELAhyiEtY16nbxUxXNGNlhZp9E3OZj3NzZbfUp/Z3+AA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:32.214570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2140","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:051313d53d1dc73f35a77508ff64e876d9dfd99eb273c3ba951c449e4b19edc8","sha256:70223341f4ce951d1d072da160120cf84a21da7a0517a1dd0097bc0aafb48c15"],"state_sha256":"08a5f92a6613606d84967b01b90238ac559da1747a36071d24632fbc173f0df8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCUKWmEtzOemImYKsTwqUirNyV99df9WfaFBoppEQ1L8GlppWxJ9Gf0ZcFwPkELN4fF5Ud7KUyN3jngvrBqPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T13:08:47.507718Z","bundle_sha256":"7cc5384dcb901d9d0484c9ee673aa4a10f3af06067a6f2ed8f5ea1aab2ae2cfa"}}