{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:YBICE4W7LZVMSHULQ3QHRA4IM6","short_pith_number":"pith:YBICE4W7","canonical_record":{"source":{"id":"2004.12739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-04-27T12:27:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c983ae7c53d5cc5d4ee40f11947c0008b7b2ce705957bcf165179b77cd382d2f","abstract_canon_sha256":"bb0b7f4e47fb736753911fc4590044f66c692fcb265759de9674f0f8465614dc"},"schema_version":"1.0"},"canonical_sha256":"c0502272df5e6ac91e8b86e078838867a6a6c5a6f63204383a4e3e844cad84d8","source":{"kind":"arxiv","id":"2004.12739","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.12739","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"2004.12739v1","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12739","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"YBICE4W7LZVM","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"pith_short_16","alias_value":"YBICE4W7LZVMSHUL","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"pith_short_8","alias_value":"YBICE4W7","created_at":"2026-07-05T00:58:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:YBICE4W7LZVMSHULQ3QHRA4IM6","target":"record","payload":{"canonical_record":{"source":{"id":"2004.12739","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-04-27T12:27:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"c983ae7c53d5cc5d4ee40f11947c0008b7b2ce705957bcf165179b77cd382d2f","abstract_canon_sha256":"bb0b7f4e47fb736753911fc4590044f66c692fcb265759de9674f0f8465614dc"},"schema_version":"1.0"},"canonical_sha256":"c0502272df5e6ac91e8b86e078838867a6a6c5a6f63204383a4e3e844cad84d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:58:18.081703Z","signature_b64":"ubQgeEpg5Uh+s+U785oNaMrCQavjxL3htN0ZYGHUVtWT0PllNkrpm8HIdpPT8hdBan7DcquhbTwf+9Zrn/BRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0502272df5e6ac91e8b86e078838867a6a6c5a6f63204383a4e3e844cad84d8","last_reissued_at":"2026-07-05T00:58:18.081335Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:58:18.081335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2004.12739","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-05T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lXtNIig+A5hLmu3jQ0QcbbUy2W9q24fnpbDPnudFMvhEcNZIAM7XnnGvND/U6h2n3/SgJ0vuzZWAv4MxYvv1BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:14:09.125102Z"},"content_sha256":"be1e1fbf684372a0240e48a81514e4e84d35ef8762d2bc91a761bfc5a9085f23","schema_version":"1.0","event_id":"sha256:be1e1fbf684372a0240e48a81514e4e84d35ef8762d2bc91a761bfc5a9085f23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:YBICE4W7LZVMSHULQ3QHRA4IM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dynamic complexity of Reachability: How many changes can we handle?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Pankaj Kumar, Samir Datta, Thomas Zeume","submitted_at":"2020-04-27T12:27:37Z","abstract_excerpt":"In 2015, it was shown that reachability for arbitrary directed graphs can be updated by first-order formulas after inserting or deleting single edges. Later, in 2018, this was extended for changes of size $\\frac{\\log n}{\\log \\log n}$, where $n$ is the size of the graph. Changes of polylogarithmic size can be handled when also majority quantifiers may be used.\n  In this paper we extend these results by showing that, for changes of polylogarithmic size, first-order update formulas suffice for maintaining (1) undirected reachability, and (2) directed reachability under insertions. For classes of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12739","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/2004.12739/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-05T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6mQ4DSf/eAzG0N2H3oXr2O/lEpMijFdSqqeTMAm6JoUZL8uTaV+4FjXfD5ShdAwa6azokUa2/R/bty25RLZ8DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T11:14:09.126046Z"},"content_sha256":"84860c7fa4a94b34f3a14a87c227d428f6fa410d95d5bb6a710163d37fb2d424","schema_version":"1.0","event_id":"sha256:84860c7fa4a94b34f3a14a87c227d428f6fa410d95d5bb6a710163d37fb2d424"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBICE4W7LZVMSHULQ3QHRA4IM6/bundle.json","state_url":"https://pith.science/pith/YBICE4W7LZVMSHULQ3QHRA4IM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBICE4W7LZVMSHULQ3QHRA4IM6/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-08T11:14:09Z","links":{"resolver":"https://pith.science/pith/YBICE4W7LZVMSHULQ3QHRA4IM6","bundle":"https://pith.science/pith/YBICE4W7LZVMSHULQ3QHRA4IM6/bundle.json","state":"https://pith.science/pith/YBICE4W7LZVMSHULQ3QHRA4IM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBICE4W7LZVMSHULQ3QHRA4IM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:YBICE4W7LZVMSHULQ3QHRA4IM6","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":"bb0b7f4e47fb736753911fc4590044f66c692fcb265759de9674f0f8465614dc","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-04-27T12:27:37Z","title_canon_sha256":"c983ae7c53d5cc5d4ee40f11947c0008b7b2ce705957bcf165179b77cd382d2f"},"schema_version":"1.0","source":{"id":"2004.12739","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2004.12739","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"2004.12739v1","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2004.12739","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"YBICE4W7LZVM","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"pith_short_16","alias_value":"YBICE4W7LZVMSHUL","created_at":"2026-07-05T00:58:18Z"},{"alias_kind":"pith_short_8","alias_value":"YBICE4W7","created_at":"2026-07-05T00:58:18Z"}],"graph_snapshots":[{"event_id":"sha256:84860c7fa4a94b34f3a14a87c227d428f6fa410d95d5bb6a710163d37fb2d424","target":"graph","created_at":"2026-07-05T00:58:18Z","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/2004.12739/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In 2015, it was shown that reachability for arbitrary directed graphs can be updated by first-order formulas after inserting or deleting single edges. Later, in 2018, this was extended for changes of size $\\frac{\\log n}{\\log \\log n}$, where $n$ is the size of the graph. Changes of polylogarithmic size can be handled when also majority quantifiers may be used.\n  In this paper we extend these results by showing that, for changes of polylogarithmic size, first-order update formulas suffice for maintaining (1) undirected reachability, and (2) directed reachability under insertions. For classes of ","authors_text":"Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Pankaj Kumar, Samir Datta, Thomas Zeume","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-04-27T12:27:37Z","title":"Dynamic complexity of Reachability: How many changes can we handle?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2004.12739","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:be1e1fbf684372a0240e48a81514e4e84d35ef8762d2bc91a761bfc5a9085f23","target":"record","created_at":"2026-07-05T00:58:18Z","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":"bb0b7f4e47fb736753911fc4590044f66c692fcb265759de9674f0f8465614dc","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2020-04-27T12:27:37Z","title_canon_sha256":"c983ae7c53d5cc5d4ee40f11947c0008b7b2ce705957bcf165179b77cd382d2f"},"schema_version":"1.0","source":{"id":"2004.12739","kind":"arxiv","version":1}},"canonical_sha256":"c0502272df5e6ac91e8b86e078838867a6a6c5a6f63204383a4e3e844cad84d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0502272df5e6ac91e8b86e078838867a6a6c5a6f63204383a4e3e844cad84d8","first_computed_at":"2026-07-05T00:58:18.081335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:58:18.081335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ubQgeEpg5Uh+s+U785oNaMrCQavjxL3htN0ZYGHUVtWT0PllNkrpm8HIdpPT8hdBan7DcquhbTwf+9Zrn/BRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:58:18.081703Z","signed_message":"canonical_sha256_bytes"},"source_id":"2004.12739","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:be1e1fbf684372a0240e48a81514e4e84d35ef8762d2bc91a761bfc5a9085f23","sha256:84860c7fa4a94b34f3a14a87c227d428f6fa410d95d5bb6a710163d37fb2d424"],"state_sha256":"aba02c7b0f0ba9f160f75b4164cdf1975f86f22178895641921a7c74e095d228"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p4wVAUr+xkoyv9Q1d4vXMYjMoJ5QPEcJI3wg5kkoVCexRRCgmCsDhaLxCZed+FHJPgrkde3gfrdsRdQJlIJMDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T11:14:09.131563Z","bundle_sha256":"ac2f7f585e2051d64ee5c1475f4e1b40f4d2d7f4ece68936b24b3f5983570290"}}