{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:GR6TDX2SXMN6K6QQCP56CPTZVP","short_pith_number":"pith:GR6TDX2S","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"},"canonical_sha256":"347d31df52bb1be57a1013fbe13e79abf5cb5a5e3509e1c4955e7c561cb3c318","source":{"kind":"arxiv","id":"1602.08761","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08761","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08761v2","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08761","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"GR6TDX2SXMN6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GR6TDX2SXMN6K6QQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GR6TDX2S","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:GR6TDX2SXMN6K6QQCP56CPTZVP","target":"record","payload":{"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"},"canonical_sha256":"347d31df52bb1be57a1013fbe13e79abf5cb5a5e3509e1c4955e7c561cb3c318","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"},"source_kind":"arxiv","source_id":"1602.08761","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/CTAMm/ELsdXUoG7xA8N8Boyd3ulLCHLT56rX72vnTJ+3bWTioR4GgbdyI4agR7ACQ5WY9YMZ5rLv7ycEtmBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:21:36.753290Z"},"content_sha256":"618d0d24465d0ef0b0a78eb33003ed923e272afd475c24d31b3a616111775e2a","schema_version":"1.0","event_id":"sha256:618d0d24465d0ef0b0a78eb33003ed923e272afd475c24d31b3a616111775e2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:GR6TDX2SXMN6K6QQCP56CPTZVP","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:12:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxHIp9xJNUGcu4XDks1wLq1+AFBvAI+gdxF3/SY6/AyQGSVVM31DtstT22VuLBq/96n6RHNySipltNWgHtMZAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T00:21:36.753657Z"},"content_sha256":"824857e9840dfe59e7d3b26114ff37ce54502a6e8cae4fb26c1824261575f538","schema_version":"1.0","event_id":"sha256:824857e9840dfe59e7d3b26114ff37ce54502a6e8cae4fb26c1824261575f538"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/bundle.json","state_url":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-03T00:21:36Z","links":{"resolver":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP","bundle":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/bundle.json","state":"https://pith.science/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GR6TDX2SXMN6K6QQCP56CPTZVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GR6TDX2SXMN6K6QQCP56CPTZVP","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"eb8d55f71dcbffceecca9e1b27b1f54e1e017431b585bd0c097fc862a17fb86c","cross_cats_sorted":["cs.CL","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-28T19:44:57Z","title_canon_sha256":"751bde28b9cfeea9e873a9f9ac9381aa7730f3c7781a4b6a7e8df92debcc628e"},"schema_version":"1.0","source":{"id":"1602.08761","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.08761","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"arxiv_version","alias_value":"1602.08761v2","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.08761","created_at":"2026-05-18T01:12:43Z"},{"alias_kind":"pith_short_12","alias_value":"GR6TDX2SXMN6","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GR6TDX2SXMN6K6QQ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GR6TDX2S","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:824857e9840dfe59e7d3b26114ff37ce54502a6e8cae4fb26c1824261575f538","target":"graph","created_at":"2026-05-18T01:12:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Joseph Wang, Kai-Wei Chang, Tolga Bolukbasi, Venkatesh Saligrama","cross_cats":["cs.CL","cs.CV","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-28T19:44:57Z","title":"Resource Constrained Structured Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.08761","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:618d0d24465d0ef0b0a78eb33003ed923e272afd475c24d31b3a616111775e2a","target":"record","created_at":"2026-05-18T01:12:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"eb8d55f71dcbffceecca9e1b27b1f54e1e017431b585bd0c097fc862a17fb86c","cross_cats_sorted":["cs.CL","cs.CV","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-28T19:44:57Z","title_canon_sha256":"751bde28b9cfeea9e873a9f9ac9381aa7730f3c7781a4b6a7e8df92debcc628e"},"schema_version":"1.0","source":{"id":"1602.08761","kind":"arxiv","version":2}},"canonical_sha256":"347d31df52bb1be57a1013fbe13e79abf5cb5a5e3509e1c4955e7c561cb3c318","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"347d31df52bb1be57a1013fbe13e79abf5cb5a5e3509e1c4955e7c561cb3c318","first_computed_at":"2026-05-18T01:12:43.150019Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:12:43.150019Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"elQ4ROh0A2CTxiiyEqlDR0D4KMyYohs3Mm9fumRAAMkZLZTsfkSlJYX14KppIffv+tJtwMHFxuG7wgPRwNk9Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:12:43.150509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.08761","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:618d0d24465d0ef0b0a78eb33003ed923e272afd475c24d31b3a616111775e2a","sha256:824857e9840dfe59e7d3b26114ff37ce54502a6e8cae4fb26c1824261575f538"],"state_sha256":"632e9fc9e41ecaec166348c71842508688f483bbfbb5412fe32af9cc9d7f9de6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QEzW4rnuxFWoJIUG2LdP1o2F1qarMKd9S5JD1r7CWQLVl+bqGWu9n/x9Fhx4huoNrT+bCtatlr30nK/QQPFHAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T00:21:36.755580Z","bundle_sha256":"9346d94ae55f0f048e7662cc6895d94571047d61239ca285afbd461a24d70780"}}