{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2CAWW4JG7T7QFXB7L3VRBAXC3B","short_pith_number":"pith:2CAWW4JG","schema_version":"1.0","canonical_sha256":"d0816b7126fcff02dc3f5eeb1082e2d86d9562ba994aad4f3d54cff4908f1a0d","source":{"kind":"arxiv","id":"2607.11029","version":1},"attestation_state":"computed","paper":{"title":"Learning to Navigate Efficiently with Only 0.58M Trainable Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Edward Beng Wai Tan, Siew-Kei Lam","submitted_at":"2026-07-13T02:49:55Z","abstract_excerpt":"Recent progress in visual navigation has largely been driven by scale: end-to-end policies with hundreds of millions of parameters trained on billions of frames or large-scale simulated data. We ask how much of this scale a single task family actually requires, and what structure can substitute for it. We propose a decomposed navigation model in which operations with known closed-form structure, such as projective geometry, occupancy, and coordinate transforms, are computed analytically and serve as interfaces between three small learned modules: an egress predictor that grounds the episode go"},"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":"2607.11029","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-07-13T02:49:55Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"3ce636f08795aaad7061c0d86b95840cc9f2a914ce1a5271a962a0dc2eac569c","abstract_canon_sha256":"ea0c63a9fe4ee6f9bf298aced576223a9fe80575c4b73ae87994a11381451483"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:53.514413Z","signature_b64":"Lh0vbosA1olDp34HgaOv7CGe9gH9haqaVEHeTNZG7ZAqQ/3E5U4sz5mPSS925T/1i0quEGVRMV/bt5zHF9QuDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0816b7126fcff02dc3f5eeb1082e2d86d9562ba994aad4f3d54cff4908f1a0d","last_reissued_at":"2026-07-14T01:21:53.513548Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:53.513548Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning to Navigate Efficiently with Only 0.58M Trainable Parameters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Edward Beng Wai Tan, Siew-Kei Lam","submitted_at":"2026-07-13T02:49:55Z","abstract_excerpt":"Recent progress in visual navigation has largely been driven by scale: end-to-end policies with hundreds of millions of parameters trained on billions of frames or large-scale simulated data. We ask how much of this scale a single task family actually requires, and what structure can substitute for it. We propose a decomposed navigation model in which operations with known closed-form structure, such as projective geometry, occupancy, and coordinate transforms, are computed analytically and serve as interfaces between three small learned modules: an egress predictor that grounds the episode go"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11029","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/2607.11029/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":"2607.11029","created_at":"2026-07-14T01:21:53.513990+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11029v1","created_at":"2026-07-14T01:21:53.513990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11029","created_at":"2026-07-14T01:21:53.513990+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CAWW4JG7T7Q","created_at":"2026-07-14T01:21:53.513990+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CAWW4JG7T7QFXB7","created_at":"2026-07-14T01:21:53.513990+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CAWW4JG","created_at":"2026-07-14T01:21:53.513990+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/2CAWW4JG7T7QFXB7L3VRBAXC3B","json":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B.json","graph_json":"https://pith.science/api/pith-number/2CAWW4JG7T7QFXB7L3VRBAXC3B/graph.json","events_json":"https://pith.science/api/pith-number/2CAWW4JG7T7QFXB7L3VRBAXC3B/events.json","paper":"https://pith.science/paper/2CAWW4JG"},"agent_actions":{"view_html":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B","download_json":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B.json","view_paper":"https://pith.science/paper/2CAWW4JG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11029&json=true","fetch_graph":"https://pith.science/api/pith-number/2CAWW4JG7T7QFXB7L3VRBAXC3B/graph.json","fetch_events":"https://pith.science/api/pith-number/2CAWW4JG7T7QFXB7L3VRBAXC3B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B/action/storage_attestation","attest_author":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B/action/author_attestation","sign_citation":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B/action/citation_signature","submit_replication":"https://pith.science/pith/2CAWW4JG7T7QFXB7L3VRBAXC3B/action/replication_record"}},"created_at":"2026-07-14T01:21:53.513990+00:00","updated_at":"2026-07-14T01:21:53.513990+00:00"}