{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NHF2GAD5Z4XZC6LMJT4T3B4PE7","short_pith_number":"pith:NHF2GAD5","schema_version":"1.0","canonical_sha256":"69cba3007dcf2f91796c4cf93d878f27ef0c74e8378ba5ae6e3a064d1868995f","source":{"kind":"arxiv","id":"1609.04212","version":3},"attestation_state":"computed","paper":{"title":"Formalizing Neurath's Ship: Approximate Algorithms for Online Causal Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David A. Lagnado, Neil R. Bramley, Peter Dayan, Thomas L. Griffiths","submitted_at":"2016-09-14T10:44:51Z","abstract_excerpt":"Higher-level cognition depends on the ability to learn models of the world. We can characterize this at the computational level as a structure-learning problem with the goal of best identifying the prevailing causal relationships among a set of relata. However, the computational cost of performing exact Bayesian inference over causal models grows rapidly as the number of relata increases. This implies that the cognitive processes underlying causal learning must be substantially approximate. A powerful class of approximations that focuses on the sequential absorption of successive inputs is cap"},"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":"1609.04212","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-09-14T10:44:51Z","cross_cats_sorted":[],"title_canon_sha256":"da29c26a5910d537933134aa29d0cfdf9c3f8418e92c672e1c4386f30e4b059b","abstract_canon_sha256":"e1c76d5ce81c1d98db72da46797b095d80ad913bbf5917d37d0669eaab785e21"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:39.632578Z","signature_b64":"DSRVXos4C3wj/xFeYqA1MCeoVmrBRR99E+DQpO6r6zv2Me6DobiLYWSLUZh36s8P2ttAJqsb9fUy56elhvKYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69cba3007dcf2f91796c4cf93d878f27ef0c74e8378ba5ae6e3a064d1868995f","last_reissued_at":"2026-05-18T00:43:39.632183Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:39.632183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Formalizing Neurath's Ship: Approximate Algorithms for Online Causal Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"David A. Lagnado, Neil R. Bramley, Peter Dayan, Thomas L. Griffiths","submitted_at":"2016-09-14T10:44:51Z","abstract_excerpt":"Higher-level cognition depends on the ability to learn models of the world. We can characterize this at the computational level as a structure-learning problem with the goal of best identifying the prevailing causal relationships among a set of relata. However, the computational cost of performing exact Bayesian inference over causal models grows rapidly as the number of relata increases. This implies that the cognitive processes underlying causal learning must be substantially approximate. A powerful class of approximations that focuses on the sequential absorption of successive inputs is cap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.04212","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":""},"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":"1609.04212","created_at":"2026-05-18T00:43:39.632245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.04212v3","created_at":"2026-05-18T00:43:39.632245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.04212","created_at":"2026-05-18T00:43:39.632245+00:00"},{"alias_kind":"pith_short_12","alias_value":"NHF2GAD5Z4XZ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NHF2GAD5Z4XZC6LM","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NHF2GAD5","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7","json":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7.json","graph_json":"https://pith.science/api/pith-number/NHF2GAD5Z4XZC6LMJT4T3B4PE7/graph.json","events_json":"https://pith.science/api/pith-number/NHF2GAD5Z4XZC6LMJT4T3B4PE7/events.json","paper":"https://pith.science/paper/NHF2GAD5"},"agent_actions":{"view_html":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7","download_json":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7.json","view_paper":"https://pith.science/paper/NHF2GAD5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.04212&json=true","fetch_graph":"https://pith.science/api/pith-number/NHF2GAD5Z4XZC6LMJT4T3B4PE7/graph.json","fetch_events":"https://pith.science/api/pith-number/NHF2GAD5Z4XZC6LMJT4T3B4PE7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7/action/storage_attestation","attest_author":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7/action/author_attestation","sign_citation":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7/action/citation_signature","submit_replication":"https://pith.science/pith/NHF2GAD5Z4XZC6LMJT4T3B4PE7/action/replication_record"}},"created_at":"2026-05-18T00:43:39.632245+00:00","updated_at":"2026-05-18T00:43:39.632245+00:00"}