{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2KAUG6CXHBFTJVXSGN36JZGBJH","short_pith_number":"pith:2KAUG6CX","canonical_record":{"source":{"id":"1602.01065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-02T19:58:11Z","cross_cats_sorted":["cs.CC","cs.NI"],"title_canon_sha256":"5467d85d177d9a8bc6592d377672358c1cf7d5023dbf6a51e2db08206e202eca","abstract_canon_sha256":"3e37fa616f509cf0903954f9780ee3eece9009530a91168f6dacf8be31e1e4d1"},"schema_version":"1.0"},"canonical_sha256":"d281437857384b34d6f23377e4e4c149f70fa4dae8f585f2bd231da0f25e5469","source":{"kind":"arxiv","id":"1602.01065","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01065","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01065v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01065","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"2KAUG6CXHBFT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KAUG6CXHBFTJVXS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KAUG6CX","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2KAUG6CXHBFTJVXSGN36JZGBJH","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01065","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-02T19:58:11Z","cross_cats_sorted":["cs.CC","cs.NI"],"title_canon_sha256":"5467d85d177d9a8bc6592d377672358c1cf7d5023dbf6a51e2db08206e202eca","abstract_canon_sha256":"3e37fa616f509cf0903954f9780ee3eece9009530a91168f6dacf8be31e1e4d1"},"schema_version":"1.0"},"canonical_sha256":"d281437857384b34d6f23377e4e4c149f70fa4dae8f585f2bd231da0f25e5469","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:59.205462Z","signature_b64":"YJp2CfcXdYpjqm7z/hoU8tAY7xsV7LcCW9IhzxHv3B0VUpzU7qCCYQ5/CKPKusY3LNZbzlJXjNCbx4ivZPlAAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d281437857384b34d6f23377e4e4c149f70fa4dae8f585f2bd231da0f25e5469","last_reissued_at":"2026-05-18T01:02:59.204980Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:59.204980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01065","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-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HDLTHbQhBecYslgHfO/M6QR8j/3ee+msr68N9doZODkdLIk3mZT1l3fGsgjUD57jx+d7dcWQtos5nwBCEa0MDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:57:04.747243Z"},"content_sha256":"c28327f6c33b6a765cec8526c0b173b0ed1cdeb26fa38993a9d5571f0a850280","schema_version":"1.0","event_id":"sha256:c28327f6c33b6a765cec8526c0b173b0ed1cdeb26fa38993a9d5571f0a850280"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2KAUG6CXHBFTJVXSGN36JZGBJH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Online Data Aggregation in Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.NI"],"primary_cat":"cs.DC","authors_text":"Computer sciences Osaka University), LINCS), LIP6, Quentin Bramas (NPA, S\\'ebastien Tixeuil (NPA, Toshimitsu Masuzawa (Department of Information, UPMC","submitted_at":"2016-02-02T19:58:11Z","abstract_excerpt":"We consider the problem of aggregating data in a dynamic graph, that is, aggregating the data that originates from all nodes in the graph to a specific node, the sink. We are interested in giving lower bounds for this problem, under different kinds of adversaries. In our model, nodes are endowed with unlimited memory and unlimited computational power. Yet, we assume that communications between nodes are carried out with pairwise interactions, where nodes can exchange control information before deciding whether they transmit their data or not, given that each node is allowed to transmit its dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01065","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-18T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M0zIB5v/0idx/SsW4aXNfO/yE6cjhvt5VWFHVrB+Lo7TM/5/3XcsTdvTI0SXxyznzm4qDVlduWIFaML0hZJzDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T16:57:04.747614Z"},"content_sha256":"f8961fa4b4e3f736a4b9c08a9e14ce903e771b114f6461f6432f43848b40fab9","schema_version":"1.0","event_id":"sha256:f8961fa4b4e3f736a4b9c08a9e14ce903e771b114f6461f6432f43848b40fab9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2KAUG6CXHBFTJVXSGN36JZGBJH/bundle.json","state_url":"https://pith.science/pith/2KAUG6CXHBFTJVXSGN36JZGBJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2KAUG6CXHBFTJVXSGN36JZGBJH/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-30T16:57:04Z","links":{"resolver":"https://pith.science/pith/2KAUG6CXHBFTJVXSGN36JZGBJH","bundle":"https://pith.science/pith/2KAUG6CXHBFTJVXSGN36JZGBJH/bundle.json","state":"https://pith.science/pith/2KAUG6CXHBFTJVXSGN36JZGBJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2KAUG6CXHBFTJVXSGN36JZGBJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2KAUG6CXHBFTJVXSGN36JZGBJH","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":"3e37fa616f509cf0903954f9780ee3eece9009530a91168f6dacf8be31e1e4d1","cross_cats_sorted":["cs.CC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-02T19:58:11Z","title_canon_sha256":"5467d85d177d9a8bc6592d377672358c1cf7d5023dbf6a51e2db08206e202eca"},"schema_version":"1.0","source":{"id":"1602.01065","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01065","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01065v2","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01065","created_at":"2026-05-18T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"2KAUG6CXHBFT","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2KAUG6CXHBFTJVXS","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2KAUG6CX","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:f8961fa4b4e3f736a4b9c08a9e14ce903e771b114f6461f6432f43848b40fab9","target":"graph","created_at":"2026-05-18T01:02:59Z","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 consider the problem of aggregating data in a dynamic graph, that is, aggregating the data that originates from all nodes in the graph to a specific node, the sink. We are interested in giving lower bounds for this problem, under different kinds of adversaries. In our model, nodes are endowed with unlimited memory and unlimited computational power. Yet, we assume that communications between nodes are carried out with pairwise interactions, where nodes can exchange control information before deciding whether they transmit their data or not, given that each node is allowed to transmit its dat","authors_text":"Computer sciences Osaka University), LINCS), LIP6, Quentin Bramas (NPA, S\\'ebastien Tixeuil (NPA, Toshimitsu Masuzawa (Department of Information, UPMC","cross_cats":["cs.CC","cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-02T19:58:11Z","title":"Distributed Online Data Aggregation in Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01065","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:c28327f6c33b6a765cec8526c0b173b0ed1cdeb26fa38993a9d5571f0a850280","target":"record","created_at":"2026-05-18T01:02:59Z","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":"3e37fa616f509cf0903954f9780ee3eece9009530a91168f6dacf8be31e1e4d1","cross_cats_sorted":["cs.CC","cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-02T19:58:11Z","title_canon_sha256":"5467d85d177d9a8bc6592d377672358c1cf7d5023dbf6a51e2db08206e202eca"},"schema_version":"1.0","source":{"id":"1602.01065","kind":"arxiv","version":2}},"canonical_sha256":"d281437857384b34d6f23377e4e4c149f70fa4dae8f585f2bd231da0f25e5469","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d281437857384b34d6f23377e4e4c149f70fa4dae8f585f2bd231da0f25e5469","first_computed_at":"2026-05-18T01:02:59.204980Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:59.204980Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YJp2CfcXdYpjqm7z/hoU8tAY7xsV7LcCW9IhzxHv3B0VUpzU7qCCYQ5/CKPKusY3LNZbzlJXjNCbx4ivZPlAAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:59.205462Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01065","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c28327f6c33b6a765cec8526c0b173b0ed1cdeb26fa38993a9d5571f0a850280","sha256:f8961fa4b4e3f736a4b9c08a9e14ce903e771b114f6461f6432f43848b40fab9"],"state_sha256":"e2a98da504d37fd8b50defda7154a9f4122d0d52fa3a83e1684a95ea7389bc72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uFj8glzp6VCFG0R/GLMiJtE44YxeOwxFeFQYmnhoWsVoaPXN9As2V2pHRaLTBxTk+aru2H5yPLJMRQeAM4cUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T16:57:04.749672Z","bundle_sha256":"f9b37b2657d183e383f1f4f2213f39dc31364bd92bfec40307d87296435173c6"}}