{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:TKJYAOHWCJFL5S5VTI6C6E7F4G","short_pith_number":"pith:TKJYAOHW","schema_version":"1.0","canonical_sha256":"9a938038f6124abecbb59a3c2f13e5e19fe9487903cd6a318199f149fd67e313","source":{"kind":"arxiv","id":"2509.03370","version":1},"attestation_state":"computed","paper":{"title":"Neural Field Turing Machine: A Differentiable Spatial Computer","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Akash Malhotra, Nac\\'era Seghouani","submitted_at":"2025-08-27T22:29:15Z","abstract_excerpt":"We introduce the Neural Field Turing Machine (NFTM), a differentiable architecture that unifies symbolic computation, physical simulation, and perceptual inference within continuous spatial fields. NFTM combines a neural controller, continuous memory field, and movable read/write heads that perform local updates. At each timestep, the controller reads local patches, computes updates via learned rules, and writes them back while updating head positions. This design achieves linear O(N) scaling through fixed-radius neighborhoods while maintaining Turing completeness under bounded error. We demon"},"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":"2509.03370","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.NE","submitted_at":"2025-08-27T22:29:15Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"12b245045f763a21d2b13ff27d65f272937a871fd32b152f7a1fca7e30c725be","abstract_canon_sha256":"2dbdc242f065a85340a127908fd2bc60b12a5cb586c76d032acaa7f6d43d897a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:04:21.375806Z","signature_b64":"erCT3nG8zDAT3466KWsE0yon+NwYBxVO4A7DeokbDwo5L+8A3ga66ZBVe7hYGjoFWyEQuJxpbMi80Z1FvT5ADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a938038f6124abecbb59a3c2f13e5e19fe9487903cd6a318199f149fd67e313","last_reissued_at":"2026-07-05T12:04:21.375291Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:04:21.375291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Field Turing Machine: A Differentiable Spatial Computer","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.NE","authors_text":"Akash Malhotra, Nac\\'era Seghouani","submitted_at":"2025-08-27T22:29:15Z","abstract_excerpt":"We introduce the Neural Field Turing Machine (NFTM), a differentiable architecture that unifies symbolic computation, physical simulation, and perceptual inference within continuous spatial fields. NFTM combines a neural controller, continuous memory field, and movable read/write heads that perform local updates. At each timestep, the controller reads local patches, computes updates via learned rules, and writes them back while updating head positions. This design achieves linear O(N) scaling through fixed-radius neighborhoods while maintaining Turing completeness under bounded error. We demon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.03370","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/2509.03370/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":"2509.03370","created_at":"2026-07-05T12:04:21.375359+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.03370v1","created_at":"2026-07-05T12:04:21.375359+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.03370","created_at":"2026-07-05T12:04:21.375359+00:00"},{"alias_kind":"pith_short_12","alias_value":"TKJYAOHWCJFL","created_at":"2026-07-05T12:04:21.375359+00:00"},{"alias_kind":"pith_short_16","alias_value":"TKJYAOHWCJFL5S5V","created_at":"2026-07-05T12:04:21.375359+00:00"},{"alias_kind":"pith_short_8","alias_value":"TKJYAOHW","created_at":"2026-07-05T12:04:21.375359+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27686","citing_title":"Tensor Memory: Fixed-Size Recurrent State for Long-Horizon Transformers","ref_index":24,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G","json":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G.json","graph_json":"https://pith.science/api/pith-number/TKJYAOHWCJFL5S5VTI6C6E7F4G/graph.json","events_json":"https://pith.science/api/pith-number/TKJYAOHWCJFL5S5VTI6C6E7F4G/events.json","paper":"https://pith.science/paper/TKJYAOHW"},"agent_actions":{"view_html":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G","download_json":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G.json","view_paper":"https://pith.science/paper/TKJYAOHW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.03370&json=true","fetch_graph":"https://pith.science/api/pith-number/TKJYAOHWCJFL5S5VTI6C6E7F4G/graph.json","fetch_events":"https://pith.science/api/pith-number/TKJYAOHWCJFL5S5VTI6C6E7F4G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G/action/storage_attestation","attest_author":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G/action/author_attestation","sign_citation":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G/action/citation_signature","submit_replication":"https://pith.science/pith/TKJYAOHWCJFL5S5VTI6C6E7F4G/action/replication_record"}},"created_at":"2026-07-05T12:04:21.375359+00:00","updated_at":"2026-07-05T12:04:21.375359+00:00"}