{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XUQ5EGQO7VXPXBD22ZTT6D2JLJ","short_pith_number":"pith:XUQ5EGQO","schema_version":"1.0","canonical_sha256":"bd21d21a0efd6efb847ad6673f0f495a69dd2cbcb09c782032c557dc05a228ac","source":{"kind":"arxiv","id":"1703.07484","version":2},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.07484","created_at":"2026-05-18T00:22:16.280168+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07484v2","created_at":"2026-05-18T00:22:16.280168+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07484","created_at":"2026-05-18T00:22:16.280168+00:00"},{"alias_kind":"pith_short_12","alias_value":"XUQ5EGQO7VXP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XUQ5EGQO7VXPXBD2","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XUQ5EGQO","created_at":"2026-05-18T12:31:56.362134+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/XUQ5EGQO7VXPXBD22ZTT6D2JLJ","json":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ.json","graph_json":"https://pith.science/api/pith-number/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/graph.json","events_json":"https://pith.science/api/pith-number/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/events.json","paper":"https://pith.science/paper/XUQ5EGQO"},"agent_actions":{"view_html":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ","download_json":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ.json","view_paper":"https://pith.science/paper/XUQ5EGQO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07484&json=true","fetch_graph":"https://pith.science/api/pith-number/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/action/storage_attestation","attest_author":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/action/author_attestation","sign_citation":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/action/citation_signature","submit_replication":"https://pith.science/pith/XUQ5EGQO7VXPXBD22ZTT6D2JLJ/action/replication_record"}},"created_at":"2026-05-18T00:22:16.280168+00:00","updated_at":"2026-05-18T00:22:16.280168+00:00"}