{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DYJXJWN6VYAMU6RHDOYGVOKYUY","short_pith_number":"pith:DYJXJWN6","canonical_record":{"source":{"id":"1309.3139","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-12T12:33:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e78e9c181615a832d0d1b56b4831dce25968a9b5fa081cd35d50e0b46f944044","abstract_canon_sha256":"f4a573a13ef2e570719eb61c60c0de0e112c08925e26c0ef7324193a0a1f6f23"},"schema_version":"1.0"},"canonical_sha256":"1e1374d9beae00ca7a271bb06ab958a63ad93dcffd2df4f39e0ffd52ef6ec18b","source":{"kind":"arxiv","id":"1309.3139","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3139","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3139v3","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3139","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"DYJXJWN6VYAM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DYJXJWN6VYAMU6RH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DYJXJWN6","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DYJXJWN6VYAMU6RHDOYGVOKYUY","target":"record","payload":{"canonical_record":{"source":{"id":"1309.3139","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-12T12:33:09Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e78e9c181615a832d0d1b56b4831dce25968a9b5fa081cd35d50e0b46f944044","abstract_canon_sha256":"f4a573a13ef2e570719eb61c60c0de0e112c08925e26c0ef7324193a0a1f6f23"},"schema_version":"1.0"},"canonical_sha256":"1e1374d9beae00ca7a271bb06ab958a63ad93dcffd2df4f39e0ffd52ef6ec18b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:45.493017Z","signature_b64":"RVXR73EaqoL92HXi/bh96ATF5SvahPEf6FjUUGndVoQUw6f+hlo/YXZbfevH5NCxJypk7JIV62JUvaWXCLWiAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e1374d9beae00ca7a271bb06ab958a63ad93dcffd2df4f39e0ffd52ef6ec18b","last_reissued_at":"2026-05-18T02:43:45.492534Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:45.492534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.3139","source_version":3,"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:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2q+VA7QUdo+l9A8ECQSMeYiEr06Bc0VOzN7dJTFPdZ8iXHBdPwqxYQLMlXw5QFml6DERV2F/fECsMEWNsBI+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:54:52.890673Z"},"content_sha256":"f20bc2d424f7848872b276f2d85647378858f06cebed0017e6352c7f40e602ad","schema_version":"1.0","event_id":"sha256:f20bc2d424f7848872b276f2d85647378858f06cebed0017e6352c7f40e602ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DYJXJWN6VYAMU6RHDOYGVOKYUY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploiting Interference for Efficient Distributed Computation in Cluster-based Wireless Sensor Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.DC","authors_text":"Mario Goldenbaum, Renato L. G. Cavalcante, Slawomir Stanczak, Steffen Limmer","submitted_at":"2013-09-12T12:33:09Z","abstract_excerpt":"This invited paper presents some novel ideas on how to enhance the performance of consensus algorithms in distributed wireless sensor networks, when communication costs are considered. Of particular interest are consensus algorithms that exploit the broadcast property of the wireless channel to boost the performance in terms of convergence speeds. To this end, we propose a novel clustering based consensus algorithm that exploits interference for computation, while reducing the energy consumption in the network. The resulting optimization problem is a semidefinite program, which can be solved o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3139","kind":"arxiv","version":3},"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:43:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NWT0ticLRmw4SWsNuJ8d1kcp/714lrUau6znMtbdkoG8V0cOKwE5LU/xVY5tkzpZDhUkwuqUCO283ZHZllpSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T21:54:52.891026Z"},"content_sha256":"e74402067c79616655363854294596b36c5d2346ad07e87932078c0b0e14cd26","schema_version":"1.0","event_id":"sha256:e74402067c79616655363854294596b36c5d2346ad07e87932078c0b0e14cd26"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DYJXJWN6VYAMU6RHDOYGVOKYUY/bundle.json","state_url":"https://pith.science/pith/DYJXJWN6VYAMU6RHDOYGVOKYUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DYJXJWN6VYAMU6RHDOYGVOKYUY/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-22T21:54:52Z","links":{"resolver":"https://pith.science/pith/DYJXJWN6VYAMU6RHDOYGVOKYUY","bundle":"https://pith.science/pith/DYJXJWN6VYAMU6RHDOYGVOKYUY/bundle.json","state":"https://pith.science/pith/DYJXJWN6VYAMU6RHDOYGVOKYUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DYJXJWN6VYAMU6RHDOYGVOKYUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DYJXJWN6VYAMU6RHDOYGVOKYUY","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":"f4a573a13ef2e570719eb61c60c0de0e112c08925e26c0ef7324193a0a1f6f23","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-12T12:33:09Z","title_canon_sha256":"e78e9c181615a832d0d1b56b4831dce25968a9b5fa081cd35d50e0b46f944044"},"schema_version":"1.0","source":{"id":"1309.3139","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.3139","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"arxiv_version","alias_value":"1309.3139v3","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.3139","created_at":"2026-05-18T02:43:45Z"},{"alias_kind":"pith_short_12","alias_value":"DYJXJWN6VYAM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DYJXJWN6VYAMU6RH","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DYJXJWN6","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:e74402067c79616655363854294596b36c5d2346ad07e87932078c0b0e14cd26","target":"graph","created_at":"2026-05-18T02:43: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":"This invited paper presents some novel ideas on how to enhance the performance of consensus algorithms in distributed wireless sensor networks, when communication costs are considered. Of particular interest are consensus algorithms that exploit the broadcast property of the wireless channel to boost the performance in terms of convergence speeds. To this end, we propose a novel clustering based consensus algorithm that exploits interference for computation, while reducing the energy consumption in the network. The resulting optimization problem is a semidefinite program, which can be solved o","authors_text":"Mario Goldenbaum, Renato L. G. Cavalcante, Slawomir Stanczak, Steffen Limmer","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-12T12:33:09Z","title":"Exploiting Interference for Efficient Distributed Computation in Cluster-based Wireless Sensor Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.3139","kind":"arxiv","version":3},"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:f20bc2d424f7848872b276f2d85647378858f06cebed0017e6352c7f40e602ad","target":"record","created_at":"2026-05-18T02:43: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":"f4a573a13ef2e570719eb61c60c0de0e112c08925e26c0ef7324193a0a1f6f23","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2013-09-12T12:33:09Z","title_canon_sha256":"e78e9c181615a832d0d1b56b4831dce25968a9b5fa081cd35d50e0b46f944044"},"schema_version":"1.0","source":{"id":"1309.3139","kind":"arxiv","version":3}},"canonical_sha256":"1e1374d9beae00ca7a271bb06ab958a63ad93dcffd2df4f39e0ffd52ef6ec18b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1e1374d9beae00ca7a271bb06ab958a63ad93dcffd2df4f39e0ffd52ef6ec18b","first_computed_at":"2026-05-18T02:43:45.492534Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:45.492534Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RVXR73EaqoL92HXi/bh96ATF5SvahPEf6FjUUGndVoQUw6f+hlo/YXZbfevH5NCxJypk7JIV62JUvaWXCLWiAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:45.493017Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.3139","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f20bc2d424f7848872b276f2d85647378858f06cebed0017e6352c7f40e602ad","sha256:e74402067c79616655363854294596b36c5d2346ad07e87932078c0b0e14cd26"],"state_sha256":"db3f1000bea6ef865b4393494c09af13ddd90ff100de164f16ee91671fcf8413"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2mupSrqPkUfdiGKHzXjomBClOTDEh2zDBLUcEFXy0TmbG8k4sL2sk9+yl4NSQzAoq/06woAPUhVET3foVmIMBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T21:54:52.892979Z","bundle_sha256":"b04e499ec8de64a1cb1126545c85fc80938e78dde6d88f67a23e764c149333a3"}}