{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:XUQ5EGQO7VXPXBD22ZTT6D2JLJ","short_pith_number":"pith:XUQ5EGQO","canonical_record":{"source":{"id":"1703.07484","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-22T01:39:00Z","cross_cats_sorted":[],"title_canon_sha256":"359a305ea06add5c70684c43f0db2103b20f663b4968634b396f87d167f7e60b","abstract_canon_sha256":"9a1ebad2ac86b6bc69420775616b8502351bea7b22debdd306e0784e90ba0509"},"schema_version":"1.0"},"canonical_sha256":"bd21d21a0efd6efb847ad6673f0f495a69dd2cbcb09c782032c557dc05a228ac","source":{"kind":"arxiv","id":"1703.07484","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07484","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07484v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07484","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"XUQ5EGQO7VXP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XUQ5EGQO7VXPXBD2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XUQ5EGQO","created_at":"2026-05-18T12:31:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:XUQ5EGQO7VXPXBD22ZTT6D2JLJ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07484","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-22T01:39:00Z","cross_cats_sorted":[],"title_canon_sha256":"359a305ea06add5c70684c43f0db2103b20f663b4968634b396f87d167f7e60b","abstract_canon_sha256":"9a1ebad2ac86b6bc69420775616b8502351bea7b22debdd306e0784e90ba0509"},"schema_version":"1.0"},"canonical_sha256":"bd21d21a0efd6efb847ad6673f0f495a69dd2cbcb09c782032c557dc05a228ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.280735Z","signature_b64":"Kl6fyJP0Zg5sWiOuy0gOmF9DvS2/dzh2Kb/BhwXHr/Nn0gJ0t3rrZSN4NM0Xn/Qpwyk0sXUfipPj0/VXImwHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd21d21a0efd6efb847ad6673f0f495a69dd2cbcb09c782032c557dc05a228ac","last_reissued_at":"2026-05-18T00:22:16.280074Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.280074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07484","source_version":2,"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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDHStDMqDLvQZ4qhcHpKO9XFw3piM0NNok0Aw7ksWzOvi+cc/BfmgO95sOFUTnhpULzTTyHnL0XiIr8DhLSmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:23:26.360666Z"},"content_sha256":"f6e2615aa5c943ccbf1a5fd915c59297c03f1565d943d1b1e1284dbdff91f1b7","schema_version":"1.0","event_id":"sha256:f6e2615aa5c943ccbf1a5fd915c59297c03f1565d943d1b1e1284dbdff91f1b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:XUQ5EGQO7VXPXBD22ZTT6D2JLJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Incremental View Maintenance with Triple Lock Factorization Benefits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Dan Olteanu, Milos Nikolic","submitted_at":"2017-03-22T01:39:00Z","abstract_excerpt":"We introduce F-IVM, a unified incremental view maintenance (IVM) approach for a variety of tasks, including gradient computation for learning linear regression models over joins, matrix chain multiplication, and factorized evaluation of conjunctive queries.\n  F-IVM is a higher-order IVM algorithm that reduces the maintenance of the given task to the maintenance of a hierarchy of increasingly simpler views. The views are functions mapping keys, which are tuples of input data values, to payloads, which are elements from a task-specific ring. Whereas the computation over the keys is the same for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07484","kind":"arxiv","version":2},"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:22:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBFir2VPnJNkSVca9siEF+pno+Fy+ycDLtflMxK29c8E7a+VQiA8aAv+YqzNd53QEjc5yjsCtVtDM/28DhYODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T08:23:26.361249Z"},"content_sha256":"df38fe3c9a23fd8f11a7b479551f5ab70b0e1c8fd1279d8951c7e52d3f8e8dc5","schema_version":"1.0","event_id":"sha256:df38fe3c9a23fd8f11a7b479551f5ab70b0e1c8fd1279d8951c7e52d3f8e8dc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/bundle.json","state_url":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/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-07T08:23:26Z","links":{"resolver":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ","bundle":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/bundle.json","state":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:XUQ5EGQO7VXPXBD22ZTT6D2JLJ","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":"9a1ebad2ac86b6bc69420775616b8502351bea7b22debdd306e0784e90ba0509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-22T01:39:00Z","title_canon_sha256":"359a305ea06add5c70684c43f0db2103b20f663b4968634b396f87d167f7e60b"},"schema_version":"1.0","source":{"id":"1703.07484","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07484","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07484v2","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07484","created_at":"2026-05-18T00:22:16Z"},{"alias_kind":"pith_short_12","alias_value":"XUQ5EGQO7VXP","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"XUQ5EGQO7VXPXBD2","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"XUQ5EGQO","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:df38fe3c9a23fd8f11a7b479551f5ab70b0e1c8fd1279d8951c7e52d3f8e8dc5","target":"graph","created_at":"2026-05-18T00:22:16Z","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":"We introduce F-IVM, a unified incremental view maintenance (IVM) approach for a variety of tasks, including gradient computation for learning linear regression models over joins, matrix chain multiplication, and factorized evaluation of conjunctive queries.\n  F-IVM is a higher-order IVM algorithm that reduces the maintenance of the given task to the maintenance of a hierarchy of increasingly simpler views. The views are functions mapping keys, which are tuples of input data values, to payloads, which are elements from a task-specific ring. Whereas the computation over the keys is the same for ","authors_text":"Dan Olteanu, Milos Nikolic","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-22T01:39:00Z","title":"Incremental View Maintenance with Triple Lock Factorization Benefits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07484","kind":"arxiv","version":2},"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:f6e2615aa5c943ccbf1a5fd915c59297c03f1565d943d1b1e1284dbdff91f1b7","target":"record","created_at":"2026-05-18T00:22:16Z","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":"9a1ebad2ac86b6bc69420775616b8502351bea7b22debdd306e0784e90ba0509","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-03-22T01:39:00Z","title_canon_sha256":"359a305ea06add5c70684c43f0db2103b20f663b4968634b396f87d167f7e60b"},"schema_version":"1.0","source":{"id":"1703.07484","kind":"arxiv","version":2}},"canonical_sha256":"bd21d21a0efd6efb847ad6673f0f495a69dd2cbcb09c782032c557dc05a228ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd21d21a0efd6efb847ad6673f0f495a69dd2cbcb09c782032c557dc05a228ac","first_computed_at":"2026-05-18T00:22:16.280074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:16.280074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kl6fyJP0Zg5sWiOuy0gOmF9DvS2/dzh2Kb/BhwXHr/Nn0gJ0t3rrZSN4NM0Xn/Qpwyk0sXUfipPj0/VXImwHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:16.280735Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07484","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f6e2615aa5c943ccbf1a5fd915c59297c03f1565d943d1b1e1284dbdff91f1b7","sha256:df38fe3c9a23fd8f11a7b479551f5ab70b0e1c8fd1279d8951c7e52d3f8e8dc5"],"state_sha256":"0edc1cb6654ff2414a09a2396cb59f59adde08e0184f32abf39ee8130ec3f9b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dsiynfikFjWjw2GQL+OYnDOLOiZhkUNm8SIhP+QzFkDkI/H2Pho7uM4JhuuB4ixBOrIysL1FDty8EVxbuviSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T08:23:26.364826Z","bundle_sha256":"1224cd96057647b87bba628a9f2761732a77f4bc66f71506cd163c484e1f43a5"}}