{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SMX7XM7APTIFHEG3RG64QQRICI","short_pith_number":"pith:SMX7XM7A","canonical_record":{"source":{"id":"2312.09331","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-12-14T20:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"838cbeae1f733ebb0665f8272b81c690897f15edd78afe4315272d572dd225d4","abstract_canon_sha256":"0045f926c859f06335e8683b2904d5dcccb41b6780bf6435fb71571c8c18eb9b"},"schema_version":"1.0"},"canonical_sha256":"932ffbb3e07cd05390db89bdc84228122cac5514216d0ae887b10cf0b2421dee","source":{"kind":"arxiv","id":"2312.09331","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.09331","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"2312.09331v5","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.09331","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"SMX7XM7APTIF","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"pith_short_16","alias_value":"SMX7XM7APTIFHEG3","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"pith_short_8","alias_value":"SMX7XM7A","created_at":"2026-07-05T09:06:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SMX7XM7APTIFHEG3RG64QQRICI","target":"record","payload":{"canonical_record":{"source":{"id":"2312.09331","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-12-14T20:40:57Z","cross_cats_sorted":[],"title_canon_sha256":"838cbeae1f733ebb0665f8272b81c690897f15edd78afe4315272d572dd225d4","abstract_canon_sha256":"0045f926c859f06335e8683b2904d5dcccb41b6780bf6435fb71571c8c18eb9b"},"schema_version":"1.0"},"canonical_sha256":"932ffbb3e07cd05390db89bdc84228122cac5514216d0ae887b10cf0b2421dee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:06:56.496719Z","signature_b64":"Yr+f9TQhQBL/NRfJqcJ1Yr35kuV2iUAPGZRjrFFqK7P9jVPcv+05uEvL2mSCe9QVH6Yd63rgd0O+rllSGLghAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"932ffbb3e07cd05390db89bdc84228122cac5514216d0ae887b10cf0b2421dee","last_reissued_at":"2026-07-05T09:06:56.496287Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:06:56.496287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2312.09331","source_version":5,"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-05T09:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2OZhGhOIQdxcy58K6GCTTZA/g7JRgEmSYRJLdGpo9aSysSoCAd0tyGU3lsknED4ap5NoKtaya4t2ylXPeXmxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:06:48.752939Z"},"content_sha256":"b53b349f5c3080a749769a86ec3eb2bc519812ac88644fa7da757abf5e90c87a","schema_version":"1.0","event_id":"sha256:b53b349f5c3080a749769a86ec3eb2bc519812ac88644fa7da757abf5e90c87a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SMX7XM7APTIFHEG3RG64QQRICI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Insert-Only versus Insert-Delete in Dynamic Query Evaluation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Dan Olteanu, Dan Suciu, Mahmoud Abo Khamis","submitted_at":"2023-12-14T20:40:57Z","abstract_excerpt":"We study the dynamic query evaluation problem: Given a full conjunctive query Q and a sequence of updates to the input database, we construct a data structure that supports constant-delay enumeration of the tuples in the query output after each update.\n  We show that a sequence of N insert-only updates to an initially empty database can be executed in total time O(N^w(Q)), where w(Q) is the fractional hypertree width of Q. This matches the complexity of the static query evaluation problem for Q and a database of size N. One corollary is that the amortized time per single-tuple insert is consta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.09331","kind":"arxiv","version":5},"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/2312.09331/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-05T09:06:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BhyKinG602/iGAXuRqxUwvkDJjxyItxQ3TlLvmX74yiadWKGMBj6h9KYaChl414jHElWA5qyrjILJ7ur+oerDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:06:48.753453Z"},"content_sha256":"0ee226e1f992280cefcaff37055e8202d70a070d0112903126103af8e2031dcc","schema_version":"1.0","event_id":"sha256:0ee226e1f992280cefcaff37055e8202d70a070d0112903126103af8e2031dcc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/bundle.json","state_url":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SMX7XM7APTIFHEG3RG64QQRICI/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-05T07:06:48Z","links":{"resolver":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI","bundle":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/bundle.json","state":"https://pith.science/pith/SMX7XM7APTIFHEG3RG64QQRICI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SMX7XM7APTIFHEG3RG64QQRICI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SMX7XM7APTIFHEG3RG64QQRICI","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":"0045f926c859f06335e8683b2904d5dcccb41b6780bf6435fb71571c8c18eb9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-12-14T20:40:57Z","title_canon_sha256":"838cbeae1f733ebb0665f8272b81c690897f15edd78afe4315272d572dd225d4"},"schema_version":"1.0","source":{"id":"2312.09331","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.09331","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"arxiv_version","alias_value":"2312.09331v5","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.09331","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"pith_short_12","alias_value":"SMX7XM7APTIF","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"pith_short_16","alias_value":"SMX7XM7APTIFHEG3","created_at":"2026-07-05T09:06:56Z"},{"alias_kind":"pith_short_8","alias_value":"SMX7XM7A","created_at":"2026-07-05T09:06:56Z"}],"graph_snapshots":[{"event_id":"sha256:0ee226e1f992280cefcaff37055e8202d70a070d0112903126103af8e2031dcc","target":"graph","created_at":"2026-07-05T09:06:56Z","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/2312.09331/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the dynamic query evaluation problem: Given a full conjunctive query Q and a sequence of updates to the input database, we construct a data structure that supports constant-delay enumeration of the tuples in the query output after each update.\n  We show that a sequence of N insert-only updates to an initially empty database can be executed in total time O(N^w(Q)), where w(Q) is the fractional hypertree width of Q. This matches the complexity of the static query evaluation problem for Q and a database of size N. One corollary is that the amortized time per single-tuple insert is consta","authors_text":"Ahmet Kara, Dan Olteanu, Dan Suciu, Mahmoud Abo Khamis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-12-14T20:40:57Z","title":"Insert-Only versus Insert-Delete in Dynamic Query Evaluation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.09331","kind":"arxiv","version":5},"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:b53b349f5c3080a749769a86ec3eb2bc519812ac88644fa7da757abf5e90c87a","target":"record","created_at":"2026-07-05T09:06:56Z","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":"0045f926c859f06335e8683b2904d5dcccb41b6780bf6435fb71571c8c18eb9b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2023-12-14T20:40:57Z","title_canon_sha256":"838cbeae1f733ebb0665f8272b81c690897f15edd78afe4315272d572dd225d4"},"schema_version":"1.0","source":{"id":"2312.09331","kind":"arxiv","version":5}},"canonical_sha256":"932ffbb3e07cd05390db89bdc84228122cac5514216d0ae887b10cf0b2421dee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"932ffbb3e07cd05390db89bdc84228122cac5514216d0ae887b10cf0b2421dee","first_computed_at":"2026-07-05T09:06:56.496287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:06:56.496287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yr+f9TQhQBL/NRfJqcJ1Yr35kuV2iUAPGZRjrFFqK7P9jVPcv+05uEvL2mSCe9QVH6Yd63rgd0O+rllSGLghAA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:06:56.496719Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.09331","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b53b349f5c3080a749769a86ec3eb2bc519812ac88644fa7da757abf5e90c87a","sha256:0ee226e1f992280cefcaff37055e8202d70a070d0112903126103af8e2031dcc"],"state_sha256":"43b225ffcd52cae6bf383ba236a07ca6eda4c552affc460f1ac8266ff04dbde0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBTJR0o2QV7/OLXFsYczW+UdOZVpu7HNcIgAgK8ONjWaPaeRQYau9d9O5tEb/ywcpnO7maPkCZldxXj0XRqDAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:06:48.757479Z","bundle_sha256":"8c54598eb9818fa09c7036c0162288220374581a29c8d053d96d0782f8d99ff4"}}