{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:SJW4YHCNTHOTOPXZSYDTPGV72N","short_pith_number":"pith:SJW4YHCN","canonical_record":{"source":{"id":"1807.07134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-18T20:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"3b306e4f7e9c94813553abd0180a75d58fc4941feb3157e3ad350199dc928604","abstract_canon_sha256":"c2293139eb73601c75df6ee9245feb4d02631834de3823e557812174047f0000"},"schema_version":"1.0"},"canonical_sha256":"926dcc1c4d99dd373ef99607379abfd35488016bbd1f2b012477f48074e7bc26","source":{"kind":"arxiv","id":"1807.07134","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07134","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07134v1","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07134","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"pith_short_12","alias_value":"SJW4YHCNTHOT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SJW4YHCNTHOTOPXZ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SJW4YHCN","created_at":"2026-05-18T12:32:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:SJW4YHCNTHOTOPXZSYDTPGV72N","target":"record","payload":{"canonical_record":{"source":{"id":"1807.07134","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-18T20:20:40Z","cross_cats_sorted":[],"title_canon_sha256":"3b306e4f7e9c94813553abd0180a75d58fc4941feb3157e3ad350199dc928604","abstract_canon_sha256":"c2293139eb73601c75df6ee9245feb4d02631834de3823e557812174047f0000"},"schema_version":"1.0"},"canonical_sha256":"926dcc1c4d99dd373ef99607379abfd35488016bbd1f2b012477f48074e7bc26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:21.191419Z","signature_b64":"i6OBGHE9/aO0nrhl5b18WNh9tJzjXbKRUEUSDogf/sBfslz+UDOlhjkRUZaRXEJr6EzmDT62jjTd1HD5hhO9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926dcc1c4d99dd373ef99607379abfd35488016bbd1f2b012477f48074e7bc26","last_reissued_at":"2026-05-18T00:10:21.190573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:21.190573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.07134","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-18T00:10:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q4VMS9191j33fvhy8S6u1lxUFyQkM5l/mJjeMd71Tf0dSBsozFfKnVnDcrgWjyitCRYX1wsVTKZw2cTM2FLqCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:26.277654Z"},"content_sha256":"aaa1569324228e96316fe951b10539682d908e71f1b2f5c43297d2655a9605fa","schema_version":"1.0","event_id":"sha256:aaa1569324228e96316fe951b10539682d908e71f1b2f5c43297d2655a9605fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:SJW4YHCNTHOTOPXZSYDTPGV72N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representational efficiency outweighs action efficiency in human program induction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David D. Bourgin, Michael Chang, Sophia Sanborn, Thomas L. Griffiths","submitted_at":"2018-07-18T20:20:40Z","abstract_excerpt":"The importance of hierarchically structured representations for tractable planning has long been acknowledged. However, the questions of how people discover such abstractions and how to define a set of optimal abstractions remain open. This problem has been explored in cognitive science in the problem solving literature and in computer science in hierarchical reinforcement learning. Here, we emphasize an algorithmic perspective on learning hierarchical representations in which the objective is to efficiently encode the structure of the problem, or, equivalently, to learn an algorithm with mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07134","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-18T00:10:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mZ6pJh2jxrjkIIMVL/l1RpJqyFfCi/TC3N5/yA5lN4aIaKqOrhziPnWEEX401SBoBBTAdbKcFwNbiVnUMbAMCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T17:18:26.278408Z"},"content_sha256":"bb5f31f9c07ea89c654a81cfc912ba958003d939e15c5d90a4e259571f2d90c0","schema_version":"1.0","event_id":"sha256:bb5f31f9c07ea89c654a81cfc912ba958003d939e15c5d90a4e259571f2d90c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJW4YHCNTHOTOPXZSYDTPGV72N/bundle.json","state_url":"https://pith.science/pith/SJW4YHCNTHOTOPXZSYDTPGV72N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJW4YHCNTHOTOPXZSYDTPGV72N/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-11T17:18:26Z","links":{"resolver":"https://pith.science/pith/SJW4YHCNTHOTOPXZSYDTPGV72N","bundle":"https://pith.science/pith/SJW4YHCNTHOTOPXZSYDTPGV72N/bundle.json","state":"https://pith.science/pith/SJW4YHCNTHOTOPXZSYDTPGV72N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJW4YHCNTHOTOPXZSYDTPGV72N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:SJW4YHCNTHOTOPXZSYDTPGV72N","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":"c2293139eb73601c75df6ee9245feb4d02631834de3823e557812174047f0000","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-18T20:20:40Z","title_canon_sha256":"3b306e4f7e9c94813553abd0180a75d58fc4941feb3157e3ad350199dc928604"},"schema_version":"1.0","source":{"id":"1807.07134","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.07134","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"arxiv_version","alias_value":"1807.07134v1","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.07134","created_at":"2026-05-18T00:10:21Z"},{"alias_kind":"pith_short_12","alias_value":"SJW4YHCNTHOT","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"SJW4YHCNTHOTOPXZ","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"SJW4YHCN","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:bb5f31f9c07ea89c654a81cfc912ba958003d939e15c5d90a4e259571f2d90c0","target":"graph","created_at":"2026-05-18T00:10:21Z","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":"The importance of hierarchically structured representations for tractable planning has long been acknowledged. However, the questions of how people discover such abstractions and how to define a set of optimal abstractions remain open. This problem has been explored in cognitive science in the problem solving literature and in computer science in hierarchical reinforcement learning. Here, we emphasize an algorithmic perspective on learning hierarchical representations in which the objective is to efficiently encode the structure of the problem, or, equivalently, to learn an algorithm with mini","authors_text":"David D. Bourgin, Michael Chang, Sophia Sanborn, Thomas L. Griffiths","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-18T20:20:40Z","title":"Representational efficiency outweighs action efficiency in human program induction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.07134","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:aaa1569324228e96316fe951b10539682d908e71f1b2f5c43297d2655a9605fa","target":"record","created_at":"2026-05-18T00:10:21Z","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":"c2293139eb73601c75df6ee9245feb4d02631834de3823e557812174047f0000","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-07-18T20:20:40Z","title_canon_sha256":"3b306e4f7e9c94813553abd0180a75d58fc4941feb3157e3ad350199dc928604"},"schema_version":"1.0","source":{"id":"1807.07134","kind":"arxiv","version":1}},"canonical_sha256":"926dcc1c4d99dd373ef99607379abfd35488016bbd1f2b012477f48074e7bc26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"926dcc1c4d99dd373ef99607379abfd35488016bbd1f2b012477f48074e7bc26","first_computed_at":"2026-05-18T00:10:21.190573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:21.190573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i6OBGHE9/aO0nrhl5b18WNh9tJzjXbKRUEUSDogf/sBfslz+UDOlhjkRUZaRXEJr6EzmDT62jjTd1HD5hhO9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:21.191419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.07134","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaa1569324228e96316fe951b10539682d908e71f1b2f5c43297d2655a9605fa","sha256:bb5f31f9c07ea89c654a81cfc912ba958003d939e15c5d90a4e259571f2d90c0"],"state_sha256":"2ada5548e5aa11fddb53e74c94f8ec4f7d2618eb9f3a76041cb847a963db013f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8DSZFLAI9yWqpzdNtY9TDhmt1bT9GJkZtq/T9K3/Rz47DDVXuSnUoO0oTBg0P33dbY+RqAzCjkzPBiV5RKXIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T17:18:26.282543Z","bundle_sha256":"858622f0b418e7d0e1e7c592a4334954ca2e81e131f33061c54ffe61973d4772"}}