{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:TOFCXQU47DHI2U4K6A6U2QF3ZS","short_pith_number":"pith:TOFCXQU4","canonical_record":{"source":{"id":"2502.09208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-02-13T11:46:56Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"cc15e1b92a2abea3081fa0ee0a738f080c6ae3e6f808ec933e4ddcd08c522db3","abstract_canon_sha256":"5da0d2fc7c3365ec0f343d95309fbaa4fd03412fc2bf88207504fd64cb6a6a84"},"schema_version":"1.0"},"canonical_sha256":"9b8a2bc29cf8ce8d538af03d4d40bbcc8bbb081d6ef3de7c946018e7fde90cde","source":{"kind":"arxiv","id":"2502.09208","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09208","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09208v1","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09208","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"TOFCXQU47DHI","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"pith_short_16","alias_value":"TOFCXQU47DHI2U4K","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"pith_short_8","alias_value":"TOFCXQU4","created_at":"2026-07-05T10:13:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:TOFCXQU47DHI2U4K6A6U2QF3ZS","target":"record","payload":{"canonical_record":{"source":{"id":"2502.09208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-02-13T11:46:56Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"cc15e1b92a2abea3081fa0ee0a738f080c6ae3e6f808ec933e4ddcd08c522db3","abstract_canon_sha256":"5da0d2fc7c3365ec0f343d95309fbaa4fd03412fc2bf88207504fd64cb6a6a84"},"schema_version":"1.0"},"canonical_sha256":"9b8a2bc29cf8ce8d538af03d4d40bbcc8bbb081d6ef3de7c946018e7fde90cde","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:13:53.771140Z","signature_b64":"78SEQem4vOAiVuGrjUy3PusNFKLHeaH8crF7klIudYApVWAIYgim26xu7TaupPNw0MT8muhp9P11aZqFddluDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b8a2bc29cf8ce8d538af03d4d40bbcc8bbb081d6ef3de7c946018e7fde90cde","last_reissued_at":"2026-07-05T10:13:53.770634Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:13:53.770634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.09208","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-05T10:13:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9gFh5SqwVACYq+7PEo4kdApBOHFI8WNMMBazSVrKwlz8s4CueK7SFMSGyFC7mmQKV4PpxgBt8KsjOK8E18H3Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:15:45.483816Z"},"content_sha256":"8791b71adcbc95ae2f152eaeb3de8372d35c27d01e5af712978a3bfe9c4c8ecc","schema_version":"1.0","event_id":"sha256:8791b71adcbc95ae2f152eaeb3de8372d35c27d01e5af712978a3bfe9c4c8ecc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:TOFCXQU47DHI2U4K6A6U2QF3ZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.LO","authors_text":"Alexis R. Tudor","submitted_at":"2025-02-13T11:46:56Z","abstract_excerpt":"Task planning for autonomous agents has typically been done using deep learning models and simulation-based reinforcement learning. This research proposes combining inductive learning techniques with goal-directed answer set programming to increase the explainability and reliability of systems for task breakdown and completion. Preliminary research has led to the creation of a Python harness that utilizes s(CASP) to solve task problems in a computationally efficient way. Although this research is in the early stages, we are exploring solutions to complex problems in simulated task completion."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09208","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/2502.09208/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-05T10:13:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xfclyre9WMxJ++97D4ydyLLvb/UGog5GO+zgCajet5cd376JTHq4YlHI88P4UeXt37wkcO0qnT75ueH0x15pCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T12:15:45.484770Z"},"content_sha256":"ef63a1428220a0bad2ab0d91529b8000eba5534953cae88a9377cb1742e6362f","schema_version":"1.0","event_id":"sha256:ef63a1428220a0bad2ab0d91529b8000eba5534953cae88a9377cb1742e6362f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TOFCXQU47DHI2U4K6A6U2QF3ZS/bundle.json","state_url":"https://pith.science/pith/TOFCXQU47DHI2U4K6A6U2QF3ZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TOFCXQU47DHI2U4K6A6U2QF3ZS/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-08-10T12:15:45Z","links":{"resolver":"https://pith.science/pith/TOFCXQU47DHI2U4K6A6U2QF3ZS","bundle":"https://pith.science/pith/TOFCXQU47DHI2U4K6A6U2QF3ZS/bundle.json","state":"https://pith.science/pith/TOFCXQU47DHI2U4K6A6U2QF3ZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TOFCXQU47DHI2U4K6A6U2QF3ZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:TOFCXQU47DHI2U4K6A6U2QF3ZS","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":"5da0d2fc7c3365ec0f343d95309fbaa4fd03412fc2bf88207504fd64cb6a6a84","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-02-13T11:46:56Z","title_canon_sha256":"cc15e1b92a2abea3081fa0ee0a738f080c6ae3e6f808ec933e4ddcd08c522db3"},"schema_version":"1.0","source":{"id":"2502.09208","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.09208","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"arxiv_version","alias_value":"2502.09208v1","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.09208","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"pith_short_12","alias_value":"TOFCXQU47DHI","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"pith_short_16","alias_value":"TOFCXQU47DHI2U4K","created_at":"2026-07-05T10:13:53Z"},{"alias_kind":"pith_short_8","alias_value":"TOFCXQU4","created_at":"2026-07-05T10:13:53Z"}],"graph_snapshots":[{"event_id":"sha256:ef63a1428220a0bad2ab0d91529b8000eba5534953cae88a9377cb1742e6362f","target":"graph","created_at":"2026-07-05T10:13:53Z","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/2502.09208/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Task planning for autonomous agents has typically been done using deep learning models and simulation-based reinforcement learning. This research proposes combining inductive learning techniques with goal-directed answer set programming to increase the explainability and reliability of systems for task breakdown and completion. Preliminary research has led to the creation of a Python harness that utilizes s(CASP) to solve task problems in a computationally efficient way. Although this research is in the early stages, we are exploring solutions to complex problems in simulated task completion.","authors_text":"Alexis R. Tudor","cross_cats":["cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-02-13T11:46:56Z","title":"Autonomous Task Completion Based on Goal-directed Answer Set Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.09208","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:8791b71adcbc95ae2f152eaeb3de8372d35c27d01e5af712978a3bfe9c4c8ecc","target":"record","created_at":"2026-07-05T10:13:53Z","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":"5da0d2fc7c3365ec0f343d95309fbaa4fd03412fc2bf88207504fd64cb6a6a84","cross_cats_sorted":["cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2025-02-13T11:46:56Z","title_canon_sha256":"cc15e1b92a2abea3081fa0ee0a738f080c6ae3e6f808ec933e4ddcd08c522db3"},"schema_version":"1.0","source":{"id":"2502.09208","kind":"arxiv","version":1}},"canonical_sha256":"9b8a2bc29cf8ce8d538af03d4d40bbcc8bbb081d6ef3de7c946018e7fde90cde","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b8a2bc29cf8ce8d538af03d4d40bbcc8bbb081d6ef3de7c946018e7fde90cde","first_computed_at":"2026-07-05T10:13:53.770634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:13:53.770634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"78SEQem4vOAiVuGrjUy3PusNFKLHeaH8crF7klIudYApVWAIYgim26xu7TaupPNw0MT8muhp9P11aZqFddluDA==","signature_status":"signed_v1","signed_at":"2026-07-05T10:13:53.771140Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.09208","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8791b71adcbc95ae2f152eaeb3de8372d35c27d01e5af712978a3bfe9c4c8ecc","sha256:ef63a1428220a0bad2ab0d91529b8000eba5534953cae88a9377cb1742e6362f"],"state_sha256":"dfab411392fc5f7ed8d20d6f7d77dc69ddadc9dbd11ea875c3d0440594fc1021"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tz8N7coNG62IGMSbh7qvZHdr8LxwSOjz5cl2QqgOo1XegS/c98wvOboUY7EiFOr1hJ/L5Wf7ip0aLbENC72YCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T12:15:45.491297Z","bundle_sha256":"1187098c15006d17ad8131ff8cacf142214b1995a62f28fdee007b923d9c7b1d"}}