{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HEGUJQ2IFTCPEFSN7FUZNS3L4M","short_pith_number":"pith:HEGUJQ2I","canonical_record":{"source":{"id":"1804.08555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T16:44:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e9d07693e0abbbf4f1726123520f21384245dc86e63241dc29da1e9986457662","abstract_canon_sha256":"4c7a6df079e842f76c65441db93a51aee04602e70fcf9b998f0dfc9c15849dad"},"schema_version":"1.0"},"canonical_sha256":"390d44c3482cc4f2164df96996cb6be31d528e1b0cbe0d88778989d52b32a6ce","source":{"kind":"arxiv","id":"1804.08555","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08555","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08555v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08555","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"HEGUJQ2IFTCP","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HEGUJQ2IFTCPEFSN","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HEGUJQ2I","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HEGUJQ2IFTCPEFSN7FUZNS3L4M","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T16:44:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e9d07693e0abbbf4f1726123520f21384245dc86e63241dc29da1e9986457662","abstract_canon_sha256":"4c7a6df079e842f76c65441db93a51aee04602e70fcf9b998f0dfc9c15849dad"},"schema_version":"1.0"},"canonical_sha256":"390d44c3482cc4f2164df96996cb6be31d528e1b0cbe0d88778989d52b32a6ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:37.553294Z","signature_b64":"R47qK5xIphwCf3hpBQYn3lfBKnUjOs7SyohzT2wz4K/vs42MLUpLKheM0L/0N3Y3ZVJqkXX/chUffR8UJsRxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"390d44c3482cc4f2164df96996cb6be31d528e1b0cbe0d88778989d52b32a6ce","last_reissued_at":"2026-05-18T00:17:37.552848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:37.552848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08555","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-05-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"buu5TcO7mZ5BG44TVf5bvoE6R6SQQapzzwoA+wv0J4wS3glH6fYGLxCo8q0q+tZ7FiKVWfkVDmA5Wt8bHrUMAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:41:45.333918Z"},"content_sha256":"50798ed4a915873223b9569dcdc1cf3f74c28a8ad4fe5a3b792fad8198869057","schema_version":"1.0","event_id":"sha256:50798ed4a915873223b9569dcdc1cf3f74c28a8ad4fe5a3b792fad8198869057"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HEGUJQ2IFTCPEFSN7FUZNS3L4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability and Distances under Multiple Changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.LO","authors_text":"Anish Mukherjee, Nils Vortmeier, Samir Datta, Thomas Zeume","submitted_at":"2018-04-23T16:44:12Z","abstract_excerpt":"Recently it was shown that the transitive closure of a directed graph can be updated using first-order formulas after insertions and deletions of single edges in the dynamic descriptive complexity framework by Dong, Su, and Topor, and Patnaik and Immerman. In other words, Reachability is in DynFO.\n  In this article we extend the framework to changes of multiple edges at a time, and study the Reachability and Distance queries under these changes. We show that the former problem can be maintained in DynFO$(+, \\times)$ under changes affecting O($\\frac{\\log n}{\\log \\log n}$) nodes, for graphs with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08555","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"},"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-18T00:17:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1a55aWQAiYeKi0egoBghYqVlKz8zVnS67MXjfmwZ3jzLD0rSnZQKSOXCZLlOyT5V+Y6q6fdP0HTASeAW93CWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T09:41:45.334264Z"},"content_sha256":"cb91996b630da9194a7f8ca14bbc6ddaaa7e6d8e4d7dd7b0bb5b8c06c969c938","schema_version":"1.0","event_id":"sha256:cb91996b630da9194a7f8ca14bbc6ddaaa7e6d8e4d7dd7b0bb5b8c06c969c938"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEGUJQ2IFTCPEFSN7FUZNS3L4M/bundle.json","state_url":"https://pith.science/pith/HEGUJQ2IFTCPEFSN7FUZNS3L4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEGUJQ2IFTCPEFSN7FUZNS3L4M/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-06-03T09:41:45Z","links":{"resolver":"https://pith.science/pith/HEGUJQ2IFTCPEFSN7FUZNS3L4M","bundle":"https://pith.science/pith/HEGUJQ2IFTCPEFSN7FUZNS3L4M/bundle.json","state":"https://pith.science/pith/HEGUJQ2IFTCPEFSN7FUZNS3L4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEGUJQ2IFTCPEFSN7FUZNS3L4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HEGUJQ2IFTCPEFSN7FUZNS3L4M","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":"4c7a6df079e842f76c65441db93a51aee04602e70fcf9b998f0dfc9c15849dad","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T16:44:12Z","title_canon_sha256":"e9d07693e0abbbf4f1726123520f21384245dc86e63241dc29da1e9986457662"},"schema_version":"1.0","source":{"id":"1804.08555","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08555","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08555v1","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08555","created_at":"2026-05-18T00:17:37Z"},{"alias_kind":"pith_short_12","alias_value":"HEGUJQ2IFTCP","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HEGUJQ2IFTCPEFSN","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HEGUJQ2I","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:cb91996b630da9194a7f8ca14bbc6ddaaa7e6d8e4d7dd7b0bb5b8c06c969c938","target":"graph","created_at":"2026-05-18T00:17:37Z","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":"Recently it was shown that the transitive closure of a directed graph can be updated using first-order formulas after insertions and deletions of single edges in the dynamic descriptive complexity framework by Dong, Su, and Topor, and Patnaik and Immerman. In other words, Reachability is in DynFO.\n  In this article we extend the framework to changes of multiple edges at a time, and study the Reachability and Distance queries under these changes. We show that the former problem can be maintained in DynFO$(+, \\times)$ under changes affecting O($\\frac{\\log n}{\\log \\log n}$) nodes, for graphs with","authors_text":"Anish Mukherjee, Nils Vortmeier, Samir Datta, Thomas Zeume","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T16:44:12Z","title":"Reachability and Distances under Multiple Changes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08555","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:50798ed4a915873223b9569dcdc1cf3f74c28a8ad4fe5a3b792fad8198869057","target":"record","created_at":"2026-05-18T00:17:37Z","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":"4c7a6df079e842f76c65441db93a51aee04602e70fcf9b998f0dfc9c15849dad","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-23T16:44:12Z","title_canon_sha256":"e9d07693e0abbbf4f1726123520f21384245dc86e63241dc29da1e9986457662"},"schema_version":"1.0","source":{"id":"1804.08555","kind":"arxiv","version":1}},"canonical_sha256":"390d44c3482cc4f2164df96996cb6be31d528e1b0cbe0d88778989d52b32a6ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"390d44c3482cc4f2164df96996cb6be31d528e1b0cbe0d88778989d52b32a6ce","first_computed_at":"2026-05-18T00:17:37.552848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:37.552848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R47qK5xIphwCf3hpBQYn3lfBKnUjOs7SyohzT2wz4K/vs42MLUpLKheM0L/0N3Y3ZVJqkXX/chUffR8UJsRxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:37.553294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08555","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:50798ed4a915873223b9569dcdc1cf3f74c28a8ad4fe5a3b792fad8198869057","sha256:cb91996b630da9194a7f8ca14bbc6ddaaa7e6d8e4d7dd7b0bb5b8c06c969c938"],"state_sha256":"ac3adf4c5dccd872b22f71ff0c8fff9301498e318c006e243d95053deae567c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fQp0oj7QZOF18HOQ5YPe8WpvHpYqZTJFvh3VXn5vyYMIbHWNQ5l2vbWXtadeyR+ZlaDNAlBXvngpTGk7zrepBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T09:41:45.336243Z","bundle_sha256":"7478e947ce834b4918ee19ad0e448a0975efed24846497e53079b3b02742889b"}}