{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GR6TDX2SXMN6K6QQCP56CPTZVP","short_pith_number":"pith:GR6TDX2S","schema_version":"1.0","canonical_sha256":"347d31df52bb1be57a1013fbe13e79abf5cb5a5e3509e1c4955e7c561cb3c318","source":{"kind":"arxiv","id":"1602.08761","version":2},"attestation_state":"computed","paper":{"title":"Resource Constrained Structured Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Joseph Wang, Kai-Wei Chang, Tolga Bolukbasi, Venkatesh Saligrama","submitted_at":"2016-02-28T19:44:57Z","abstract_excerpt":"We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in order to reduce the computational cost of prediction while maintaining prediction performance. We show that training the adaptive feature generation system can be reduced to a series of structured learning problems, resulting in efficient training using existing structured learning "},"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":"1602.08761","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-28T19:44:57Z","cross_cats_sorted":["cs.CL","cs.CV","cs.LG"],"title_canon_sha256":"751bde28b9cfeea9e873a9f9ac9381aa7730f3c7781a4b6a7e8df92debcc628e","abstract_canon_sha256":"eb8d55f71dcbffceecca9e1b27b1f54e1e017431b585bd0c097fc862a17fb86c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:12:43.150509Z","signature_b64":"elQ4ROh0A2CTxiiyEqlDR0D4KMyYohs3Mm9fumRAAMkZLZTsfkSlJYX14KppIffv+tJtwMHFxuG7wgPRwNk9Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"347d31df52bb1be57a1013fbe13e79abf5cb5a5e3509e1c4955e7c561cb3c318","last_reissued_at":"2026-05-18T01:12:43.150019Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:12:43.150019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Resource Constrained Structured Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Joseph Wang, Kai-Wei Chang, Tolga Bolukbasi, Venkatesh Saligrama","submitted_at":"2016-02-28T19:44:57Z","abstract_excerpt":"We study the problem of structured prediction under test-time budget constraints. We propose a novel approach applicable to a wide range of structured prediction problems in computer vision and natural language processing. Our approach seeks to adaptively generate computationally costly features during test-time in order to reduce the computational cost of prediction while maintaining prediction performance. We show that training the adaptive feature generation system can be reduced to a series of structured learning problems, resulting in efficient training using existing structured learning "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08761","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":"1602.08761","created_at":"2026-05-18T01:12:43.150095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.08761v2","created_at":"2026-05-18T01:12:43.150095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08761","created_at":"2026-05-18T01:12:43.150095+00:00"},{"alias_kind":"pith_short_12","alias_value":"GR6TDX2SXMN6","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GR6TDX2SXMN6K6QQ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GR6TDX2S","created_at":"2026-05-18T12:30:19.053100+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/GR6TDX2SXMN6K6QQCP56CPTZVP","json":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP.json","graph_json":"https://pith.science/api/pith-number/GR6TDX2SXMN6K6QQCP56CPTZVP/graph.json","events_json":"https://pith.science/api/pith-number/GR6TDX2SXMN6K6QQCP56CPTZVP/events.json","paper":"https://pith.science/paper/GR6TDX2S"},"agent_actions":{"view_html":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP","download_json":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP.json","view_paper":"https://pith.science/paper/GR6TDX2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.08761&json=true","fetch_graph":"https://pith.science/api/pith-number/GR6TDX2SXMN6K6QQCP56CPTZVP/graph.json","fetch_events":"https://pith.science/api/pith-number/GR6TDX2SXMN6K6QQCP56CPTZVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/action/storage_attestation","attest_author":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/action/author_attestation","sign_citation":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/action/citation_signature","submit_replication":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/action/replication_record"}},"created_at":"2026-05-18T01:12:43.150095+00:00","updated_at":"2026-05-18T01:12:43.150095+00:00"}