{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZESG3TNMO2HGXN66N5QRJWAU6I","short_pith_number":"pith:ZESG3TNM","canonical_record":{"source":{"id":"2009.13006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-28T01:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"783157fd333d60623b8e171377fbdb376d423368fc1965fe32f97b9bd56aff66","abstract_canon_sha256":"3e81524cfd881e7703a083b097a048a16e72967dda77f5c721a1cf1056d3b8ef"},"schema_version":"1.0"},"canonical_sha256":"c9246dcdac768e6bb7de6f6114d814f22672673dbc13a60aa0f28699b4685263","source":{"kind":"arxiv","id":"2009.13006","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.13006","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"arxiv_version","alias_value":"2009.13006v1","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.13006","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZESG3TNMO2HG","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZESG3TNMO2HGXN66","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZESG3TNM","created_at":"2026-07-05T01:38:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZESG3TNMO2HGXN66N5QRJWAU6I","target":"record","payload":{"canonical_record":{"source":{"id":"2009.13006","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-28T01:29:12Z","cross_cats_sorted":[],"title_canon_sha256":"783157fd333d60623b8e171377fbdb376d423368fc1965fe32f97b9bd56aff66","abstract_canon_sha256":"3e81524cfd881e7703a083b097a048a16e72967dda77f5c721a1cf1056d3b8ef"},"schema_version":"1.0"},"canonical_sha256":"c9246dcdac768e6bb7de6f6114d814f22672673dbc13a60aa0f28699b4685263","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:25.634995Z","signature_b64":"VMXcFJLRADpgdWpmk+ShiwoyU1mQrz8zPErRmKd/U31Bepd+JmUhyPLQ/PTkEdUmfabqy8lXy5Dqw+RBJtLwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9246dcdac768e6bb7de6f6114d814f22672673dbc13a60aa0f28699b4685263","last_reissued_at":"2026-07-05T01:38:25.634588Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:25.634588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.13006","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-07-05T01:38:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cssH6xoMreXQShx/eNCX8FCJ672IbLJDIEPijEp6K3HXOeOdFUidFCucvw17hY0SZGvNRDtuvm3LFT72HyR3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:55:54.426898Z"},"content_sha256":"b0588d887e0f7abf1de80b6619d876c2334b0e674663356dac76c05bf46cb885","schema_version":"1.0","event_id":"sha256:b0588d887e0f7abf1de80b6619d876c2334b0e674663356dac76c05bf46cb885"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZESG3TNMO2HGXN66N5QRJWAU6I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Models of Smoothing in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ami Paz, Gregory Schwartzman, Uri Meir","submitted_at":"2020-09-28T01:29:12Z","abstract_excerpt":"Smoothed analysis is a framework suggested for mediating gaps between worst-case and average-case complexities. In a recent work, Dinitz et al.~[Distributed Computing, 2018] suggested to use smoothed analysis in order to study dynamic networks. Their aim was to explain the gaps between real-world networks that function well despite being dynamic, and the strong theoretical lower bounds for arbitrary networks. To this end, they introduced a basic model of smoothing in dynamic networks, where an adversary picks a sequence of graphs, representing the topology of the network over time, and then ea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.13006","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.13006/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:38:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HaYLvzY67h6K6mO+9pwU4KdL/qXwBwHET//brjk71fEBOHBnAkMvkw/5VPNbQVGOLn47bNw1ddUrYyQKaxjlDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T15:55:54.427556Z"},"content_sha256":"a294233ab587e265735abbcb7646d667e3fe173d609515311c02c20ab17fadd3","schema_version":"1.0","event_id":"sha256:a294233ab587e265735abbcb7646d667e3fe173d609515311c02c20ab17fadd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZESG3TNMO2HGXN66N5QRJWAU6I/bundle.json","state_url":"https://pith.science/pith/ZESG3TNMO2HGXN66N5QRJWAU6I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZESG3TNMO2HGXN66N5QRJWAU6I/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-08-14T15:55:54Z","links":{"resolver":"https://pith.science/pith/ZESG3TNMO2HGXN66N5QRJWAU6I","bundle":"https://pith.science/pith/ZESG3TNMO2HGXN66N5QRJWAU6I/bundle.json","state":"https://pith.science/pith/ZESG3TNMO2HGXN66N5QRJWAU6I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZESG3TNMO2HGXN66N5QRJWAU6I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZESG3TNMO2HGXN66N5QRJWAU6I","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":"3e81524cfd881e7703a083b097a048a16e72967dda77f5c721a1cf1056d3b8ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-28T01:29:12Z","title_canon_sha256":"783157fd333d60623b8e171377fbdb376d423368fc1965fe32f97b9bd56aff66"},"schema_version":"1.0","source":{"id":"2009.13006","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.13006","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"arxiv_version","alias_value":"2009.13006v1","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.13006","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZESG3TNMO2HG","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"pith_short_16","alias_value":"ZESG3TNMO2HGXN66","created_at":"2026-07-05T01:38:25Z"},{"alias_kind":"pith_short_8","alias_value":"ZESG3TNM","created_at":"2026-07-05T01:38:25Z"}],"graph_snapshots":[{"event_id":"sha256:a294233ab587e265735abbcb7646d667e3fe173d609515311c02c20ab17fadd3","target":"graph","created_at":"2026-07-05T01:38:25Z","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/2009.13006/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Smoothed analysis is a framework suggested for mediating gaps between worst-case and average-case complexities. In a recent work, Dinitz et al.~[Distributed Computing, 2018] suggested to use smoothed analysis in order to study dynamic networks. Their aim was to explain the gaps between real-world networks that function well despite being dynamic, and the strong theoretical lower bounds for arbitrary networks. To this end, they introduced a basic model of smoothing in dynamic networks, where an adversary picks a sequence of graphs, representing the topology of the network over time, and then ea","authors_text":"Ami Paz, Gregory Schwartzman, Uri Meir","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-28T01:29:12Z","title":"Models of Smoothing in Dynamic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.13006","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:b0588d887e0f7abf1de80b6619d876c2334b0e674663356dac76c05bf46cb885","target":"record","created_at":"2026-07-05T01:38:25Z","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":"3e81524cfd881e7703a083b097a048a16e72967dda77f5c721a1cf1056d3b8ef","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-28T01:29:12Z","title_canon_sha256":"783157fd333d60623b8e171377fbdb376d423368fc1965fe32f97b9bd56aff66"},"schema_version":"1.0","source":{"id":"2009.13006","kind":"arxiv","version":1}},"canonical_sha256":"c9246dcdac768e6bb7de6f6114d814f22672673dbc13a60aa0f28699b4685263","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9246dcdac768e6bb7de6f6114d814f22672673dbc13a60aa0f28699b4685263","first_computed_at":"2026-07-05T01:38:25.634588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:38:25.634588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VMXcFJLRADpgdWpmk+ShiwoyU1mQrz8zPErRmKd/U31Bepd+JmUhyPLQ/PTkEdUmfabqy8lXy5Dqw+RBJtLwAA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:38:25.634995Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.13006","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0588d887e0f7abf1de80b6619d876c2334b0e674663356dac76c05bf46cb885","sha256:a294233ab587e265735abbcb7646d667e3fe173d609515311c02c20ab17fadd3"],"state_sha256":"0a827b61fe38ea5cdd121a61b418490c162b5e1ca5346f655689c4c5caef4baf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eIlBOYO+aHa3Vziw610PREdBqKCQQUhpBKzEVH+5a1BdXhXUhukSzzg3y6dXJ8g1Vyssehs30GZyzdgUQvwiCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T15:55:54.434406Z","bundle_sha256":"991c6c677aaca13f33119a05b1bfd73cd839af4f13873f8e4a93c24e6c871b60"}}