{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PQK47DHMNZJZCVF3I6CJWVR6YO","short_pith_number":"pith:PQK47DHM","canonical_record":{"source":{"id":"1606.00637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T11:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"2061e1d94ff6a7450eba8741d4c3b93cd01df5ae19df0a5a065443b8e63a4144","abstract_canon_sha256":"10bc43bc0ab8a8cdec5ebc89f4665a4e729cf399f11344b5744f9b6d78bde97e"},"schema_version":"1.0"},"canonical_sha256":"7c15cf8cec6e539154bb47849b563ec39b6b306a88f4f67a302d2fb04426808c","source":{"kind":"arxiv","id":"1606.00637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00637","created_at":"2026-05-18T01:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00637v1","created_at":"2026-05-18T01:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00637","created_at":"2026-05-18T01:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"PQK47DHMNZJZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQK47DHMNZJZCVF3","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQK47DHM","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PQK47DHMNZJZCVF3I6CJWVR6YO","target":"record","payload":{"canonical_record":{"source":{"id":"1606.00637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T11:50:42Z","cross_cats_sorted":[],"title_canon_sha256":"2061e1d94ff6a7450eba8741d4c3b93cd01df5ae19df0a5a065443b8e63a4144","abstract_canon_sha256":"10bc43bc0ab8a8cdec5ebc89f4665a4e729cf399f11344b5744f9b6d78bde97e"},"schema_version":"1.0"},"canonical_sha256":"7c15cf8cec6e539154bb47849b563ec39b6b306a88f4f67a302d2fb04426808c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:03.994582Z","signature_b64":"hF3uWhxptsdid36NtPRBlIGZ/dEw5JDkAAFpXUogJKPgkV2CNcMlgA1NGOujm4s0LDBBGCwChWoC1wLDgGqSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c15cf8cec6e539154bb47849b563ec39b6b306a88f4f67a302d2fb04426808c","last_reissued_at":"2026-05-18T01:13:03.994174Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:03.994174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.00637","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-18T01:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"btt4DCj8BeeRB2Q8G+tfZs8JAxxG6aq6lwvInFHLeR4pL2xtOXXsIkeW6biIHzNmIxlhJcY2Qic8WAvHabZVBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:47:42.608149Z"},"content_sha256":"5c3f98a31183a5fe37f55e7c3e7ece00b29e6b9b25609efe4b8e93849016d3df","schema_version":"1.0","event_id":"sha256:5c3f98a31183a5fe37f55e7c3e7ece00b29e6b9b25609efe4b8e93849016d3df"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PQK47DHMNZJZCVF3I6CJWVR6YO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Maximum-Quality Tree Construction for Deadline-Constrained Aggregation in WSNs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ahmad Khonsari, Bahram Alinia, Mohammad H. Hajiesmaili, Noel Crespi","submitted_at":"2016-06-02T11:50:42Z","abstract_excerpt":"In deadline-constrained wireless sensor networks (WSNs), quality of aggregation (QoA) is determined by the number of participating nodes in the data aggregation process. The previous studies have attempted to propose optimal scheduling algorithms to obtain the maximum QoA assuming a fixed underlying aggregation tree. However, there exists no prior work to address the issue of constructing optimal aggregation tree in deadline-constraints WSNs. The structure of underlying aggregation tree is important since our analysis demonstrates that the ratio between the maximum achievable QoAs of different"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00637","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-18T01:13:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ie3FIDbpqKbA3zzH/+rhldDbhOCqoC6uMnZMbGbxskMxySoWcWVXkuTnFWarAez5Qm7nvBE1HJv7yvSc1o8sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:47:42.608860Z"},"content_sha256":"55908ebbaffbaa4189110b18fc05ad36bd85d3940995738ee2aaa2bf8341589f","schema_version":"1.0","event_id":"sha256:55908ebbaffbaa4189110b18fc05ad36bd85d3940995738ee2aaa2bf8341589f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PQK47DHMNZJZCVF3I6CJWVR6YO/bundle.json","state_url":"https://pith.science/pith/PQK47DHMNZJZCVF3I6CJWVR6YO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PQK47DHMNZJZCVF3I6CJWVR6YO/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-06T22:47:42Z","links":{"resolver":"https://pith.science/pith/PQK47DHMNZJZCVF3I6CJWVR6YO","bundle":"https://pith.science/pith/PQK47DHMNZJZCVF3I6CJWVR6YO/bundle.json","state":"https://pith.science/pith/PQK47DHMNZJZCVF3I6CJWVR6YO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PQK47DHMNZJZCVF3I6CJWVR6YO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PQK47DHMNZJZCVF3I6CJWVR6YO","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":"10bc43bc0ab8a8cdec5ebc89f4665a4e729cf399f11344b5744f9b6d78bde97e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T11:50:42Z","title_canon_sha256":"2061e1d94ff6a7450eba8741d4c3b93cd01df5ae19df0a5a065443b8e63a4144"},"schema_version":"1.0","source":{"id":"1606.00637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.00637","created_at":"2026-05-18T01:13:03Z"},{"alias_kind":"arxiv_version","alias_value":"1606.00637v1","created_at":"2026-05-18T01:13:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.00637","created_at":"2026-05-18T01:13:03Z"},{"alias_kind":"pith_short_12","alias_value":"PQK47DHMNZJZ","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PQK47DHMNZJZCVF3","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PQK47DHM","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:55908ebbaffbaa4189110b18fc05ad36bd85d3940995738ee2aaa2bf8341589f","target":"graph","created_at":"2026-05-18T01:13:03Z","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 wireless sensor networks (WSNs), quality of aggregation (QoA) is determined by the number of participating nodes in the data aggregation process. The previous studies have attempted to propose optimal scheduling algorithms to obtain the maximum QoA assuming a fixed underlying aggregation tree. However, there exists no prior work to address the issue of constructing optimal aggregation tree in deadline-constraints WSNs. The structure of underlying aggregation tree is important since our analysis demonstrates that the ratio between the maximum achievable QoAs of different","authors_text":"Ahmad Khonsari, Bahram Alinia, Mohammad H. Hajiesmaili, Noel Crespi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T11:50:42Z","title":"Maximum-Quality Tree Construction for Deadline-Constrained Aggregation in WSNs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.00637","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:5c3f98a31183a5fe37f55e7c3e7ece00b29e6b9b25609efe4b8e93849016d3df","target":"record","created_at":"2026-05-18T01:13:03Z","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":"10bc43bc0ab8a8cdec5ebc89f4665a4e729cf399f11344b5744f9b6d78bde97e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-06-02T11:50:42Z","title_canon_sha256":"2061e1d94ff6a7450eba8741d4c3b93cd01df5ae19df0a5a065443b8e63a4144"},"schema_version":"1.0","source":{"id":"1606.00637","kind":"arxiv","version":1}},"canonical_sha256":"7c15cf8cec6e539154bb47849b563ec39b6b306a88f4f67a302d2fb04426808c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7c15cf8cec6e539154bb47849b563ec39b6b306a88f4f67a302d2fb04426808c","first_computed_at":"2026-05-18T01:13:03.994174Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:03.994174Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hF3uWhxptsdid36NtPRBlIGZ/dEw5JDkAAFpXUogJKPgkV2CNcMlgA1NGOujm4s0LDBBGCwChWoC1wLDgGqSDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:03.994582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.00637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c3f98a31183a5fe37f55e7c3e7ece00b29e6b9b25609efe4b8e93849016d3df","sha256:55908ebbaffbaa4189110b18fc05ad36bd85d3940995738ee2aaa2bf8341589f"],"state_sha256":"0d2df5d34377fa99996ca32c4dc15d23176e500df5d37349df2a6e50a8ed272d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KKp5ZguIIyAXBXlRq0gV+lYzb64ajFnv5Zib1pPs8oOWO5itwhJTddUTqBADBAPxfL9E+9LgaNSsFGuyAKXPAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:47:42.612367Z","bundle_sha256":"9c57f220f8a270fe5d855a42a3144be7a8f3e38e291fbca0a653aaae8889dc80"}}