{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TMM2U3PUBMKGWYOK676HCRZYYF","short_pith_number":"pith:TMM2U3PU","canonical_record":{"source":{"id":"2408.10889","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-20T14:20:19Z","cross_cats_sorted":[],"title_canon_sha256":"eec9890992796cf2abf9ac84e1ce1a6835d56ae3ed1d569839a06dea3c2af382","abstract_canon_sha256":"4668adfe8e9d6b60dc12332533574075bb842c18a9d0e6decdffa847a3e8719a"},"schema_version":"1.0"},"canonical_sha256":"9b19aa6df40b146b61caf7fc714738c1586e55124be9cf8a8f0d7c42d129a603","source":{"kind":"arxiv","id":"2408.10889","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10889","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10889v3","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10889","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"pith_short_12","alias_value":"TMM2U3PUBMKG","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"pith_short_16","alias_value":"TMM2U3PUBMKGWYOK","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"pith_short_8","alias_value":"TMM2U3PU","created_at":"2026-07-05T11:56:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TMM2U3PUBMKGWYOK676HCRZYYF","target":"record","payload":{"canonical_record":{"source":{"id":"2408.10889","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-20T14:20:19Z","cross_cats_sorted":[],"title_canon_sha256":"eec9890992796cf2abf9ac84e1ce1a6835d56ae3ed1d569839a06dea3c2af382","abstract_canon_sha256":"4668adfe8e9d6b60dc12332533574075bb842c18a9d0e6decdffa847a3e8719a"},"schema_version":"1.0"},"canonical_sha256":"9b19aa6df40b146b61caf7fc714738c1586e55124be9cf8a8f0d7c42d129a603","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:56:49.370090Z","signature_b64":"eFuw9/hRfC1PMzquPzGqliRi7ngCYcwcxeHHc0hO+wsNALkFgqs7OuM6kSgylzi0yTwP9N33U31y0XC1ZQ2OCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b19aa6df40b146b61caf7fc714738c1586e55124be9cf8a8f0d7c42d129a603","last_reissued_at":"2026-07-05T11:56:49.369603Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:56:49.369603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.10889","source_version":3,"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-05T11:56:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24M0QWJBgTmnODrsRHEDJs+CG9A+x7a8k6jjjnHE40oIHfp0R1i66HuVuDk+3wHvk3OB6zRFvM71NuqYH9xCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:36:27.120644Z"},"content_sha256":"f0cb93583704fd9cfdaeea404f887361bbb2f7487932399c787720852dc57fb5","schema_version":"1.0","event_id":"sha256:f0cb93583704fd9cfdaeea404f887361bbb2f7487932399c787720852dc57fb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TMM2U3PUBMKGWYOK676HCRZYYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Learning Action Costs from Input Plans","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Alberto Pozanco, Daniel Borrajo, Giuseppe Canonaco, Manuela Veloso, Marianela Morales, Sriram Gopalakrishnan","submitted_at":"2024-08-20T14:20:19Z","abstract_excerpt":"Most of the work on learning action models focus on learning the actions' dynamics from input plans. This allows us to specify the valid plans of a planning task. However, very little work focuses on learning action costs, which in turn allows us to rank the different plans. In this paper we introduce a new problem: that of learning the costs of a set of actions such that a set of input plans are optimal under the resulting planning model. To solve this problem we present $LACFIP^k$, an algorithm to learn action's costs from unlabeled input plans. We provide theoretical and empirical results s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10889","kind":"arxiv","version":3},"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/2408.10889/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-05T11:56:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LIFIJ34FkzCj4BEKts3yclU/hx14IH+hjuHy9gnBa8JQJeLlkXfFdRDi35m52cxeEfg52VXi71QG4WlgYAKeBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:36:27.121154Z"},"content_sha256":"9161a943ea5f098465abcadc96a713ca822bf3c9afc39e1ccca470b47382dadc","schema_version":"1.0","event_id":"sha256:9161a943ea5f098465abcadc96a713ca822bf3c9afc39e1ccca470b47382dadc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMM2U3PUBMKGWYOK676HCRZYYF/bundle.json","state_url":"https://pith.science/pith/TMM2U3PUBMKGWYOK676HCRZYYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMM2U3PUBMKGWYOK676HCRZYYF/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-15T17:36:27Z","links":{"resolver":"https://pith.science/pith/TMM2U3PUBMKGWYOK676HCRZYYF","bundle":"https://pith.science/pith/TMM2U3PUBMKGWYOK676HCRZYYF/bundle.json","state":"https://pith.science/pith/TMM2U3PUBMKGWYOK676HCRZYYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMM2U3PUBMKGWYOK676HCRZYYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TMM2U3PUBMKGWYOK676HCRZYYF","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":"4668adfe8e9d6b60dc12332533574075bb842c18a9d0e6decdffa847a3e8719a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-20T14:20:19Z","title_canon_sha256":"eec9890992796cf2abf9ac84e1ce1a6835d56ae3ed1d569839a06dea3c2af382"},"schema_version":"1.0","source":{"id":"2408.10889","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.10889","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"arxiv_version","alias_value":"2408.10889v3","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.10889","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"pith_short_12","alias_value":"TMM2U3PUBMKG","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"pith_short_16","alias_value":"TMM2U3PUBMKGWYOK","created_at":"2026-07-05T11:56:49Z"},{"alias_kind":"pith_short_8","alias_value":"TMM2U3PU","created_at":"2026-07-05T11:56:49Z"}],"graph_snapshots":[{"event_id":"sha256:9161a943ea5f098465abcadc96a713ca822bf3c9afc39e1ccca470b47382dadc","target":"graph","created_at":"2026-07-05T11:56:49Z","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/2408.10889/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Most of the work on learning action models focus on learning the actions' dynamics from input plans. This allows us to specify the valid plans of a planning task. However, very little work focuses on learning action costs, which in turn allows us to rank the different plans. In this paper we introduce a new problem: that of learning the costs of a set of actions such that a set of input plans are optimal under the resulting planning model. To solve this problem we present $LACFIP^k$, an algorithm to learn action's costs from unlabeled input plans. We provide theoretical and empirical results s","authors_text":"Alberto Pozanco, Daniel Borrajo, Giuseppe Canonaco, Manuela Veloso, Marianela Morales, Sriram Gopalakrishnan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-20T14:20:19Z","title":"On Learning Action Costs from Input Plans"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.10889","kind":"arxiv","version":3},"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:f0cb93583704fd9cfdaeea404f887361bbb2f7487932399c787720852dc57fb5","target":"record","created_at":"2026-07-05T11:56:49Z","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":"4668adfe8e9d6b60dc12332533574075bb842c18a9d0e6decdffa847a3e8719a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-08-20T14:20:19Z","title_canon_sha256":"eec9890992796cf2abf9ac84e1ce1a6835d56ae3ed1d569839a06dea3c2af382"},"schema_version":"1.0","source":{"id":"2408.10889","kind":"arxiv","version":3}},"canonical_sha256":"9b19aa6df40b146b61caf7fc714738c1586e55124be9cf8a8f0d7c42d129a603","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b19aa6df40b146b61caf7fc714738c1586e55124be9cf8a8f0d7c42d129a603","first_computed_at":"2026-07-05T11:56:49.369603Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:56:49.369603Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eFuw9/hRfC1PMzquPzGqliRi7ngCYcwcxeHHc0hO+wsNALkFgqs7OuM6kSgylzi0yTwP9N33U31y0XC1ZQ2OCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:56:49.370090Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.10889","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f0cb93583704fd9cfdaeea404f887361bbb2f7487932399c787720852dc57fb5","sha256:9161a943ea5f098465abcadc96a713ca822bf3c9afc39e1ccca470b47382dadc"],"state_sha256":"8ff10e690169f637142f9f74c4ac2e1dfe98adaebb835eb082847bdaec2917ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N5kuJ1hvvm+X5dpOtVLC7SZ2hCguFK3DElOaosuU7MgwGe1b7q/nMu7fKiuCUvxdJ36nplLH5k4ylUr0eEGBBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T17:36:27.124914Z","bundle_sha256":"05fd7375445744269510a2bb77b0a2e36f0c4086cfa219c43323535597b05594"}}