{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:TY272IWVBBYQC2YXTFO2JX3EHO","short_pith_number":"pith:TY272IWV","canonical_record":{"source":{"id":"0709.1699","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-09-11T19:00:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"291b141ee72fa1c965c49c96f6b3d878a5b16bb3d196eea185faec00353b9645","abstract_canon_sha256":"d9d2580a14f2783179fbb92f8e6d20c481f93eec2446dcbf6e1fdb7f5bc28f00"},"schema_version":"1.0"},"canonical_sha256":"9e35fd22d50871016b17995da4df643b8467bc86d70e5b7a13daf2a81529cdd0","source":{"kind":"arxiv","id":"0709.1699","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.1699","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"arxiv_version","alias_value":"0709.1699v1","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.1699","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"pith_short_12","alias_value":"TY272IWVBBYQ","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"pith_short_16","alias_value":"TY272IWVBBYQC2YX","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"pith_short_8","alias_value":"TY272IWV","created_at":"2026-07-04T15:04:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:TY272IWVBBYQC2YXTFO2JX3EHO","target":"record","payload":{"canonical_record":{"source":{"id":"0709.1699","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.LO","submitted_at":"2007-09-11T19:00:02Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"291b141ee72fa1c965c49c96f6b3d878a5b16bb3d196eea185faec00353b9645","abstract_canon_sha256":"d9d2580a14f2783179fbb92f8e6d20c481f93eec2446dcbf6e1fdb7f5bc28f00"},"schema_version":"1.0"},"canonical_sha256":"9e35fd22d50871016b17995da4df643b8467bc86d70e5b7a13daf2a81529cdd0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:04:10.282305Z","signature_b64":"a1UQx7R54Ts/SMvUmeGCSQeoA1Kaai2Ta/zBRWqZ+p/raycqucRdqf+lYlYk+bmOsTXgF58/fGFch2ZNDnqyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e35fd22d50871016b17995da4df643b8467bc86d70e5b7a13daf2a81529cdd0","last_reissued_at":"2026-07-04T15:04:10.281949Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:04:10.281949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0709.1699","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-04T15:04:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdGAORymgFvD6m1iOT4azgFyO2bFAAuCP7Ii+k5e6rdOjBJJ2VV1oMJTlNMBU4A/j8a+VlaTJPPuQxnoCbuwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:39:02.178818Z"},"content_sha256":"a342052a0f5c5422600226f1d636dc4c8c1b296ea8de2c0abb91ffc6e55af5a1","schema_version":"1.0","event_id":"sha256:a342052a0f5c5422600226f1d636dc4c8c1b296ea8de2c0abb91ffc6e55af5a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:TY272IWVBBYQC2YXTFO2JX3EHO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Tabling Mechanisms for Transaction Logic Programs","license":"","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LO","authors_text":"Paul Fodor","submitted_at":"2007-09-11T19:00:02Z","abstract_excerpt":"In this paper we present efficient evaluation algorithms for the Horn Transaction Logic (a generalization of the regular Horn logic programs with state updates). We present two complementary methods for optimizing the implementation of Transaction Logic. The first method is based on tabling and we modified the proof theory to table calls and answers on states (practically, equivalent to dynamic programming). The call-answer table is indexed on the call and a signature of the state in which the call was made. The answer columns contain the answer unification and a signature of the state after t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.1699","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/0709.1699/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-04T15:04:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijIsOm23zB20V55walahCeLA2JqY6wBrZidPTQPlXqEzD1SOedkIM5ld/j0z6nWWqIsP4jpyWcKM3pXcrYQ4Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:39:02.179195Z"},"content_sha256":"de8e48023ee3fa8bb716103683cbd28bd15d6405e5bf3b585ad35b5663020420","schema_version":"1.0","event_id":"sha256:de8e48023ee3fa8bb716103683cbd28bd15d6405e5bf3b585ad35b5663020420"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TY272IWVBBYQC2YXTFO2JX3EHO/bundle.json","state_url":"https://pith.science/pith/TY272IWVBBYQC2YXTFO2JX3EHO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TY272IWVBBYQC2YXTFO2JX3EHO/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-06T18:39:02Z","links":{"resolver":"https://pith.science/pith/TY272IWVBBYQC2YXTFO2JX3EHO","bundle":"https://pith.science/pith/TY272IWVBBYQC2YXTFO2JX3EHO/bundle.json","state":"https://pith.science/pith/TY272IWVBBYQC2YXTFO2JX3EHO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TY272IWVBBYQC2YXTFO2JX3EHO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:TY272IWVBBYQC2YXTFO2JX3EHO","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":"d9d2580a14f2783179fbb92f8e6d20c481f93eec2446dcbf6e1fdb7f5bc28f00","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.LO","submitted_at":"2007-09-11T19:00:02Z","title_canon_sha256":"291b141ee72fa1c965c49c96f6b3d878a5b16bb3d196eea185faec00353b9645"},"schema_version":"1.0","source":{"id":"0709.1699","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0709.1699","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"arxiv_version","alias_value":"0709.1699v1","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0709.1699","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"pith_short_12","alias_value":"TY272IWVBBYQ","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"pith_short_16","alias_value":"TY272IWVBBYQC2YX","created_at":"2026-07-04T15:04:10Z"},{"alias_kind":"pith_short_8","alias_value":"TY272IWV","created_at":"2026-07-04T15:04:10Z"}],"graph_snapshots":[{"event_id":"sha256:de8e48023ee3fa8bb716103683cbd28bd15d6405e5bf3b585ad35b5663020420","target":"graph","created_at":"2026-07-04T15:04:10Z","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/0709.1699/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper we present efficient evaluation algorithms for the Horn Transaction Logic (a generalization of the regular Horn logic programs with state updates). We present two complementary methods for optimizing the implementation of Transaction Logic. The first method is based on tabling and we modified the proof theory to table calls and answers on states (practically, equivalent to dynamic programming). The call-answer table is indexed on the call and a signature of the state in which the call was made. The answer columns contain the answer unification and a signature of the state after t","authors_text":"Paul Fodor","cross_cats":["cs.AI"],"headline":"","license":"","primary_cat":"cs.LO","submitted_at":"2007-09-11T19:00:02Z","title":"Efficient Tabling Mechanisms for Transaction Logic Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0709.1699","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:a342052a0f5c5422600226f1d636dc4c8c1b296ea8de2c0abb91ffc6e55af5a1","target":"record","created_at":"2026-07-04T15:04:10Z","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":"d9d2580a14f2783179fbb92f8e6d20c481f93eec2446dcbf6e1fdb7f5bc28f00","cross_cats_sorted":["cs.AI"],"license":"","primary_cat":"cs.LO","submitted_at":"2007-09-11T19:00:02Z","title_canon_sha256":"291b141ee72fa1c965c49c96f6b3d878a5b16bb3d196eea185faec00353b9645"},"schema_version":"1.0","source":{"id":"0709.1699","kind":"arxiv","version":1}},"canonical_sha256":"9e35fd22d50871016b17995da4df643b8467bc86d70e5b7a13daf2a81529cdd0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9e35fd22d50871016b17995da4df643b8467bc86d70e5b7a13daf2a81529cdd0","first_computed_at":"2026-07-04T15:04:10.281949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:04:10.281949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"a1UQx7R54Ts/SMvUmeGCSQeoA1Kaai2Ta/zBRWqZ+p/raycqucRdqf+lYlYk+bmOsTXgF58/fGFch2ZNDnqyBg==","signature_status":"signed_v1","signed_at":"2026-07-04T15:04:10.282305Z","signed_message":"canonical_sha256_bytes"},"source_id":"0709.1699","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a342052a0f5c5422600226f1d636dc4c8c1b296ea8de2c0abb91ffc6e55af5a1","sha256:de8e48023ee3fa8bb716103683cbd28bd15d6405e5bf3b585ad35b5663020420"],"state_sha256":"a9f3027c90a8871f276230b94c990fa39795157f583a63c02488590d7a4c922a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xa+hjKUI2UriVZG7xmOAi05qelUslmyhA2eRgjZZJVNxYp7RUIeeigiBjK9ZCDwjHAUc1wyxnaCMa8eUJZiuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:39:02.181252Z","bundle_sha256":"4bfbd7232be704e4308c5e507b851fbbc1ab156e2164562d7012245aa453cd15"}}