{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2004:U52VNFLR4ZKVUR3XM6PQDXAV3D","short_pith_number":"pith:U52VNFLR","canonical_record":{"source":{"id":"cs/0406013","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2004-06-07T12:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"4969ddf7d2fbba8a1073196dd9e6e699b7e1234d85f87a259d77fdae91634f3c","abstract_canon_sha256":"9749a0e59275c2ed7613c7302fff097191644be95465980dc190953b3e3c0aa5"},"schema_version":"1.0"},"canonical_sha256":"a775569571e6555a4777679f01dc15d8ef961124c8573e70c241d93e80a5a821","source":{"kind":"arxiv","id":"cs/0406013","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0406013","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0406013v1","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406013","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"U52VNFLR4ZKV","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"U52VNFLR4ZKVUR3X","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"U52VNFLR","created_at":"2026-07-04T14:24:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2004:U52VNFLR4ZKVUR3XM6PQDXAV3D","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0406013","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2004-06-07T12:13:58Z","cross_cats_sorted":[],"title_canon_sha256":"4969ddf7d2fbba8a1073196dd9e6e699b7e1234d85f87a259d77fdae91634f3c","abstract_canon_sha256":"9749a0e59275c2ed7613c7302fff097191644be95465980dc190953b3e3c0aa5"},"schema_version":"1.0"},"canonical_sha256":"a775569571e6555a4777679f01dc15d8ef961124c8573e70c241d93e80a5a821","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T14:24:44.147816Z","signature_b64":"hsRnl9RFwCI9tU0HxFvXk9sZZVlrjPFD7wh3fpDZigdZMwgWYcoInWUhEijdBLYaQqtr+AGVbUHdddMei+dfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a775569571e6555a4777679f01dc15d8ef961124c8573e70c241d93e80a5a821","last_reissued_at":"2026-07-04T14:24:44.147461Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T14:24:44.147461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0406013","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-07-04T14:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EGoFAc6ttcv6x5D4eOHX7E9TLk7rjFJ4zmbdRERwyE3CYEj34jfmpxwyo4qF5yyPNsTsjIrzBj/FELmOi8bsAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T08:21:22.048216Z"},"content_sha256":"951b1cee6cfff209aa927027f9a2c1e1c9bf22bfe53a8f2503de26651b34706d","schema_version":"1.0","event_id":"sha256:951b1cee6cfff209aa927027f9a2c1e1c9bf22bfe53a8f2503de26651b34706d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2004:U52VNFLR4ZKVUR3XM6PQDXAV3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimization of Bound Disjunctive Queries with Constraints","license":"","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"E. Zumpano, G. Greco, I. Trubtsyna, S. Greco","submitted_at":"2004-06-07T12:13:58Z","abstract_excerpt":"\"To Appear in Theory and Practice of Logic Programming (TPLP)\" This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach is an extension of the well-known Magic-Set technique and is well-suited for being integrated in current bottom-up (stable) model inference engines. More specifically, it is based on the exploitation of binding propagation techniques which reduce the size of the data relevant to answer the query and, consequently, reduces both the complexity of computing a single model and the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406013","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0406013/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T14:24:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNGgAqbcm5HtX3L9lKVxw/Uya6p4m4TWpGIdNCAiUAMR5EIYbhHLjH05AcFahdZO6U6/Vnyg6lk1YBfZuw1VDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-17T08:21:22.048608Z"},"content_sha256":"51b6c389370fdc022ae2ee73a57cdb010c4684d2da7f8c12eadd9b7f18fee91e","schema_version":"1.0","event_id":"sha256:51b6c389370fdc022ae2ee73a57cdb010c4684d2da7f8c12eadd9b7f18fee91e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/bundle.json","state_url":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/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-07-17T08:21:22Z","links":{"resolver":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D","bundle":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/bundle.json","state":"https://pith.science/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U52VNFLR4ZKVUR3XM6PQDXAV3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:U52VNFLR4ZKVUR3XM6PQDXAV3D","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":"9749a0e59275c2ed7613c7302fff097191644be95465980dc190953b3e3c0aa5","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2004-06-07T12:13:58Z","title_canon_sha256":"4969ddf7d2fbba8a1073196dd9e6e699b7e1234d85f87a259d77fdae91634f3c"},"schema_version":"1.0","source":{"id":"cs/0406013","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0406013","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0406013v1","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0406013","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_12","alias_value":"U52VNFLR4ZKV","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_16","alias_value":"U52VNFLR4ZKVUR3X","created_at":"2026-07-04T14:24:44Z"},{"alias_kind":"pith_short_8","alias_value":"U52VNFLR","created_at":"2026-07-04T14:24:44Z"}],"graph_snapshots":[{"event_id":"sha256:51b6c389370fdc022ae2ee73a57cdb010c4684d2da7f8c12eadd9b7f18fee91e","target":"graph","created_at":"2026-07-04T14:24:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0406013/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"\"To Appear in Theory and Practice of Logic Programming (TPLP)\" This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach is an extension of the well-known Magic-Set technique and is well-suited for being integrated in current bottom-up (stable) model inference engines. More specifically, it is based on the exploitation of binding propagation techniques which reduce the size of the data relevant to answer the query and, consequently, reduces both the complexity of computing a single model and the number of ","authors_text":"E. Zumpano, G. Greco, I. Trubtsyna, S. Greco","cross_cats":[],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2004-06-07T12:13:58Z","title":"Optimization of Bound Disjunctive Queries with Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0406013","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:951b1cee6cfff209aa927027f9a2c1e1c9bf22bfe53a8f2503de26651b34706d","target":"record","created_at":"2026-07-04T14:24:44Z","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":"9749a0e59275c2ed7613c7302fff097191644be95465980dc190953b3e3c0aa5","cross_cats_sorted":[],"license":"","primary_cat":"cs.LO","submitted_at":"2004-06-07T12:13:58Z","title_canon_sha256":"4969ddf7d2fbba8a1073196dd9e6e699b7e1234d85f87a259d77fdae91634f3c"},"schema_version":"1.0","source":{"id":"cs/0406013","kind":"arxiv","version":1}},"canonical_sha256":"a775569571e6555a4777679f01dc15d8ef961124c8573e70c241d93e80a5a821","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a775569571e6555a4777679f01dc15d8ef961124c8573e70c241d93e80a5a821","first_computed_at":"2026-07-04T14:24:44.147461Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T14:24:44.147461Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hsRnl9RFwCI9tU0HxFvXk9sZZVlrjPFD7wh3fpDZigdZMwgWYcoInWUhEijdBLYaQqtr+AGVbUHdddMei+dfBg==","signature_status":"signed_v1","signed_at":"2026-07-04T14:24:44.147816Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0406013","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:951b1cee6cfff209aa927027f9a2c1e1c9bf22bfe53a8f2503de26651b34706d","sha256:51b6c389370fdc022ae2ee73a57cdb010c4684d2da7f8c12eadd9b7f18fee91e"],"state_sha256":"12e9f3aa1dc1a800db8f48336b2fa69e2c3e5d0b031afe7182ed52422633c9a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/+fOBwB+P0v7Nr4FIKoizissTQn3Zzv2E3/+wM7oFToGBTMkZKxaMcx2NWwUDWvH0OsQ+dG8d8cCL+oHxMYCDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-17T08:21:22.050802Z","bundle_sha256":"2e9c9141afe693d9c9315acac69e9c811a5ca48d3c19c13bfc3baebc7e20dd1a"}}