{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:S3DR77CBBHNVELAQFMLONWF2CW","short_pith_number":"pith:S3DR77CB","canonical_record":{"source":{"id":"1902.00585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-01T23:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"d65653a6455d0549faf33cc75e18608d403876ef0597e9f296801d4d959aedda","abstract_canon_sha256":"7d4070814f640a61d587a81f090331928599e8952d632efb0ec335b2e5787845"},"schema_version":"1.0"},"canonical_sha256":"96c71ffc4109db522c102b16e6d8ba15ae028cfd988cf2e9694a17b7fc4a1d3f","source":{"kind":"arxiv","id":"1902.00585","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00585","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00585v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00585","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"S3DR77CBBHNV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S3DR77CBBHNVELAQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S3DR77CB","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:S3DR77CBBHNVELAQFMLONWF2CW","target":"record","payload":{"canonical_record":{"source":{"id":"1902.00585","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-01T23:10:04Z","cross_cats_sorted":[],"title_canon_sha256":"d65653a6455d0549faf33cc75e18608d403876ef0597e9f296801d4d959aedda","abstract_canon_sha256":"7d4070814f640a61d587a81f090331928599e8952d632efb0ec335b2e5787845"},"schema_version":"1.0"},"canonical_sha256":"96c71ffc4109db522c102b16e6d8ba15ae028cfd988cf2e9694a17b7fc4a1d3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:52.757819Z","signature_b64":"+TeEAtTiJ0HM6F3cHBkjQD6HjubGtgm8Gr7gSvjlOnfw0YPRsakU548nCg91aZ4lWYtAvR3eLu+ZvmUhVeOyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96c71ffc4109db522c102b16e6d8ba15ae028cfd988cf2e9694a17b7fc4a1d3f","last_reissued_at":"2026-05-17T23:54:52.757256Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:52.757256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.00585","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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XgAbeGZEGZfObBK6LTIAr/FEdDqp1RhR04fgIPZSwbajDnkTRO2ZnuAY2kmX/oyuayvN0Ge0jHRAHKINo5UTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:30.116665Z"},"content_sha256":"d72fd4b07bfa2f22684d0c87f8ffce6681af8edd5bdbea82c5f4e3e33ca8c75b","schema_version":"1.0","event_id":"sha256:d72fd4b07bfa2f22684d0c87f8ffce6681af8edd5bdbea82c5f4e3e33ca8c75b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:S3DR77CBBHNVELAQFMLONWF2CW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental Techniques for Large-Scale Dynamic Query Processing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Ahmet Kara, Dan Olteanu, Iman Elghandour, Stijn Vansummeren","submitted_at":"2019-02-01T23:10:04Z","abstract_excerpt":"Many applications from various disciplines are now required to analyze fast evolving big data in real time. Various approaches for incremental processing of queries have been proposed over the years. Traditional approaches rely on updating the results of a query when updates are streamed rather than re-computing these queries, and therefore, higher execution performance is expected. However, they do not perform well for large databases that are updated at high frequencies. Therefore, new algorithms and approaches have been proposed in the literature to address these challenges by, for instance"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00585","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-17T23:54:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RiYS7GQlf4TcG1C0uiIO+nh44+mdSLkm8gQuHAU58GlHyvBqFkN+1ssHsAPK+Du3/n2HRv0LD2sAweMM3atUBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:49:30.117329Z"},"content_sha256":"c36a439c703e38fa3248dc7bbe319ac0e55bfa40d3fafd6b15b5411b15c98d4d","schema_version":"1.0","event_id":"sha256:c36a439c703e38fa3248dc7bbe319ac0e55bfa40d3fafd6b15b5411b15c98d4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S3DR77CBBHNVELAQFMLONWF2CW/bundle.json","state_url":"https://pith.science/pith/S3DR77CBBHNVELAQFMLONWF2CW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S3DR77CBBHNVELAQFMLONWF2CW/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-05-27T11:49:30Z","links":{"resolver":"https://pith.science/pith/S3DR77CBBHNVELAQFMLONWF2CW","bundle":"https://pith.science/pith/S3DR77CBBHNVELAQFMLONWF2CW/bundle.json","state":"https://pith.science/pith/S3DR77CBBHNVELAQFMLONWF2CW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S3DR77CBBHNVELAQFMLONWF2CW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:S3DR77CBBHNVELAQFMLONWF2CW","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":"7d4070814f640a61d587a81f090331928599e8952d632efb0ec335b2e5787845","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-01T23:10:04Z","title_canon_sha256":"d65653a6455d0549faf33cc75e18608d403876ef0597e9f296801d4d959aedda"},"schema_version":"1.0","source":{"id":"1902.00585","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.00585","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"arxiv_version","alias_value":"1902.00585v1","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00585","created_at":"2026-05-17T23:54:52Z"},{"alias_kind":"pith_short_12","alias_value":"S3DR77CBBHNV","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"S3DR77CBBHNVELAQ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"S3DR77CB","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:c36a439c703e38fa3248dc7bbe319ac0e55bfa40d3fafd6b15b5411b15c98d4d","target":"graph","created_at":"2026-05-17T23:54:52Z","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":"Many applications from various disciplines are now required to analyze fast evolving big data in real time. Various approaches for incremental processing of queries have been proposed over the years. Traditional approaches rely on updating the results of a query when updates are streamed rather than re-computing these queries, and therefore, higher execution performance is expected. However, they do not perform well for large databases that are updated at high frequencies. Therefore, new algorithms and approaches have been proposed in the literature to address these challenges by, for instance","authors_text":"Ahmet Kara, Dan Olteanu, Iman Elghandour, Stijn Vansummeren","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-01T23:10:04Z","title":"Incremental Techniques for Large-Scale Dynamic Query Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00585","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:d72fd4b07bfa2f22684d0c87f8ffce6681af8edd5bdbea82c5f4e3e33ca8c75b","target":"record","created_at":"2026-05-17T23:54:52Z","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":"7d4070814f640a61d587a81f090331928599e8952d632efb0ec335b2e5787845","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2019-02-01T23:10:04Z","title_canon_sha256":"d65653a6455d0549faf33cc75e18608d403876ef0597e9f296801d4d959aedda"},"schema_version":"1.0","source":{"id":"1902.00585","kind":"arxiv","version":1}},"canonical_sha256":"96c71ffc4109db522c102b16e6d8ba15ae028cfd988cf2e9694a17b7fc4a1d3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"96c71ffc4109db522c102b16e6d8ba15ae028cfd988cf2e9694a17b7fc4a1d3f","first_computed_at":"2026-05-17T23:54:52.757256Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:54:52.757256Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+TeEAtTiJ0HM6F3cHBkjQD6HjubGtgm8Gr7gSvjlOnfw0YPRsakU548nCg91aZ4lWYtAvR3eLu+ZvmUhVeOyAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:54:52.757819Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.00585","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d72fd4b07bfa2f22684d0c87f8ffce6681af8edd5bdbea82c5f4e3e33ca8c75b","sha256:c36a439c703e38fa3248dc7bbe319ac0e55bfa40d3fafd6b15b5411b15c98d4d"],"state_sha256":"7c58aaa37cb0bee698417aa95752738ff9e827d6a4d307a492c46841895af691"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DuMqQgHlx6h85Ki28wEUgT4SRPG76OsPr2uDQaOBTUcI2h4e0JWEn0Uq1RMk92MBQg9rivYJf0Uopv4HK03QCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:49:30.120791Z","bundle_sha256":"66662e9103df71e29ec20e80243522db539c253e150bc39a0851e43d3dc78f0b"}}