{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:HNI6NG53SHXQMP6JS6KLUHAAP3","short_pith_number":"pith:HNI6NG53","schema_version":"1.0","canonical_sha256":"3b51e69bbb91ef063fc99794ba1c007eff755b69998040d29b89fc74303a2acf","source":{"kind":"arxiv","id":"1905.03711","version":2},"attestation_state":"computed","paper":{"title":"Processing Megapixel Images with Deep Attention-Sampling Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Angelos Katharopoulos, Fran\\c{c}ois Fleuret","submitted_at":"2019-05-03T16:27:46Z","abstract_excerpt":"Existing deep architectures cannot operate on very large signals such as megapixel images due to computational and memory constraints. To tackle this limitation, we propose a fully differentiable end-to-end trainable model that samples and processes only a fraction of the full resolution input image. The locations to process are sampled from an attention distribution computed from a low resolution view of the input. We refer to our method as attention sampling and it can process images of several megapixels with a standard single GPU setup. We show that sampling from the attention distribution"},"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":"1905.03711","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-03T16:27:46Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5894c4282bd5fbe8eea11dcfbbccbbad180582349b6852ad138ae61e26c1485e","abstract_canon_sha256":"46f22aa83e068b96f4804a4af36d597e5255e3390e87acc1decccb92549b3c5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:23.303461Z","signature_b64":"DwHTsuRIH2Wlhk5QDPntuJN79bcIQfXDqcdUYq/M1WkDFiVRnY+8DmdJOwdzCZL9545t1oOW9ps6URtLKPAlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b51e69bbb91ef063fc99794ba1c007eff755b69998040d29b89fc74303a2acf","last_reissued_at":"2026-05-17T23:40:23.302865Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:23.302865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Processing Megapixel Images with Deep Attention-Sampling Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.CV","authors_text":"Angelos Katharopoulos, Fran\\c{c}ois Fleuret","submitted_at":"2019-05-03T16:27:46Z","abstract_excerpt":"Existing deep architectures cannot operate on very large signals such as megapixel images due to computational and memory constraints. To tackle this limitation, we propose a fully differentiable end-to-end trainable model that samples and processes only a fraction of the full resolution input image. The locations to process are sampled from an attention distribution computed from a low resolution view of the input. We refer to our method as attention sampling and it can process images of several megapixels with a standard single GPU setup. We show that sampling from the attention distribution"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03711","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":""},"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":"1905.03711","created_at":"2026-05-17T23:40:23.302944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.03711v2","created_at":"2026-05-17T23:40:23.302944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03711","created_at":"2026-05-17T23:40:23.302944+00:00"},{"alias_kind":"pith_short_12","alias_value":"HNI6NG53SHXQ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"HNI6NG53SHXQMP6J","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"HNI6NG53","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.11237","citing_title":"On the Generalizability of Iterative Patch Selection for Memory-Efficient High-Resolution Image Classification","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3","json":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3.json","graph_json":"https://pith.science/api/pith-number/HNI6NG53SHXQMP6JS6KLUHAAP3/graph.json","events_json":"https://pith.science/api/pith-number/HNI6NG53SHXQMP6JS6KLUHAAP3/events.json","paper":"https://pith.science/paper/HNI6NG53"},"agent_actions":{"view_html":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3","download_json":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3.json","view_paper":"https://pith.science/paper/HNI6NG53","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.03711&json=true","fetch_graph":"https://pith.science/api/pith-number/HNI6NG53SHXQMP6JS6KLUHAAP3/graph.json","fetch_events":"https://pith.science/api/pith-number/HNI6NG53SHXQMP6JS6KLUHAAP3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3/action/storage_attestation","attest_author":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3/action/author_attestation","sign_citation":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3/action/citation_signature","submit_replication":"https://pith.science/pith/HNI6NG53SHXQMP6JS6KLUHAAP3/action/replication_record"}},"created_at":"2026-05-17T23:40:23.302944+00:00","updated_at":"2026-05-17T23:40:23.302944+00:00"}