{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:G37QFFQZLRQF5IRB5NKYKJL3CP","short_pith_number":"pith:G37QFFQZ","canonical_record":{"source":{"id":"1601.03147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-13T07:17:41Z","cross_cats_sorted":[],"title_canon_sha256":"6dc972bc458984242b302825530faac73ef12e80bbfde456bd3da280bc169bcd","abstract_canon_sha256":"bf99550098be2b021be81ea7c7d3c664f8da892d0ee08af620a3ec98404a33b8"},"schema_version":"1.0"},"canonical_sha256":"36ff0296195c605ea221eb5585257b13db1d4a6c038dbb24d35a1c328a980177","source":{"kind":"arxiv","id":"1601.03147","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03147","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03147v2","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03147","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"G37QFFQZLRQF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G37QFFQZLRQF5IRB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G37QFFQZ","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:G37QFFQZLRQF5IRB5NKYKJL3CP","target":"record","payload":{"canonical_record":{"source":{"id":"1601.03147","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-13T07:17:41Z","cross_cats_sorted":[],"title_canon_sha256":"6dc972bc458984242b302825530faac73ef12e80bbfde456bd3da280bc169bcd","abstract_canon_sha256":"bf99550098be2b021be81ea7c7d3c664f8da892d0ee08af620a3ec98404a33b8"},"schema_version":"1.0"},"canonical_sha256":"36ff0296195c605ea221eb5585257b13db1d4a6c038dbb24d35a1c328a980177","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:35.468677Z","signature_b64":"m0o3ckmXNdsGyOlpLy1UXPmqqGonXnAY4aUTwLRLXGwb3R8LAwQG4uEBixgwuAGokenq03ti8wkIA1TrWwjQDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36ff0296195c605ea221eb5585257b13db1d4a6c038dbb24d35a1c328a980177","last_reissued_at":"2026-05-18T00:34:35.468287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:35.468287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1601.03147","source_version":2,"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-18T00:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eN12aUlVUC2+7bDiEEZrdGo9WDB0ZN8ar7lb4biD4TbB0AMDESibaTDFNHBM3tSpQrQUF/SDV4eJ2NKkcnCeCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:54:58.213109Z"},"content_sha256":"d5555aa5db746984e58097cf4a4337ea7e0f343bca23cc99c89947ac9fcf0e9c","schema_version":"1.0","event_id":"sha256:d5555aa5db746984e58097cf4a4337ea7e0f343bca23cc99c89947ac9fcf0e9c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:G37QFFQZLRQF5IRB5NKYKJL3CP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Algorithms for Information Aggregation from Distributed and Correlated Sources","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NI","authors_text":"Chi-Kin Chau, Majid Khonji, Muhammad Aftab","submitted_at":"2016-01-13T07:17:41Z","abstract_excerpt":"There is a fundamental trade-off between the communication cost and latency in information aggregation. Aggregating multiple communication messages over time can alleviate overhead and improve energy efficiency on one hand, but inevitably incurs information delay on the other hand. In the presence of uncertain future inputs, this trade-off should be balanced in an online manner, which is studied by the classical dynamic TCP ACK problem for a single information source. In this paper, we extend dynamic TCP ACK problem to a general setting of collecting aggregate information from distributed and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03147","kind":"arxiv","version":2},"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-18T00:34:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jhvUdNpdEpv8DeX2Uq0GmKPgfN5poPgeHXz4poX2/AsXxPi+PgSg2FniK3B/qLEGB4dM+NxAhQXNPaQLHMbiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:54:58.213461Z"},"content_sha256":"bf43cca818bf03972e57cb5db86abd8d1c2d0571c08737ac5ca3a4436ff4ca9d","schema_version":"1.0","event_id":"sha256:bf43cca818bf03972e57cb5db86abd8d1c2d0571c08737ac5ca3a4436ff4ca9d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G37QFFQZLRQF5IRB5NKYKJL3CP/bundle.json","state_url":"https://pith.science/pith/G37QFFQZLRQF5IRB5NKYKJL3CP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G37QFFQZLRQF5IRB5NKYKJL3CP/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-01T15:54:58Z","links":{"resolver":"https://pith.science/pith/G37QFFQZLRQF5IRB5NKYKJL3CP","bundle":"https://pith.science/pith/G37QFFQZLRQF5IRB5NKYKJL3CP/bundle.json","state":"https://pith.science/pith/G37QFFQZLRQF5IRB5NKYKJL3CP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G37QFFQZLRQF5IRB5NKYKJL3CP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:G37QFFQZLRQF5IRB5NKYKJL3CP","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":"bf99550098be2b021be81ea7c7d3c664f8da892d0ee08af620a3ec98404a33b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-13T07:17:41Z","title_canon_sha256":"6dc972bc458984242b302825530faac73ef12e80bbfde456bd3da280bc169bcd"},"schema_version":"1.0","source":{"id":"1601.03147","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.03147","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"arxiv_version","alias_value":"1601.03147v2","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.03147","created_at":"2026-05-18T00:34:35Z"},{"alias_kind":"pith_short_12","alias_value":"G37QFFQZLRQF","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"G37QFFQZLRQF5IRB","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"G37QFFQZ","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:bf43cca818bf03972e57cb5db86abd8d1c2d0571c08737ac5ca3a4436ff4ca9d","target":"graph","created_at":"2026-05-18T00:34:35Z","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":"There is a fundamental trade-off between the communication cost and latency in information aggregation. Aggregating multiple communication messages over time can alleviate overhead and improve energy efficiency on one hand, but inevitably incurs information delay on the other hand. In the presence of uncertain future inputs, this trade-off should be balanced in an online manner, which is studied by the classical dynamic TCP ACK problem for a single information source. In this paper, we extend dynamic TCP ACK problem to a general setting of collecting aggregate information from distributed and ","authors_text":"Chi-Kin Chau, Majid Khonji, Muhammad Aftab","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-13T07:17:41Z","title":"Online Algorithms for Information Aggregation from Distributed and Correlated Sources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.03147","kind":"arxiv","version":2},"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:d5555aa5db746984e58097cf4a4337ea7e0f343bca23cc99c89947ac9fcf0e9c","target":"record","created_at":"2026-05-18T00:34:35Z","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":"bf99550098be2b021be81ea7c7d3c664f8da892d0ee08af620a3ec98404a33b8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NI","submitted_at":"2016-01-13T07:17:41Z","title_canon_sha256":"6dc972bc458984242b302825530faac73ef12e80bbfde456bd3da280bc169bcd"},"schema_version":"1.0","source":{"id":"1601.03147","kind":"arxiv","version":2}},"canonical_sha256":"36ff0296195c605ea221eb5585257b13db1d4a6c038dbb24d35a1c328a980177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36ff0296195c605ea221eb5585257b13db1d4a6c038dbb24d35a1c328a980177","first_computed_at":"2026-05-18T00:34:35.468287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:35.468287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m0o3ckmXNdsGyOlpLy1UXPmqqGonXnAY4aUTwLRLXGwb3R8LAwQG4uEBixgwuAGokenq03ti8wkIA1TrWwjQDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:35.468677Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.03147","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5555aa5db746984e58097cf4a4337ea7e0f343bca23cc99c89947ac9fcf0e9c","sha256:bf43cca818bf03972e57cb5db86abd8d1c2d0571c08737ac5ca3a4436ff4ca9d"],"state_sha256":"61758dd4cdd033d60bc103e99d365b59a9203936a2565541f515562bd6d28ddc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FQrZukl/vNFZBFuf6gFGEe1wLUhXQhycq3/s/HG7FSQubmSb1pwPbe/CrytSgUqGsUsWywRy7AP4wDoKf5Q4BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:54:58.215283Z","bundle_sha256":"292855ef57f0bd03d3d79348b23f47b22c5b1d550e43515f646d91637db65450"}}