{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OSGU47KDMDYP52SKDB3V7EUBY5","short_pith_number":"pith:OSGU47KD","schema_version":"1.0","canonical_sha256":"748d4e7d4360f0feea4a18775f9281c76fc8ca73012efc7a0b7260e8a23cfadc","source":{"kind":"arxiv","id":"1702.08764","version":1},"attestation_state":"computed","paper":{"title":"Answering FO+MOD queries under updates on bounded degree databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DB","authors_text":"Christoph Berkholz, Jens Keppeler, Nicole Schweikardt","submitted_at":"2017-02-28T12:46:03Z","abstract_excerpt":"We investigate the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that immediately reports the new result of a fixed query after every database update. We consider queries in first-order logic (FO) and its extension with modulo-counting quantifiers (FO+MOD), and show that they can be efficiently evaluated under updates, provided that the dynamic database does not exceed a certain degree bound.\n  In particular, we construct a data structure that allows to answer a Boolean FO+MOD query an"},"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":"1702.08764","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-02-28T12:46:03Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"4516e50bcbdcc6180291f53d16a3ae3e64411ddcde4a059870912db019957a0a","abstract_canon_sha256":"6b808aa1d6645c351fb9ae597c74d97ba214325d73fda9f0e67aec380f339382"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:47.951716Z","signature_b64":"egerb5i2fuSN9aAh8EDnEQHPvACWp990E2OIQkCk4sgmIoLYVVooihMKzbTcrWOe8aAMZXfgz9jhOGSmurlqAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"748d4e7d4360f0feea4a18775f9281c76fc8ca73012efc7a0b7260e8a23cfadc","last_reissued_at":"2026-05-18T00:49:47.951187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:47.951187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Answering FO+MOD queries under updates on bounded degree databases","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DB","authors_text":"Christoph Berkholz, Jens Keppeler, Nicole Schweikardt","submitted_at":"2017-02-28T12:46:03Z","abstract_excerpt":"We investigate the query evaluation problem for fixed queries over fully dynamic databases, where tuples can be inserted or deleted. The task is to design a dynamic algorithm that immediately reports the new result of a fixed query after every database update. We consider queries in first-order logic (FO) and its extension with modulo-counting quantifiers (FO+MOD), and show that they can be efficiently evaluated under updates, provided that the dynamic database does not exceed a certain degree bound.\n  In particular, we construct a data structure that allows to answer a Boolean FO+MOD query an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.08764","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":"1702.08764","created_at":"2026-05-18T00:49:47.951270+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.08764v1","created_at":"2026-05-18T00:49:47.951270+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.08764","created_at":"2026-05-18T00:49:47.951270+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSGU47KDMDYP","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSGU47KDMDYP52SK","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSGU47KD","created_at":"2026-05-18T12:31:34.259226+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/OSGU47KDMDYP52SKDB3V7EUBY5","json":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5.json","graph_json":"https://pith.science/api/pith-number/OSGU47KDMDYP52SKDB3V7EUBY5/graph.json","events_json":"https://pith.science/api/pith-number/OSGU47KDMDYP52SKDB3V7EUBY5/events.json","paper":"https://pith.science/paper/OSGU47KD"},"agent_actions":{"view_html":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5","download_json":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5.json","view_paper":"https://pith.science/paper/OSGU47KD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.08764&json=true","fetch_graph":"https://pith.science/api/pith-number/OSGU47KDMDYP52SKDB3V7EUBY5/graph.json","fetch_events":"https://pith.science/api/pith-number/OSGU47KDMDYP52SKDB3V7EUBY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5/action/storage_attestation","attest_author":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5/action/author_attestation","sign_citation":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5/action/citation_signature","submit_replication":"https://pith.science/pith/OSGU47KDMDYP52SKDB3V7EUBY5/action/replication_record"}},"created_at":"2026-05-18T00:49:47.951270+00:00","updated_at":"2026-05-18T00:49:47.951270+00:00"}