{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:LJVBOECK7QIDN5NWAJ2HHDSPZ2","short_pith_number":"pith:LJVBOECK","canonical_record":{"source":{"id":"1707.05681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-07-18T15:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"b148dfd2477eb7007bdfc57cab719b1082a50a3e98e2e9660ab5d49cf4297b8a","abstract_canon_sha256":"dd708861d8119111d329e3945cbb9655fc78cbfc43bd74bc55f73c002f1c4c2e"},"schema_version":"1.0"},"canonical_sha256":"5a6a17104afc1036f5b60274738e4fcebf870cffa1b0fc4cfccb7201581523f5","source":{"kind":"arxiv","id":"1707.05681","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05681","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05681v2","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05681","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"LJVBOECK7QID","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LJVBOECK7QIDN5NW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LJVBOECK","created_at":"2026-05-18T12:31:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:LJVBOECK7QIDN5NWAJ2HHDSPZ2","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05681","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-07-18T15:25:35Z","cross_cats_sorted":[],"title_canon_sha256":"b148dfd2477eb7007bdfc57cab719b1082a50a3e98e2e9660ab5d49cf4297b8a","abstract_canon_sha256":"dd708861d8119111d329e3945cbb9655fc78cbfc43bd74bc55f73c002f1c4c2e"},"schema_version":"1.0"},"canonical_sha256":"5a6a17104afc1036f5b60274738e4fcebf870cffa1b0fc4cfccb7201581523f5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:52.180516Z","signature_b64":"9GBzgSXwvbeMTD8l2uwyEg9HtvbPurQuNa/tGg11tvcPI8VAaI5N/HAFeBvqTAxu9iXqALP1OPMtfQ8ReciWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a6a17104afc1036f5b60274738e4fcebf870cffa1b0fc4cfccb7201581523f5","last_reissued_at":"2026-05-18T00:39:52.179930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:52.179930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05681","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:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sOBUohoXuLqTwQWyNfClZWDHYNsMK1og1wEOJ5ZsxlbFFhJ+1dfTxkqMg6AgjcF5zxCt0q/aWV/W5QQWMSs+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:53:10.939357Z"},"content_sha256":"327b733c0cfe5107ba0066005d12b673446e1db676ad197c94756deac398c500","schema_version":"1.0","event_id":"sha256:327b733c0cfe5107ba0066005d12b673446e1db676ad197c94756deac398c500"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:LJVBOECK7QIDN5NWAJ2HHDSPZ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fixpoint Semantics and Optimization of Recursive Datalog Programs with Aggregates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Alexander Shkapsky, Ariyam Das, Carlo Zaniolo, Matteo Interlandi, Mohan Yang, Tyson Condie","submitted_at":"2017-07-18T15:25:35Z","abstract_excerpt":"A very desirable Datalog extension investigated by many researchers in the last thirty years consists in allowing the use of the basic SQL aggregates min, max, count and sum in recursive rules. In this paper, we propose a simple comprehensive solution that extends the declarative least-fixpoint semantics of Horn Clauses, along with the optimization techniques used in the bottom-up implementation approach adopted by many Datalog systems. We start by identifying a large class of programs of great practical interest in which the use of min or max in recursive rules does not compromise the declara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05681","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:39:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThiBkBc/naK4E8YZKe4UdugoJqYnxkM66Byb5sR9rUFShs432sS5x4UjDoBZfJUaRmQIANYIatc98zVIXsLICg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T03:53:10.940080Z"},"content_sha256":"597050e52f717a6cc2b1008a863866480e249fbd6bff43ee1c3021d6eab3838d","schema_version":"1.0","event_id":"sha256:597050e52f717a6cc2b1008a863866480e249fbd6bff43ee1c3021d6eab3838d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LJVBOECK7QIDN5NWAJ2HHDSPZ2/bundle.json","state_url":"https://pith.science/pith/LJVBOECK7QIDN5NWAJ2HHDSPZ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LJVBOECK7QIDN5NWAJ2HHDSPZ2/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-30T03:53:10Z","links":{"resolver":"https://pith.science/pith/LJVBOECK7QIDN5NWAJ2HHDSPZ2","bundle":"https://pith.science/pith/LJVBOECK7QIDN5NWAJ2HHDSPZ2/bundle.json","state":"https://pith.science/pith/LJVBOECK7QIDN5NWAJ2HHDSPZ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LJVBOECK7QIDN5NWAJ2HHDSPZ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:LJVBOECK7QIDN5NWAJ2HHDSPZ2","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":"dd708861d8119111d329e3945cbb9655fc78cbfc43bd74bc55f73c002f1c4c2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-07-18T15:25:35Z","title_canon_sha256":"b148dfd2477eb7007bdfc57cab719b1082a50a3e98e2e9660ab5d49cf4297b8a"},"schema_version":"1.0","source":{"id":"1707.05681","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05681","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05681v2","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05681","created_at":"2026-05-18T00:39:52Z"},{"alias_kind":"pith_short_12","alias_value":"LJVBOECK7QID","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_16","alias_value":"LJVBOECK7QIDN5NW","created_at":"2026-05-18T12:31:28Z"},{"alias_kind":"pith_short_8","alias_value":"LJVBOECK","created_at":"2026-05-18T12:31:28Z"}],"graph_snapshots":[{"event_id":"sha256:597050e52f717a6cc2b1008a863866480e249fbd6bff43ee1c3021d6eab3838d","target":"graph","created_at":"2026-05-18T00:39: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":"A very desirable Datalog extension investigated by many researchers in the last thirty years consists in allowing the use of the basic SQL aggregates min, max, count and sum in recursive rules. In this paper, we propose a simple comprehensive solution that extends the declarative least-fixpoint semantics of Horn Clauses, along with the optimization techniques used in the bottom-up implementation approach adopted by many Datalog systems. We start by identifying a large class of programs of great practical interest in which the use of min or max in recursive rules does not compromise the declara","authors_text":"Alexander Shkapsky, Ariyam Das, Carlo Zaniolo, Matteo Interlandi, Mohan Yang, Tyson Condie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-07-18T15:25:35Z","title":"Fixpoint Semantics and Optimization of Recursive Datalog Programs with Aggregates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05681","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:327b733c0cfe5107ba0066005d12b673446e1db676ad197c94756deac398c500","target":"record","created_at":"2026-05-18T00:39: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":"dd708861d8119111d329e3945cbb9655fc78cbfc43bd74bc55f73c002f1c4c2e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-07-18T15:25:35Z","title_canon_sha256":"b148dfd2477eb7007bdfc57cab719b1082a50a3e98e2e9660ab5d49cf4297b8a"},"schema_version":"1.0","source":{"id":"1707.05681","kind":"arxiv","version":2}},"canonical_sha256":"5a6a17104afc1036f5b60274738e4fcebf870cffa1b0fc4cfccb7201581523f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a6a17104afc1036f5b60274738e4fcebf870cffa1b0fc4cfccb7201581523f5","first_computed_at":"2026-05-18T00:39:52.179930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:39:52.179930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9GBzgSXwvbeMTD8l2uwyEg9HtvbPurQuNa/tGg11tvcPI8VAaI5N/HAFeBvqTAxu9iXqALP1OPMtfQ8ReciWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:39:52.180516Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05681","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:327b733c0cfe5107ba0066005d12b673446e1db676ad197c94756deac398c500","sha256:597050e52f717a6cc2b1008a863866480e249fbd6bff43ee1c3021d6eab3838d"],"state_sha256":"537695920bac482be144769a8420844ad813441e9f4b3aeb62e6f4de580532a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"miNWouTcONozA+E3EA23peSlXBvNR6z8t1/HuyWJE7QyJQ2qB2cm0YSsUpKD2NrrN7O1IGXmdtbO2aOT/zPTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T03:53:10.943302Z","bundle_sha256":"b5a7877ad12298343168891250d0c9e1c7f0018a53beaf477ba607fd55115ef9"}}