{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:CBR2J2PMUVY5BJQBIBPT2RXAVE","short_pith_number":"pith:CBR2J2PM","schema_version":"1.0","canonical_sha256":"1063a4e9eca571d0a601405f3d46e0a927d9d8831e581aec5976e9e95bafc6e5","source":{"kind":"arxiv","id":"2412.04758","version":1},"attestation_state":"computed","paper":{"title":"Measuring Goal-Directedness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Francesco Belardinelli, James Fox, Matt MacDermott, Tom Everitt","submitted_at":"2024-12-06T03:48:47Z","abstract_excerpt":"We define maximum entropy goal-directedness (MEG), a formal measure of goal-directedness in causal models and Markov decision processes, and give algorithms for computing it. Measuring goal-directedness is important, as it is a critical element of many concerns about harm from AI. It is also of philosophical interest, as goal-directedness is a key aspect of agency. MEG is based on an adaptation of the maximum causal entropy framework used in inverse reinforcement learning. It can measure goal-directedness with respect to a known utility function, a hypothesis class of utility functions, or a s"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2412.04758","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2024-12-06T03:48:47Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"a8785db5785d4e6698c899b9059760461410de87268245a3d6b3f326ecddf416","abstract_canon_sha256":"d7914c434927f608e8a023649591dcd1dcdc7eb00dba0f07eedd8a2b30569df0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:45:23.338757Z","signature_b64":"1WUXek5wIwDepXAbvLRyJvL724TBICPrI5Rk+4gaP+aUAxQlKCXVzl3y7HQU8+epmuFjr2e3jSIf2c/onMClCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1063a4e9eca571d0a601405f3d46e0a927d9d8831e581aec5976e9e95bafc6e5","last_reissued_at":"2026-07-05T09:45:23.338231Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:45:23.338231Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measuring Goal-Directedness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Francesco Belardinelli, James Fox, Matt MacDermott, Tom Everitt","submitted_at":"2024-12-06T03:48:47Z","abstract_excerpt":"We define maximum entropy goal-directedness (MEG), a formal measure of goal-directedness in causal models and Markov decision processes, and give algorithms for computing it. Measuring goal-directedness is important, as it is a critical element of many concerns about harm from AI. It is also of philosophical interest, as goal-directedness is a key aspect of agency. MEG is based on an adaptation of the maximum causal entropy framework used in inverse reinforcement learning. It can measure goal-directedness with respect to a known utility function, a hypothesis class of utility functions, or a s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.04758","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/2412.04758/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2412.04758","created_at":"2026-07-05T09:45:23.338298+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.04758v1","created_at":"2026-07-05T09:45:23.338298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.04758","created_at":"2026-07-05T09:45:23.338298+00:00"},{"alias_kind":"pith_short_12","alias_value":"CBR2J2PMUVY5","created_at":"2026-07-05T09:45:23.338298+00:00"},{"alias_kind":"pith_short_16","alias_value":"CBR2J2PMUVY5BJQB","created_at":"2026-07-05T09:45:23.338298+00:00"},{"alias_kind":"pith_short_8","alias_value":"CBR2J2PM","created_at":"2026-07-05T09:45:23.338298+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12268","citing_title":"The Impossibility of Eliciting Latent Knowledge","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE","json":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE.json","graph_json":"https://pith.science/api/pith-number/CBR2J2PMUVY5BJQBIBPT2RXAVE/graph.json","events_json":"https://pith.science/api/pith-number/CBR2J2PMUVY5BJQBIBPT2RXAVE/events.json","paper":"https://pith.science/paper/CBR2J2PM"},"agent_actions":{"view_html":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE","download_json":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE.json","view_paper":"https://pith.science/paper/CBR2J2PM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.04758&json=true","fetch_graph":"https://pith.science/api/pith-number/CBR2J2PMUVY5BJQBIBPT2RXAVE/graph.json","fetch_events":"https://pith.science/api/pith-number/CBR2J2PMUVY5BJQBIBPT2RXAVE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE/action/storage_attestation","attest_author":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE/action/author_attestation","sign_citation":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE/action/citation_signature","submit_replication":"https://pith.science/pith/CBR2J2PMUVY5BJQBIBPT2RXAVE/action/replication_record"}},"created_at":"2026-07-05T09:45:23.338298+00:00","updated_at":"2026-07-05T09:45:23.338298+00:00"}