{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OIKGXU5PDR6CLHLQLBU7DPV3FV","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":"63c3da6bce543a9eddd9c33f6c55f688edbdd8b477ef7cd840c24d031256844e","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-01-19T02:11:47Z","title_canon_sha256":"27e8b32606b0aa3b18053f6116fcc25bfe915f56db43b5015d95b923d0eab1e1"},"schema_version":"1.0","source":{"id":"2301.07849","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2301.07849","created_at":"2026-07-05T10:37:19Z"},{"alias_kind":"arxiv_version","alias_value":"2301.07849v5","created_at":"2026-07-05T10:37:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.07849","created_at":"2026-07-05T10:37:19Z"},{"alias_kind":"pith_short_12","alias_value":"OIKGXU5PDR6C","created_at":"2026-07-05T10:37:19Z"},{"alias_kind":"pith_short_16","alias_value":"OIKGXU5PDR6CLHLQ","created_at":"2026-07-05T10:37:19Z"},{"alias_kind":"pith_short_8","alias_value":"OIKGXU5P","created_at":"2026-07-05T10:37:19Z"}],"graph_snapshots":[{"event_id":"sha256:a66648f3779cf6247f3c4b8d018c3ee47ebe04d85511d0486cad416136e811c8","target":"graph","created_at":"2026-07-05T10:37:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2301.07849/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"An anonymous dynamic network is a network of indistinguishable processes whose communication links may appear or disappear unpredictably over time. Previous research has shown that deterministically computing an arbitrary function of a multiset of input values given to these processes takes only a linear number of communication rounds (Di Luna-Viglietta, FOCS 2022).\n  However, fast algorithms for anonymous dynamic networks rely on the construction and transmission of large data structures called \"history trees\", whose size is polynomial in the number of processes. This approach is unfeasible i","authors_text":"Giovanni Viglietta, Giuseppe A. Di Luna","cross_cats":["cs.DM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-01-19T02:11:47Z","title":"Efficient Computation in Congested Anonymous Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.07849","kind":"arxiv","version":5},"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:cacc46494f7c539eeb50740d8ba006c922f02a32e2f5f9ae19d0d1b15f251b77","target":"record","created_at":"2026-07-05T10:37:19Z","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":"63c3da6bce543a9eddd9c33f6c55f688edbdd8b477ef7cd840c24d031256844e","cross_cats_sorted":["cs.DM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2023-01-19T02:11:47Z","title_canon_sha256":"27e8b32606b0aa3b18053f6116fcc25bfe915f56db43b5015d95b923d0eab1e1"},"schema_version":"1.0","source":{"id":"2301.07849","kind":"arxiv","version":5}},"canonical_sha256":"72146bd3af1c7c259d705869f1bebb2d7aa355b615824579e98c19be0b422284","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72146bd3af1c7c259d705869f1bebb2d7aa355b615824579e98c19be0b422284","first_computed_at":"2026-07-05T10:37:19.818538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:37:19.818538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yu5Q3cPwDjneXc7ziDMzFWXtHS7FjiYSWSEZ8teSqOztEuMa4PMeJufymIcV+Z0+zDO5R3Mp25pocmMZeph2DA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:37:19.819165Z","signed_message":"canonical_sha256_bytes"},"source_id":"2301.07849","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cacc46494f7c539eeb50740d8ba006c922f02a32e2f5f9ae19d0d1b15f251b77","sha256:a66648f3779cf6247f3c4b8d018c3ee47ebe04d85511d0486cad416136e811c8"],"state_sha256":"62e6bf831643d06c93f843969774cf9585bcaa1a72003bb1586e7e28f92b2528"}