{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:W34PBW5QZXK2ACRRHQUH75ZED4","short_pith_number":"pith:W34PBW5Q","schema_version":"1.0","canonical_sha256":"b6f8f0dbb0cdd5a00a313c287ff7241f322fad03a06cc30d69752704cb39cd20","source":{"kind":"arxiv","id":"1701.02494","version":1},"attestation_state":"computed","paper":{"title":"Dynamic Complexity under Definable Changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LO","authors_text":"Nils Vortmeier, Thomas Schwentick, Thomas Zeume","submitted_at":"2017-01-10T09:43:10Z","abstract_excerpt":"This paper studies dynamic complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free first-order formulas, all (uniform) $AC^1$ queries can be maintained by first-order dynamic programs. Furthermore, many maintenance results for single-tuple changes are extended to more powerful change operations: (1) The reachability query for undirected graphs is first-order maintainable under single tuple changes and first-order defined insertions, likewise the reachability query for directed acyclic graphs under qua"},"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":"1701.02494","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-01-10T09:43:10Z","cross_cats_sorted":["cs.DB"],"title_canon_sha256":"d908352756f75e109e4d241e79a8a02f2f789a22558515682e54818586c36e04","abstract_canon_sha256":"ed6725adc1abf1e4b90de1b4f023caf7885a92812c8d845ad16db82e784cbd88"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:04.123761Z","signature_b64":"WRbZ02lyDYmavyJcd/Wh7qec6I2bCp1kpoaRH7LfnwcmRDxb9eGxQPgghgaJU9ogoV0N0TI4djyMA5xcqKvTAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6f8f0dbb0cdd5a00a313c287ff7241f322fad03a06cc30d69752704cb39cd20","last_reissued_at":"2026-05-18T00:53:04.123106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:04.123106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Complexity under Definable Changes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB"],"primary_cat":"cs.LO","authors_text":"Nils Vortmeier, Thomas Schwentick, Thomas Zeume","submitted_at":"2017-01-10T09:43:10Z","abstract_excerpt":"This paper studies dynamic complexity under definable change operations in the DynFO framework by Patnaik and Immerman. It is shown that for changes definable by parameter-free first-order formulas, all (uniform) $AC^1$ queries can be maintained by first-order dynamic programs. Furthermore, many maintenance results for single-tuple changes are extended to more powerful change operations: (1) The reachability query for undirected graphs is first-order maintainable under single tuple changes and first-order defined insertions, likewise the reachability query for directed acyclic graphs under qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.02494","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":"1701.02494","created_at":"2026-05-18T00:53:04.123200+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.02494v1","created_at":"2026-05-18T00:53:04.123200+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.02494","created_at":"2026-05-18T00:53:04.123200+00:00"},{"alias_kind":"pith_short_12","alias_value":"W34PBW5QZXK2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"W34PBW5QZXK2ACRR","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"W34PBW5Q","created_at":"2026-05-18T12:31:49.984773+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/W34PBW5QZXK2ACRRHQUH75ZED4","json":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4.json","graph_json":"https://pith.science/api/pith-number/W34PBW5QZXK2ACRRHQUH75ZED4/graph.json","events_json":"https://pith.science/api/pith-number/W34PBW5QZXK2ACRRHQUH75ZED4/events.json","paper":"https://pith.science/paper/W34PBW5Q"},"agent_actions":{"view_html":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4","download_json":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4.json","view_paper":"https://pith.science/paper/W34PBW5Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.02494&json=true","fetch_graph":"https://pith.science/api/pith-number/W34PBW5QZXK2ACRRHQUH75ZED4/graph.json","fetch_events":"https://pith.science/api/pith-number/W34PBW5QZXK2ACRRHQUH75ZED4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4/action/storage_attestation","attest_author":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4/action/author_attestation","sign_citation":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4/action/citation_signature","submit_replication":"https://pith.science/pith/W34PBW5QZXK2ACRRHQUH75ZED4/action/replication_record"}},"created_at":"2026-05-18T00:53:04.123200+00:00","updated_at":"2026-05-18T00:53:04.123200+00:00"}