{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:FX27BI44DLS6OSOWFES67XJGR7","short_pith_number":"pith:FX27BI44","canonical_record":{"source":{"id":"1612.09251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-29T19:17:31Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"d2578d5d4f02e4ee2629f4aa0e7678b267be35d3671dcc193c8e1d2dc56a2a67","abstract_canon_sha256":"0e17fc0cd3659d98daace8b73f356fe67d8d13b2483b6efceafd6a3ddaf7bccf"},"schema_version":"1.0"},"canonical_sha256":"2df5f0a39c1ae5e749d62925efdd268ff3ae3d892863fec0fa80979eea23a4b4","source":{"kind":"arxiv","id":"1612.09251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09251","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09251v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09251","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"FX27BI44DLS6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FX27BI44DLS6OSOW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FX27BI44","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:FX27BI44DLS6OSOWFES67XJGR7","target":"record","payload":{"canonical_record":{"source":{"id":"1612.09251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-29T19:17:31Z","cross_cats_sorted":["cs.AI","cs.DB"],"title_canon_sha256":"d2578d5d4f02e4ee2629f4aa0e7678b267be35d3671dcc193c8e1d2dc56a2a67","abstract_canon_sha256":"0e17fc0cd3659d98daace8b73f356fe67d8d13b2483b6efceafd6a3ddaf7bccf"},"schema_version":"1.0"},"canonical_sha256":"2df5f0a39c1ae5e749d62925efdd268ff3ae3d892863fec0fa80979eea23a4b4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:46.163111Z","signature_b64":"R0wwJPECMDLu3xary/9puwxYhW936OeNhUO5XQ1Wd2zK35gje5mOenvl42mtPLiUKW9OFwb/0OrlZgtC8B7ADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2df5f0a39c1ae5e749d62925efdd268ff3ae3d892863fec0fa80979eea23a4b4","last_reissued_at":"2026-05-18T00:53:46.162653Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:46.162653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.09251","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-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHwanDdo2ZDTfTGsU9wVAuTCqpb3+riMB8d19QBi3g7cHwXM9DLSvCEpR7TuqCYxJK1wn+cNstjnWYbdMKbIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:30:03.923327Z"},"content_sha256":"4b294cfd9a5f1edc19b528b23c3358b0a04c8f9bdeef640b52a0de8b092e0b57","schema_version":"1.0","event_id":"sha256:4b294cfd9a5f1edc19b528b23c3358b0a04c8f9bdeef640b52a0de8b092e0b57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:FX27BI44DLS6OSOWFES67XJGR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lifted Relational Algebra with Recursion and Connections to Modal Logic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB"],"primary_cat":"cs.LO","authors_text":"Eugenia Ternovska","submitted_at":"2016-12-29T19:17:31Z","abstract_excerpt":"We propose a new formalism for specifying and reasoning about problems that involve heterogeneous \"pieces of information\" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence of our proposal is to lift Codd's relational algebra from operations on relational tables to operations on classes of structures (with recursion), and to add a direction of information propagation. We observe the presence of information propagation in several formalisms for efficient reasoning and use it to express unary negation and operations used in grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09251","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-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NlXGpzaBpMqvQBTsxu/iJUO1fSXLjWb+hXySbsKfLVOYAiRyB0sePaRAVKejguV7DNH0/BOp5QlwGgohFoeBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:30:03.923871Z"},"content_sha256":"6a85f0d4ac9a1cbe507f585c30ea1a798a55c00589ab9f0873b30b8fc27a1590","schema_version":"1.0","event_id":"sha256:6a85f0d4ac9a1cbe507f585c30ea1a798a55c00589ab9f0873b30b8fc27a1590"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FX27BI44DLS6OSOWFES67XJGR7/bundle.json","state_url":"https://pith.science/pith/FX27BI44DLS6OSOWFES67XJGR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FX27BI44DLS6OSOWFES67XJGR7/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-31T01:30:03Z","links":{"resolver":"https://pith.science/pith/FX27BI44DLS6OSOWFES67XJGR7","bundle":"https://pith.science/pith/FX27BI44DLS6OSOWFES67XJGR7/bundle.json","state":"https://pith.science/pith/FX27BI44DLS6OSOWFES67XJGR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FX27BI44DLS6OSOWFES67XJGR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:FX27BI44DLS6OSOWFES67XJGR7","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":"0e17fc0cd3659d98daace8b73f356fe67d8d13b2483b6efceafd6a3ddaf7bccf","cross_cats_sorted":["cs.AI","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-29T19:17:31Z","title_canon_sha256":"d2578d5d4f02e4ee2629f4aa0e7678b267be35d3671dcc193c8e1d2dc56a2a67"},"schema_version":"1.0","source":{"id":"1612.09251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09251","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09251v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09251","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"FX27BI44DLS6","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"FX27BI44DLS6OSOW","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"FX27BI44","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:6a85f0d4ac9a1cbe507f585c30ea1a798a55c00589ab9f0873b30b8fc27a1590","target":"graph","created_at":"2026-05-18T00:53:46Z","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 propose a new formalism for specifying and reasoning about problems that involve heterogeneous \"pieces of information\" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence of our proposal is to lift Codd's relational algebra from operations on relational tables to operations on classes of structures (with recursion), and to add a direction of information propagation. We observe the presence of information propagation in several formalisms for efficient reasoning and use it to express unary negation and operations used in grap","authors_text":"Eugenia Ternovska","cross_cats":["cs.AI","cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-29T19:17:31Z","title":"Lifted Relational Algebra with Recursion and Connections to Modal Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09251","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:4b294cfd9a5f1edc19b528b23c3358b0a04c8f9bdeef640b52a0de8b092e0b57","target":"record","created_at":"2026-05-18T00:53:46Z","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":"0e17fc0cd3659d98daace8b73f356fe67d8d13b2483b6efceafd6a3ddaf7bccf","cross_cats_sorted":["cs.AI","cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2016-12-29T19:17:31Z","title_canon_sha256":"d2578d5d4f02e4ee2629f4aa0e7678b267be35d3671dcc193c8e1d2dc56a2a67"},"schema_version":"1.0","source":{"id":"1612.09251","kind":"arxiv","version":1}},"canonical_sha256":"2df5f0a39c1ae5e749d62925efdd268ff3ae3d892863fec0fa80979eea23a4b4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2df5f0a39c1ae5e749d62925efdd268ff3ae3d892863fec0fa80979eea23a4b4","first_computed_at":"2026-05-18T00:53:46.162653Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:46.162653Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R0wwJPECMDLu3xary/9puwxYhW936OeNhUO5XQ1Wd2zK35gje5mOenvl42mtPLiUKW9OFwb/0OrlZgtC8B7ADw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:46.163111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.09251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b294cfd9a5f1edc19b528b23c3358b0a04c8f9bdeef640b52a0de8b092e0b57","sha256:6a85f0d4ac9a1cbe507f585c30ea1a798a55c00589ab9f0873b30b8fc27a1590"],"state_sha256":"8b3c8d66f384d41e786c532d64a1ad31f724655834b069dbd730ebb168ad7596"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WX4Wi3wfIjO3HFZigY5oUIfnI7tIVMb8FkgMVdtQ/VNfniaf5FtVD8rUHqJAxMM2LsAR0t+ki7UL3qfRGw7Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:30:03.927133Z","bundle_sha256":"ac4d07ca2cb355685b99b93cd823a348cb0f0b696ebf260a71c0a917074e666a"}}