{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7YXJO33WRUTSPKVNOR6WZYYAM5","short_pith_number":"pith:7YXJO33W","canonical_record":{"source":{"id":"1103.1771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-09T13:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"1bb141056e062259b13a766753c9cd8abbf5d827363ba379d8c713e43044e38f","abstract_canon_sha256":"424e66e20f6ba4f1118ec506bee4277ae1d418b3c64c093d41e4385a8186e796"},"schema_version":"1.0"},"canonical_sha256":"fe2e976f768d2727aaad747d6ce300675901882f59f66c8a41d98a1fc9115f2c","source":{"kind":"arxiv","id":"1103.1771","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1771","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1771v1","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1771","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"7YXJO33WRUTS","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7YXJO33WRUTSPKVN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7YXJO33W","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7YXJO33WRUTSPKVNOR6WZYYAM5","target":"record","payload":{"canonical_record":{"source":{"id":"1103.1771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-09T13:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"1bb141056e062259b13a766753c9cd8abbf5d827363ba379d8c713e43044e38f","abstract_canon_sha256":"424e66e20f6ba4f1118ec506bee4277ae1d418b3c64c093d41e4385a8186e796"},"schema_version":"1.0"},"canonical_sha256":"fe2e976f768d2727aaad747d6ce300675901882f59f66c8a41d98a1fc9115f2c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:05.843503Z","signature_b64":"ovh6cc9AiftMfRERLLxw/vtoe0TtRjmqbRu3IqdzlQwgz37IU2YrtvXsDFrIrkX5RF1nmcMuEpQmtJXWZdSMCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe2e976f768d2727aaad747d6ce300675901882f59f66c8a41d98a1fc9115f2c","last_reissued_at":"2026-05-18T04:27:05.842960Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:05.842960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1103.1771","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-18T04:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J2Wda6KGk5z3jeE/xUvy/uLK1jmUSvrSznmvYhU5Yc2p+prrPo7x3QDfYZxcY0ek72LvPmeGN2h8WkjN8IHZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:48:45.659974Z"},"content_sha256":"84441c06e37acde502b6d726e4e0c154ec48f478b56d986280c8910026236e18","schema_version":"1.0","event_id":"sha256:84441c06e37acde502b6d726e4e0c154ec48f478b56d986280c8910026236e18"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7YXJO33WRUTSPKVNOR6WZYYAM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dennis Schieferdecker, Dorothea Wagner, Markus V\\\"olker","submitted_at":"2011-03-09T13:08:13Z","abstract_excerpt":"We propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative.\n  We compare our algorithms qualitatively and quantitatively with several previous approaches. In extensive simulations, we consider various models and scenarios. Although our algorithms use less information than most other a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1771","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-18T04:27:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HtmftTvmAVxyP03cnBgvZvp6FMM9gV2ro32bGsiEFHJDIdJ+VIrO8ZGyjEfsC9dsV3+/2UHpoOmW0BzViD9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T11:48:45.660688Z"},"content_sha256":"43a28a9f4bdd5f544ccee921903a2af7e1518a3eb0e7b220d407a8bcdce776db","schema_version":"1.0","event_id":"sha256:43a28a9f4bdd5f544ccee921903a2af7e1518a3eb0e7b220d407a8bcdce776db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7YXJO33WRUTSPKVNOR6WZYYAM5/bundle.json","state_url":"https://pith.science/pith/7YXJO33WRUTSPKVNOR6WZYYAM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7YXJO33WRUTSPKVNOR6WZYYAM5/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-26T11:48:45Z","links":{"resolver":"https://pith.science/pith/7YXJO33WRUTSPKVNOR6WZYYAM5","bundle":"https://pith.science/pith/7YXJO33WRUTSPKVNOR6WZYYAM5/bundle.json","state":"https://pith.science/pith/7YXJO33WRUTSPKVNOR6WZYYAM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7YXJO33WRUTSPKVNOR6WZYYAM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7YXJO33WRUTSPKVNOR6WZYYAM5","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":"424e66e20f6ba4f1118ec506bee4277ae1d418b3c64c093d41e4385a8186e796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-09T13:08:13Z","title_canon_sha256":"1bb141056e062259b13a766753c9cd8abbf5d827363ba379d8c713e43044e38f"},"schema_version":"1.0","source":{"id":"1103.1771","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.1771","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"arxiv_version","alias_value":"1103.1771v1","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.1771","created_at":"2026-05-18T04:27:05Z"},{"alias_kind":"pith_short_12","alias_value":"7YXJO33WRUTS","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7YXJO33WRUTSPKVN","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7YXJO33W","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:43a28a9f4bdd5f544ccee921903a2af7e1518a3eb0e7b220d407a8bcdce776db","target":"graph","created_at":"2026-05-18T04:27:05Z","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 propose two novel algorithms for distributed and location-free boundary recognition in wireless sensor networks. Both approaches enable a node to decide autonomously whether it is a boundary node, based solely on connectivity information of a small neighborhood. This makes our algorithms highly applicable for dynamic networks where nodes can move or become inoperative.\n  We compare our algorithms qualitatively and quantitatively with several previous approaches. In extensive simulations, we consider various models and scenarios. Although our algorithms use less information than most other a","authors_text":"Dennis Schieferdecker, Dorothea Wagner, Markus V\\\"olker","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-09T13:08:13Z","title":"Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.1771","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:84441c06e37acde502b6d726e4e0c154ec48f478b56d986280c8910026236e18","target":"record","created_at":"2026-05-18T04:27:05Z","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":"424e66e20f6ba4f1118ec506bee4277ae1d418b3c64c093d41e4385a8186e796","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-09T13:08:13Z","title_canon_sha256":"1bb141056e062259b13a766753c9cd8abbf5d827363ba379d8c713e43044e38f"},"schema_version":"1.0","source":{"id":"1103.1771","kind":"arxiv","version":1}},"canonical_sha256":"fe2e976f768d2727aaad747d6ce300675901882f59f66c8a41d98a1fc9115f2c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fe2e976f768d2727aaad747d6ce300675901882f59f66c8a41d98a1fc9115f2c","first_computed_at":"2026-05-18T04:27:05.842960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:27:05.842960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ovh6cc9AiftMfRERLLxw/vtoe0TtRjmqbRu3IqdzlQwgz37IU2YrtvXsDFrIrkX5RF1nmcMuEpQmtJXWZdSMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:27:05.843503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.1771","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:84441c06e37acde502b6d726e4e0c154ec48f478b56d986280c8910026236e18","sha256:43a28a9f4bdd5f544ccee921903a2af7e1518a3eb0e7b220d407a8bcdce776db"],"state_sha256":"261df21af17c53153c78a3cb5d283f6406843100a3912209c3ca1961cb3d99d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9h6gy0k3c7vZpjSH4Hr/8yT0bsBHjnN5/qCXmwjesml4M6+T0lLOYIQSTF9pSAT9lPqVmVjoim7vJwo7MqVCBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T11:48:45.664360Z","bundle_sha256":"d16de9ebea16697d50adc9b8597497ef47ad0a7130fd96396f92b5cf207bb6fa"}}