{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UPF5JW66O76CHK4X57RAMQ64ZQ","short_pith_number":"pith:UPF5JW66","schema_version":"1.0","canonical_sha256":"a3cbd4dbde77fc23ab97efe20643dccc06ef8aed2f089abc0e882ef8d9ac0e6a","source":{"kind":"arxiv","id":"1802.01789","version":1},"attestation_state":"computed","paper":{"title":"Resilient Blocks for Summarising Distributed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giorgio Audrito (1), Sergio Bergamini (1) ((1) University of Torino)","submitted_at":"2018-02-06T04:10:02Z","abstract_excerpt":"Summarising distributed data is a central routine for parallel programming, lying at the core of widely used frameworks such as the map/reduce paradigm. In the IoT context it is even more crucial, being a privileged mean to allow long-range interactions: in fact, summarising is needed to avoid data explosion in each computational unit.\n  We introduce a new algorithm for dynamic summarising of distributed data, weighted multi-path, improving over the state-of-the-art multi-path algorithm. We validate the new algorithm in an archetypal scenario, taking into account sources of volatility of many "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1802.01789","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-02-06T04:10:02Z","cross_cats_sorted":[],"title_canon_sha256":"83c746fb39a65b2ceafdc5989aaf0a72e818cb7252a0835c807cec566aa2c128","abstract_canon_sha256":"0a88bd87b04c4a3b5e7a536d19f3f71e23d997bf7812b36eb5c6e73c37ab03c3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:21.278765Z","signature_b64":"CgxLXqrT2GCGeoVwUcFPX9mH3ZV2mDj22CTJG4m3f/Cby09dAqkcmH6d9X7TabeErzhnEfqt+oZAbMEMIWyHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3cbd4dbde77fc23ab97efe20643dccc06ef8aed2f089abc0e882ef8d9ac0e6a","last_reissued_at":"2026-05-18T00:24:21.278311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:21.278311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resilient Blocks for Summarising Distributed Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Giorgio Audrito (1), Sergio Bergamini (1) ((1) University of Torino)","submitted_at":"2018-02-06T04:10:02Z","abstract_excerpt":"Summarising distributed data is a central routine for parallel programming, lying at the core of widely used frameworks such as the map/reduce paradigm. In the IoT context it is even more crucial, being a privileged mean to allow long-range interactions: in fact, summarising is needed to avoid data explosion in each computational unit.\n  We introduce a new algorithm for dynamic summarising of distributed data, weighted multi-path, improving over the state-of-the-art multi-path algorithm. We validate the new algorithm in an archetypal scenario, taking into account sources of volatility of many "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01789","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1802.01789","created_at":"2026-05-18T00:24:21.278394+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.01789v1","created_at":"2026-05-18T00:24:21.278394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01789","created_at":"2026-05-18T00:24:21.278394+00:00"},{"alias_kind":"pith_short_12","alias_value":"UPF5JW66O76C","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UPF5JW66O76CHK4X","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UPF5JW66","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ","json":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ.json","graph_json":"https://pith.science/api/pith-number/UPF5JW66O76CHK4X57RAMQ64ZQ/graph.json","events_json":"https://pith.science/api/pith-number/UPF5JW66O76CHK4X57RAMQ64ZQ/events.json","paper":"https://pith.science/paper/UPF5JW66"},"agent_actions":{"view_html":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ","download_json":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ.json","view_paper":"https://pith.science/paper/UPF5JW66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.01789&json=true","fetch_graph":"https://pith.science/api/pith-number/UPF5JW66O76CHK4X57RAMQ64ZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/UPF5JW66O76CHK4X57RAMQ64ZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ/action/storage_attestation","attest_author":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ/action/author_attestation","sign_citation":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ/action/citation_signature","submit_replication":"https://pith.science/pith/UPF5JW66O76CHK4X57RAMQ64ZQ/action/replication_record"}},"created_at":"2026-05-18T00:24:21.278394+00:00","updated_at":"2026-05-18T00:24:21.278394+00:00"}