{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:E3JRPAEH4RQ4BICFFQJCLH7VJS","short_pith_number":"pith:E3JRPAEH","canonical_record":{"source":{"id":"2410.10011","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-13T21:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"23c48fbe6095b5e88ff0454ea7d87f1b6f6c8e9b903b35e3dfb79fd50149d635","abstract_canon_sha256":"f74ec6dc242c2e319d7dbc064ee7ed5cf3aa2b93e4fa59cca89800b5af7cb59a"},"schema_version":"1.0"},"canonical_sha256":"26d3178087e461c0a0452c12259ff54c82584e5367448eabac41201475dee5ab","source":{"kind":"arxiv","id":"2410.10011","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10011","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10011v1","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10011","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"E3JRPAEH4RQ4","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"pith_short_16","alias_value":"E3JRPAEH4RQ4BICF","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"pith_short_8","alias_value":"E3JRPAEH","created_at":"2026-07-05T09:20:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:E3JRPAEH4RQ4BICFFQJCLH7VJS","target":"record","payload":{"canonical_record":{"source":{"id":"2410.10011","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-13T21:12:45Z","cross_cats_sorted":[],"title_canon_sha256":"23c48fbe6095b5e88ff0454ea7d87f1b6f6c8e9b903b35e3dfb79fd50149d635","abstract_canon_sha256":"f74ec6dc242c2e319d7dbc064ee7ed5cf3aa2b93e4fa59cca89800b5af7cb59a"},"schema_version":"1.0"},"canonical_sha256":"26d3178087e461c0a0452c12259ff54c82584e5367448eabac41201475dee5ab","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:20:09.445978Z","signature_b64":"167NQ7qQgf1EbGzHmjLrgBp3E4fODGtbky1fSO6zWMhPYyn9UvJdGPgrgw+o5Tw55mPUrKs8UITs4OyJr+4RDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26d3178087e461c0a0452c12259ff54c82584e5367448eabac41201475dee5ab","last_reissued_at":"2026-07-05T09:20:09.445543Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:20:09.445543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2410.10011","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-05T09:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wnr6b2TdocqdBl0if3YiN5AJnuez5M4ZGizbfXW8cEWa0S9b7Qvx6vy03mV7eWec4tK6Nu+EFubqg6s+AY0IAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:31:33.668072Z"},"content_sha256":"06543249ef60f0e7bc9089c8f7b216cfa1fbf8a51b260bddb418cee02b051c3a","schema_version":"1.0","event_id":"sha256:06543249ef60f0e7bc9089c8f7b216cfa1fbf8a51b260bddb418cee02b051c3a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:E3JRPAEH4RQ4BICFFQJCLH7VJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Interpretable Classifiers for PDDL Planning","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Arnaud Lequen","submitted_at":"2024-10-13T21:12:45Z","abstract_excerpt":"We consider the problem of synthesizing interpretable models that recognize the behaviour of an agent compared to other agents, on a whole set of similar planning tasks expressed in PDDL. Our approach consists in learning logical formulas, from a small set of examples that show how an agent solved small planning instances. These formulas are expressed in a version of First-Order Temporal Logic (FTL) tailored to our planning formalism. Such formulas are human-readable, serve as (partial) descriptions of an agent's policy, and generalize to unseen instances. We show that learning such formulas i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10011","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/2410.10011/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-05T09:20:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7GFHoF2o6Iv7MiWOW6XQKAY72YYyd8HY4x4eEfaRD+9LAPlKdto4vgDAPv4leOKAhqhi5Z1ep+AtxqyJRZFbDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T18:31:33.668468Z"},"content_sha256":"7034eeaadf4706e564fa983c7773b5cd44e54d11f36d020a0b5b1fb037ffdf09","schema_version":"1.0","event_id":"sha256:7034eeaadf4706e564fa983c7773b5cd44e54d11f36d020a0b5b1fb037ffdf09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3JRPAEH4RQ4BICFFQJCLH7VJS/bundle.json","state_url":"https://pith.science/pith/E3JRPAEH4RQ4BICFFQJCLH7VJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3JRPAEH4RQ4BICFFQJCLH7VJS/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:31:33Z","links":{"resolver":"https://pith.science/pith/E3JRPAEH4RQ4BICFFQJCLH7VJS","bundle":"https://pith.science/pith/E3JRPAEH4RQ4BICFFQJCLH7VJS/bundle.json","state":"https://pith.science/pith/E3JRPAEH4RQ4BICFFQJCLH7VJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3JRPAEH4RQ4BICFFQJCLH7VJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:E3JRPAEH4RQ4BICFFQJCLH7VJS","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":"f74ec6dc242c2e319d7dbc064ee7ed5cf3aa2b93e4fa59cca89800b5af7cb59a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-13T21:12:45Z","title_canon_sha256":"23c48fbe6095b5e88ff0454ea7d87f1b6f6c8e9b903b35e3dfb79fd50149d635"},"schema_version":"1.0","source":{"id":"2410.10011","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2410.10011","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"arxiv_version","alias_value":"2410.10011v1","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10011","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"pith_short_12","alias_value":"E3JRPAEH4RQ4","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"pith_short_16","alias_value":"E3JRPAEH4RQ4BICF","created_at":"2026-07-05T09:20:09Z"},{"alias_kind":"pith_short_8","alias_value":"E3JRPAEH","created_at":"2026-07-05T09:20:09Z"}],"graph_snapshots":[{"event_id":"sha256:7034eeaadf4706e564fa983c7773b5cd44e54d11f36d020a0b5b1fb037ffdf09","target":"graph","created_at":"2026-07-05T09:20:09Z","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/2410.10011/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of synthesizing interpretable models that recognize the behaviour of an agent compared to other agents, on a whole set of similar planning tasks expressed in PDDL. Our approach consists in learning logical formulas, from a small set of examples that show how an agent solved small planning instances. These formulas are expressed in a version of First-Order Temporal Logic (FTL) tailored to our planning formalism. Such formulas are human-readable, serve as (partial) descriptions of an agent's policy, and generalize to unseen instances. We show that learning such formulas i","authors_text":"Arnaud Lequen","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-13T21:12:45Z","title":"Learning Interpretable Classifiers for PDDL Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10011","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:06543249ef60f0e7bc9089c8f7b216cfa1fbf8a51b260bddb418cee02b051c3a","target":"record","created_at":"2026-07-05T09:20:09Z","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":"f74ec6dc242c2e319d7dbc064ee7ed5cf3aa2b93e4fa59cca89800b5af7cb59a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.AI","submitted_at":"2024-10-13T21:12:45Z","title_canon_sha256":"23c48fbe6095b5e88ff0454ea7d87f1b6f6c8e9b903b35e3dfb79fd50149d635"},"schema_version":"1.0","source":{"id":"2410.10011","kind":"arxiv","version":1}},"canonical_sha256":"26d3178087e461c0a0452c12259ff54c82584e5367448eabac41201475dee5ab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26d3178087e461c0a0452c12259ff54c82584e5367448eabac41201475dee5ab","first_computed_at":"2026-07-05T09:20:09.445543Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:20:09.445543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"167NQ7qQgf1EbGzHmjLrgBp3E4fODGtbky1fSO6zWMhPYyn9UvJdGPgrgw+o5Tw55mPUrKs8UITs4OyJr+4RDA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:20:09.445978Z","signed_message":"canonical_sha256_bytes"},"source_id":"2410.10011","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06543249ef60f0e7bc9089c8f7b216cfa1fbf8a51b260bddb418cee02b051c3a","sha256:7034eeaadf4706e564fa983c7773b5cd44e54d11f36d020a0b5b1fb037ffdf09"],"state_sha256":"390ceb73a597df31fadabf331c26c21219d35d8fcaf5d8ad77c2f285bb18a951"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vLFyLS4eIW49KxWPSf7As06rUP0ua8hjKU3fagA+fRcAxsZ7pazB5OIC2ZO277tNpXnC5OotMh0ZfClgsnGfCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T18:31:33.670472Z","bundle_sha256":"fbf624e1e942e1ef42a90476593c212f0abc6a88106ad924ffb3f99c8d1f7730"}}