{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:T2DPIAJJ5CHQB6ZK47TRWICO4P","short_pith_number":"pith:T2DPIAJJ","schema_version":"1.0","canonical_sha256":"9e86f40129e88f00fb2ae7e71b204ee3c663feba1acc07b22249bd5d241ddc98","source":{"kind":"arxiv","id":"2104.00749","version":2},"attestation_state":"computed","paper":{"title":"Anytime Dense Prediction with Confidence Adaptivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Evan Shelhamer, Hung-Ju Wang, Trevor Darrell, Zhiqiu Xu, Zhuang Liu","submitted_at":"2021-04-01T20:01:57Z","abstract_excerpt":"Anytime inference requires a model to make a progression of predictions which might be halted at any time. Prior research on anytime visual recognition has mostly focused on image classification. We propose the first unified and end-to-end approach for anytime dense prediction. A cascade of \"exits\" is attached to the model to make multiple predictions. We redesign the exits to account for the depth and spatial resolution of the features for each exit. To reduce total computation, and make full use of prior predictions, we develop a novel spatially adaptive approach to avoid further computation"},"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":"2104.00749","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-04-01T20:01:57Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"06ce2d6b95345cf72709fe573f72e832521f7971bd62ff1e070b3351658aa57e","abstract_canon_sha256":"612ac01bcaa736a7c03b42e517eb380838d293a9bb471f925d3d4d4d1e79c54a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:14.157368Z","signature_b64":"axG4cNjY15Jx7B4GI2+GHY3zU+CgP6t6FEJxaPi25UtIuuZ/Ug5HKhkf9qJ6+5nwwu6R0x52J+58dkwFEAyhBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e86f40129e88f00fb2ae7e71b204ee3c663feba1acc07b22249bd5d241ddc98","last_reissued_at":"2026-07-05T04:17:14.156920Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:14.156920Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anytime Dense Prediction with Confidence Adaptivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Evan Shelhamer, Hung-Ju Wang, Trevor Darrell, Zhiqiu Xu, Zhuang Liu","submitted_at":"2021-04-01T20:01:57Z","abstract_excerpt":"Anytime inference requires a model to make a progression of predictions which might be halted at any time. Prior research on anytime visual recognition has mostly focused on image classification. We propose the first unified and end-to-end approach for anytime dense prediction. A cascade of \"exits\" is attached to the model to make multiple predictions. We redesign the exits to account for the depth and spatial resolution of the features for each exit. To reduce total computation, and make full use of prior predictions, we develop a novel spatially adaptive approach to avoid further computation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.00749","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/2104.00749/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":"2104.00749","created_at":"2026-07-05T04:17:14.156978+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.00749v2","created_at":"2026-07-05T04:17:14.156978+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.00749","created_at":"2026-07-05T04:17:14.156978+00:00"},{"alias_kind":"pith_short_12","alias_value":"T2DPIAJJ5CHQ","created_at":"2026-07-05T04:17:14.156978+00:00"},{"alias_kind":"pith_short_16","alias_value":"T2DPIAJJ5CHQB6ZK","created_at":"2026-07-05T04:17:14.156978+00:00"},{"alias_kind":"pith_short_8","alias_value":"T2DPIAJJ","created_at":"2026-07-05T04:17:14.156978+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2404.02258","citing_title":"Mixture-of-Depths: Dynamically allocating compute in transformer-based language models","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P","json":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P.json","graph_json":"https://pith.science/api/pith-number/T2DPIAJJ5CHQB6ZK47TRWICO4P/graph.json","events_json":"https://pith.science/api/pith-number/T2DPIAJJ5CHQB6ZK47TRWICO4P/events.json","paper":"https://pith.science/paper/T2DPIAJJ"},"agent_actions":{"view_html":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P","download_json":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P.json","view_paper":"https://pith.science/paper/T2DPIAJJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.00749&json=true","fetch_graph":"https://pith.science/api/pith-number/T2DPIAJJ5CHQB6ZK47TRWICO4P/graph.json","fetch_events":"https://pith.science/api/pith-number/T2DPIAJJ5CHQB6ZK47TRWICO4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P/action/storage_attestation","attest_author":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P/action/author_attestation","sign_citation":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P/action/citation_signature","submit_replication":"https://pith.science/pith/T2DPIAJJ5CHQB6ZK47TRWICO4P/action/replication_record"}},"created_at":"2026-07-05T04:17:14.156978+00:00","updated_at":"2026-07-05T04:17:14.156978+00:00"}