{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:W3K432FWJGSRE3VZ3Q6FZNHK5N","short_pith_number":"pith:W3K432FW","schema_version":"1.0","canonical_sha256":"b6d5cde8b649a5126eb9dc3c5cb4eaeb518791be8a983865376d1e3fd369fd4d","source":{"kind":"arxiv","id":"2106.12534","version":2},"attestation_state":"computed","paper":{"title":"Coarse-to-Fine Q-attention: Efficient Learning for Visual Robotic Manipulation via Discretisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"cs.RO","authors_text":"Andrew J. Davison, Kentaro Wada, Stephen James, Tristan Laidlow","submitted_at":"2021-06-23T16:57:16Z","abstract_excerpt":"We present a coarse-to-fine discretisation method that enables the use of discrete reinforcement learning approaches in place of unstable and data-inefficient actor-critic methods in continuous robotics domains. This approach builds on the recently released ARM algorithm, which replaces the continuous next-best pose agent with a discrete one, with coarse-to-fine Q-attention. Given a voxelised scene, coarse-to-fine Q-attention learns what part of the scene to 'zoom' into. When this 'zooming' behaviour is applied iteratively, it results in a near-lossless discretisation of the translation space,"},"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":"2106.12534","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2021-06-23T16:57:16Z","cross_cats_sorted":["cs.AI","cs.CV","cs.LG"],"title_canon_sha256":"2427442eeb40e2652cf81265c5cab26a18239f1a602b684df673794ef06c7718","abstract_canon_sha256":"f16c2330ce2c61e88d605332b050980a30d2fb490eab5fd12ebf242058764e20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:05:12.056100Z","signature_b64":"i1Apw5nvigcE1f42Ms6MskRi0MlwJxBssJd2WJudZ0ENuww938jtjkucoKfvuGoK0TX7tcxkWi5WOp83D3xYAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6d5cde8b649a5126eb9dc3c5cb4eaeb518791be8a983865376d1e3fd369fd4d","last_reissued_at":"2026-07-05T04:05:12.055636Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:05:12.055636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coarse-to-Fine Q-attention: Efficient Learning for Visual Robotic Manipulation via Discretisation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","cs.LG"],"primary_cat":"cs.RO","authors_text":"Andrew J. Davison, Kentaro Wada, Stephen James, Tristan Laidlow","submitted_at":"2021-06-23T16:57:16Z","abstract_excerpt":"We present a coarse-to-fine discretisation method that enables the use of discrete reinforcement learning approaches in place of unstable and data-inefficient actor-critic methods in continuous robotics domains. This approach builds on the recently released ARM algorithm, which replaces the continuous next-best pose agent with a discrete one, with coarse-to-fine Q-attention. Given a voxelised scene, coarse-to-fine Q-attention learns what part of the scene to 'zoom' into. When this 'zooming' behaviour is applied iteratively, it results in a near-lossless discretisation of the translation space,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2106.12534","kind":"arxiv","version":2},"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/2106.12534/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":"2106.12534","created_at":"2026-07-05T04:05:12.055697+00:00"},{"alias_kind":"arxiv_version","alias_value":"2106.12534v2","created_at":"2026-07-05T04:05:12.055697+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2106.12534","created_at":"2026-07-05T04:05:12.055697+00:00"},{"alias_kind":"pith_short_12","alias_value":"W3K432FWJGSR","created_at":"2026-07-05T04:05:12.055697+00:00"},{"alias_kind":"pith_short_16","alias_value":"W3K432FWJGSRE3VZ","created_at":"2026-07-05T04:05:12.055697+00:00"},{"alias_kind":"pith_short_8","alias_value":"W3K432FW","created_at":"2026-07-05T04:05:12.055697+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.11467","citing_title":"Exploiting Radiance Fields for Grasp Generation on Novel Synthetic Views","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N","json":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N.json","graph_json":"https://pith.science/api/pith-number/W3K432FWJGSRE3VZ3Q6FZNHK5N/graph.json","events_json":"https://pith.science/api/pith-number/W3K432FWJGSRE3VZ3Q6FZNHK5N/events.json","paper":"https://pith.science/paper/W3K432FW"},"agent_actions":{"view_html":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N","download_json":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N.json","view_paper":"https://pith.science/paper/W3K432FW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2106.12534&json=true","fetch_graph":"https://pith.science/api/pith-number/W3K432FWJGSRE3VZ3Q6FZNHK5N/graph.json","fetch_events":"https://pith.science/api/pith-number/W3K432FWJGSRE3VZ3Q6FZNHK5N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N/action/storage_attestation","attest_author":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N/action/author_attestation","sign_citation":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N/action/citation_signature","submit_replication":"https://pith.science/pith/W3K432FWJGSRE3VZ3Q6FZNHK5N/action/replication_record"}},"created_at":"2026-07-05T04:05:12.055697+00:00","updated_at":"2026-07-05T04:05:12.055697+00:00"}