{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZX7QEHWHLL5X4HXNENEIRHSTKF","short_pith_number":"pith:ZX7QEHWH","canonical_record":{"source":{"id":"1405.2501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-11T06:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"63b8d744455f8c0d74576907ef27a7e884719d27a3c01ff9b517c0c1198cdc51","abstract_canon_sha256":"b4800e431d3fc3bf6918bdd3e6af9f6541bb27df15226f19d375e3b6ba010faf"},"schema_version":"1.0"},"canonical_sha256":"cdff021ec75afb7e1eed2348889e535148f4b4baea83b3108738fdcf6c28f1cd","source":{"kind":"arxiv","id":"1405.2501","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2501","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2501v1","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2501","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZX7QEHWHLL5X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZX7QEHWHLL5X4HXN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZX7QEHWH","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZX7QEHWHLL5X4HXNENEIRHSTKF","target":"record","payload":{"canonical_record":{"source":{"id":"1405.2501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-11T06:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"63b8d744455f8c0d74576907ef27a7e884719d27a3c01ff9b517c0c1198cdc51","abstract_canon_sha256":"b4800e431d3fc3bf6918bdd3e6af9f6541bb27df15226f19d375e3b6ba010faf"},"schema_version":"1.0"},"canonical_sha256":"cdff021ec75afb7e1eed2348889e535148f4b4baea83b3108738fdcf6c28f1cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:05.384513Z","signature_b64":"JAiGnsmzJebZ9p4aMTE+WN52OM89tXlhRw+SACUaXzTk4awmwJ9Tq0+Hi1LnQciTZ8Gs5iDHa6yQH7WXNxsnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cdff021ec75afb7e1eed2348889e535148f4b4baea83b3108738fdcf6c28f1cd","last_reissued_at":"2026-05-18T02:52:05.384106Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:05.384106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.2501","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-18T02:52:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"545TR7b08h0U09a/4G7cuVkNbGJmvRKxHpyMVGaEPSV8EAAehSrVEKrJwDpKKItL8kZUAPnih7+qQkhgP//BAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:48:46.104282Z"},"content_sha256":"933f33f2e0c39831dd92277b8bba5fd745513e81c2938c2f570a2a3eb2a1b6a7","schema_version":"1.0","event_id":"sha256:933f33f2e0c39831dd92277b8bba5fd745513e81c2938c2f570a2a3eb2a1b6a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZX7QEHWHLL5X4HXNENEIRHSTKF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Tabled Logic Programming to Solve the Petrobras Planning Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Neng-Fa Zhou, Roman Bart\\'ak","submitted_at":"2014-05-11T06:38:25Z","abstract_excerpt":"Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same idea can be naturally used to memorize visited states during search for planning. In this paper we present a planner developed in the Picat language to solve the Petrobras planning problem. Picat is a novel Prolog-like language that provides pattern matching, deterministic and non-deterministic rules, and tabling as its core modelling and solving features. We demonstrate these capabilities using the Petrobras problem, where the goal is to plan transport of cargo items from port"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2501","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-18T02:52:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/g8PKqrej1zpv7adOujtzy1o39VCMiQd+f8G5MlHtAWZBHLWr6Il34cGFdLRLrXif+AxT3NBkhbIVBLUEnIBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T22:48:46.104930Z"},"content_sha256":"472fabec311efa11da9d3163961f6574f713dfdecda71bac9bb8debada33b2dc","schema_version":"1.0","event_id":"sha256:472fabec311efa11da9d3163961f6574f713dfdecda71bac9bb8debada33b2dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZX7QEHWHLL5X4HXNENEIRHSTKF/bundle.json","state_url":"https://pith.science/pith/ZX7QEHWHLL5X4HXNENEIRHSTKF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZX7QEHWHLL5X4HXNENEIRHSTKF/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-06-09T22:48:46Z","links":{"resolver":"https://pith.science/pith/ZX7QEHWHLL5X4HXNENEIRHSTKF","bundle":"https://pith.science/pith/ZX7QEHWHLL5X4HXNENEIRHSTKF/bundle.json","state":"https://pith.science/pith/ZX7QEHWHLL5X4HXNENEIRHSTKF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZX7QEHWHLL5X4HXNENEIRHSTKF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZX7QEHWHLL5X4HXNENEIRHSTKF","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":"b4800e431d3fc3bf6918bdd3e6af9f6541bb27df15226f19d375e3b6ba010faf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-11T06:38:25Z","title_canon_sha256":"63b8d744455f8c0d74576907ef27a7e884719d27a3c01ff9b517c0c1198cdc51"},"schema_version":"1.0","source":{"id":"1405.2501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.2501","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"arxiv_version","alias_value":"1405.2501v1","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.2501","created_at":"2026-05-18T02:52:05Z"},{"alias_kind":"pith_short_12","alias_value":"ZX7QEHWHLL5X","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZX7QEHWHLL5X4HXN","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZX7QEHWH","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:472fabec311efa11da9d3163961f6574f713dfdecda71bac9bb8debada33b2dc","target":"graph","created_at":"2026-05-18T02:52:05Z","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":"Tabling has been used for some time to improve efficiency of Prolog programs by memorizing answered queries. The same idea can be naturally used to memorize visited states during search for planning. In this paper we present a planner developed in the Picat language to solve the Petrobras planning problem. Picat is a novel Prolog-like language that provides pattern matching, deterministic and non-deterministic rules, and tabling as its core modelling and solving features. We demonstrate these capabilities using the Petrobras problem, where the goal is to plan transport of cargo items from port","authors_text":"Neng-Fa Zhou, Roman Bart\\'ak","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-11T06:38:25Z","title":"Using Tabled Logic Programming to Solve the Petrobras Planning Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.2501","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:933f33f2e0c39831dd92277b8bba5fd745513e81c2938c2f570a2a3eb2a1b6a7","target":"record","created_at":"2026-05-18T02:52:05Z","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":"b4800e431d3fc3bf6918bdd3e6af9f6541bb27df15226f19d375e3b6ba010faf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-05-11T06:38:25Z","title_canon_sha256":"63b8d744455f8c0d74576907ef27a7e884719d27a3c01ff9b517c0c1198cdc51"},"schema_version":"1.0","source":{"id":"1405.2501","kind":"arxiv","version":1}},"canonical_sha256":"cdff021ec75afb7e1eed2348889e535148f4b4baea83b3108738fdcf6c28f1cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cdff021ec75afb7e1eed2348889e535148f4b4baea83b3108738fdcf6c28f1cd","first_computed_at":"2026-05-18T02:52:05.384106Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:05.384106Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JAiGnsmzJebZ9p4aMTE+WN52OM89tXlhRw+SACUaXzTk4awmwJ9Tq0+Hi1LnQciTZ8Gs5iDHa6yQH7WXNxsnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:05.384513Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.2501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:933f33f2e0c39831dd92277b8bba5fd745513e81c2938c2f570a2a3eb2a1b6a7","sha256:472fabec311efa11da9d3163961f6574f713dfdecda71bac9bb8debada33b2dc"],"state_sha256":"bfc094fb4a9f2d8cd1b2250489881174fcdb9367ca2994817fa8bab63b6629fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S4hVNPoBfdlbg6XoRjgZ+3znZWQbdc7mbd9oc/xWkscWZxDkYN396tsV1H5VpCvKyX+oHRJwsW9kxBrx4t33Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T22:48:46.108674Z","bundle_sha256":"0f1e722d2a04e0937fa85819359636d99ef031d737c45e7fc227f6231bca837c"}}