{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:M5AG5VXCHFIP3JGIFGNJQGBETY","short_pith_number":"pith:M5AG5VXC","canonical_record":{"source":{"id":"1405.0597","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"7edc92b20ba86eea8bbbd0da7216a6538258509c65687b51d3758f7c96fb339f","abstract_canon_sha256":"041b9e6c56522c019ad206e12b340986a0b2b848660c32c17c4e9e22b26ce0cc"},"schema_version":"1.0"},"canonical_sha256":"67406ed6e23950fda4c8299a9818249e31441235db826b81a99741a2fa82fa4f","source":{"kind":"arxiv","id":"1405.0597","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0597","created_at":"2026-05-18T02:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0597v3","created_at":"2026-05-18T02:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0597","created_at":"2026-05-18T02:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"M5AG5VXCHFIP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M5AG5VXCHFIP3JGI","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M5AG5VXC","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:M5AG5VXCHFIP3JGIFGNJQGBETY","target":"record","payload":{"canonical_record":{"source":{"id":"1405.0597","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:59:21Z","cross_cats_sorted":[],"title_canon_sha256":"7edc92b20ba86eea8bbbd0da7216a6538258509c65687b51d3758f7c96fb339f","abstract_canon_sha256":"041b9e6c56522c019ad206e12b340986a0b2b848660c32c17c4e9e22b26ce0cc"},"schema_version":"1.0"},"canonical_sha256":"67406ed6e23950fda4c8299a9818249e31441235db826b81a99741a2fa82fa4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:05.971137Z","signature_b64":"xSTdkOJ1H1VIHA+Vik+hLAOG/U2qfi9eeNbk0KEI7iMsyKw1xpBLa73vABZZQxJTgyw4qTRY0By+ZlkMjc7hDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67406ed6e23950fda4c8299a9818249e31441235db826b81a99741a2fa82fa4f","last_reissued_at":"2026-05-18T02:46:05.970591Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:05.970591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.0597","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:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WNEa9p/XZrGojUHuWRCbkqrupgQ2O6UhW4/QTKwN/ghAeY63GWUOuaIXrNscsWyae5g9GvydaDFelDtcUhjLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:03:51.387214Z"},"content_sha256":"ebbf67b6cc518d30eb14b7800a3a4107154417d9dea99229255ce78c023a19a1","schema_version":"1.0","event_id":"sha256:ebbf67b6cc518d30eb14b7800a3a4107154417d9dea99229255ce78c023a19a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:M5AG5VXCHFIP3JGIFGNJQGBETY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Construction of Maximum-Quality Aggregation Trees in Deadline-Constrained WSNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Ahmad Khonsari, Bahram Alinia, Mohammad H. Hajiesmaili","submitted_at":"2014-05-03T14:59:21Z","abstract_excerpt":"In deadline-constrained data aggregation in wireless sensor networks (WSNs), the imposed sink deadline along with the interference constraint hinders participation of all sensor nodes in data aggregation. Thus, exploiting the wisdom of the crowd paradigm, the total number of participant nodes in data aggregation determines the quality of aggregation ($QoA$). Although the previous studies have proposed optimal algorithms to maximize $QoA$ under an imposed deadline and a given aggregation tree, there is no work on constructing optimal tree in this context. In this paper, we cast an optimization "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0597","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:46:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3EO8ouFXBFfY5d4cDCUb2yRmJEIE7a8uQgXdswEMj39cb2S1JPPW6a6NprcZcJRkVdVyQHPu1IHyVfg+JxE7Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:03:51.387927Z"},"content_sha256":"e59ccb88efa989465d6ffe7992779e7162318c82a4d4f16f52eee99eae80b077","schema_version":"1.0","event_id":"sha256:e59ccb88efa989465d6ffe7992779e7162318c82a4d4f16f52eee99eae80b077"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5AG5VXCHFIP3JGIFGNJQGBETY/bundle.json","state_url":"https://pith.science/pith/M5AG5VXCHFIP3JGIFGNJQGBETY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5AG5VXCHFIP3JGIFGNJQGBETY/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-07T22:03:51Z","links":{"resolver":"https://pith.science/pith/M5AG5VXCHFIP3JGIFGNJQGBETY","bundle":"https://pith.science/pith/M5AG5VXCHFIP3JGIFGNJQGBETY/bundle.json","state":"https://pith.science/pith/M5AG5VXCHFIP3JGIFGNJQGBETY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5AG5VXCHFIP3JGIFGNJQGBETY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:M5AG5VXCHFIP3JGIFGNJQGBETY","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":"041b9e6c56522c019ad206e12b340986a0b2b848660c32c17c4e9e22b26ce0cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:59:21Z","title_canon_sha256":"7edc92b20ba86eea8bbbd0da7216a6538258509c65687b51d3758f7c96fb339f"},"schema_version":"1.0","source":{"id":"1405.0597","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.0597","created_at":"2026-05-18T02:46:05Z"},{"alias_kind":"arxiv_version","alias_value":"1405.0597v3","created_at":"2026-05-18T02:46:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.0597","created_at":"2026-05-18T02:46:05Z"},{"alias_kind":"pith_short_12","alias_value":"M5AG5VXCHFIP","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"M5AG5VXCHFIP3JGI","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"M5AG5VXC","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:e59ccb88efa989465d6ffe7992779e7162318c82a4d4f16f52eee99eae80b077","target":"graph","created_at":"2026-05-18T02:46: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":"In deadline-constrained data aggregation in wireless sensor networks (WSNs), the imposed sink deadline along with the interference constraint hinders participation of all sensor nodes in data aggregation. Thus, exploiting the wisdom of the crowd paradigm, the total number of participant nodes in data aggregation determines the quality of aggregation ($QoA$). Although the previous studies have proposed optimal algorithms to maximize $QoA$ under an imposed deadline and a given aggregation tree, there is no work on constructing optimal tree in this context. In this paper, we cast an optimization ","authors_text":"Ahmad Khonsari, Bahram Alinia, Mohammad H. Hajiesmaili","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:59:21Z","title":"On the Construction of Maximum-Quality Aggregation Trees in Deadline-Constrained WSNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.0597","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:ebbf67b6cc518d30eb14b7800a3a4107154417d9dea99229255ce78c023a19a1","target":"record","created_at":"2026-05-18T02:46: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":"041b9e6c56522c019ad206e12b340986a0b2b848660c32c17c4e9e22b26ce0cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2014-05-03T14:59:21Z","title_canon_sha256":"7edc92b20ba86eea8bbbd0da7216a6538258509c65687b51d3758f7c96fb339f"},"schema_version":"1.0","source":{"id":"1405.0597","kind":"arxiv","version":3}},"canonical_sha256":"67406ed6e23950fda4c8299a9818249e31441235db826b81a99741a2fa82fa4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67406ed6e23950fda4c8299a9818249e31441235db826b81a99741a2fa82fa4f","first_computed_at":"2026-05-18T02:46:05.970591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:46:05.970591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xSTdkOJ1H1VIHA+Vik+hLAOG/U2qfi9eeNbk0KEI7iMsyKw1xpBLa73vABZZQxJTgyw4qTRY0By+ZlkMjc7hDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:46:05.971137Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.0597","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ebbf67b6cc518d30eb14b7800a3a4107154417d9dea99229255ce78c023a19a1","sha256:e59ccb88efa989465d6ffe7992779e7162318c82a4d4f16f52eee99eae80b077"],"state_sha256":"d7414fd90cc7451dd00d129c0cc8dcd9c862c1328fa8656daeb9f0d9d9cfc088"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9vPfyqRRWBgZ1xtSlebF7y4H0FCH/qJ5K4zNgKTikoa2U4aKntQo5FdLwZKWI4W/o+GRPHvp1MnK+5llSoiLBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:03:51.391348Z","bundle_sha256":"0eec2e4399e782030ee3c8fc03ff178fcfface1934205379a1f90bb13c524983"}}