{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MBAWPOCSJMQH4DWL66X6WCRTER","short_pith_number":"pith:MBAWPOCS","schema_version":"1.0","canonical_sha256":"604167b8524b207e0ecbf7afeb0a3324549073ca6fad0a18b895ed69333f5c5a","source":{"kind":"arxiv","id":"1802.06426","version":3},"attestation_state":"computed","paper":{"title":"Estimating scale-invariant future in continuous time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"cs.AI","authors_text":"Marc W. Howard, Per B. Sederberg, Samuel J. Gershman, Zoran Tiganj","submitted_at":"2018-02-18T19:09:28Z","abstract_excerpt":"Natural learners must compute an estimate of future outcomes that follow from a stimulus in continuous time. Widely used reinforcement learning algorithms discretize continuous time and estimate either transition functions from one step to the next (model-based algorithms) or a scalar value of exponentially-discounted future reward using the Bellman equation (model-free algorithms). An important drawback of model-based algorithms is that computational cost grows linearly with the amount of time to be simulated. On the other hand, an important drawback of model-free algorithms is the need to se"},"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":"1802.06426","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-02-18T19:09:28Z","cross_cats_sorted":["q-bio.NC"],"title_canon_sha256":"9f7cc05b5ead8469686f8eb5a450f30a32804f48306b48b67c3383f8f9085101","abstract_canon_sha256":"c69e2b979b6b917f2f9ad9e4b34b708eec944f58eab7e45a75814c759d6b77f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:12.863104Z","signature_b64":"sEbDoQgWQv6r4blN21sKc8vjiotl2Rscit60Gmj2Dwpy+umno3UQnt4O47hYPisuvHHpTQe6Ajx2XlPHrUjfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"604167b8524b207e0ecbf7afeb0a3324549073ca6fad0a18b895ed69333f5c5a","last_reissued_at":"2026-05-18T00:02:12.862396Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:12.862396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Estimating scale-invariant future in continuous time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.NC"],"primary_cat":"cs.AI","authors_text":"Marc W. Howard, Per B. Sederberg, Samuel J. Gershman, Zoran Tiganj","submitted_at":"2018-02-18T19:09:28Z","abstract_excerpt":"Natural learners must compute an estimate of future outcomes that follow from a stimulus in continuous time. Widely used reinforcement learning algorithms discretize continuous time and estimate either transition functions from one step to the next (model-based algorithms) or a scalar value of exponentially-discounted future reward using the Bellman equation (model-free algorithms). An important drawback of model-based algorithms is that computational cost grows linearly with the amount of time to be simulated. On the other hand, an important drawback of model-free algorithms is the need to se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06426","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":"1802.06426","created_at":"2026-05-18T00:02:12.862508+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06426v3","created_at":"2026-05-18T00:02:12.862508+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06426","created_at":"2026-05-18T00:02:12.862508+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBAWPOCSJMQH","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBAWPOCSJMQH4DWL","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBAWPOCS","created_at":"2026-05-18T12:32:37.024351+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/MBAWPOCSJMQH4DWL66X6WCRTER","json":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER.json","graph_json":"https://pith.science/api/pith-number/MBAWPOCSJMQH4DWL66X6WCRTER/graph.json","events_json":"https://pith.science/api/pith-number/MBAWPOCSJMQH4DWL66X6WCRTER/events.json","paper":"https://pith.science/paper/MBAWPOCS"},"agent_actions":{"view_html":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER","download_json":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER.json","view_paper":"https://pith.science/paper/MBAWPOCS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06426&json=true","fetch_graph":"https://pith.science/api/pith-number/MBAWPOCSJMQH4DWL66X6WCRTER/graph.json","fetch_events":"https://pith.science/api/pith-number/MBAWPOCSJMQH4DWL66X6WCRTER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER/action/storage_attestation","attest_author":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER/action/author_attestation","sign_citation":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER/action/citation_signature","submit_replication":"https://pith.science/pith/MBAWPOCSJMQH4DWL66X6WCRTER/action/replication_record"}},"created_at":"2026-05-18T00:02:12.862508+00:00","updated_at":"2026-05-18T00:02:12.862508+00:00"}