{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FZOTHMCL6GZAVFWRDVNNGFJVQI","short_pith_number":"pith:FZOTHMCL","canonical_record":{"source":{"id":"1206.6451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"28a36299e19f3d7e3d2c6dad9ed3c422cb100fa9558316e5d4c06b7c102a4f5a","abstract_canon_sha256":"0d29cffd4300b05869076a184a121b9852b5f9351caa5dd5c7b4da92c8f6ef66"},"schema_version":"1.0"},"canonical_sha256":"2e5d33b04bf1b20a96d11d5ad315358221557c6cbaa0d5626521204133c16965","source":{"kind":"arxiv","id":"1206.6451","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6451","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6451v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6451","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"FZOTHMCL6GZA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FZOTHMCL6GZAVFWR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FZOTHMCL","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FZOTHMCL6GZAVFWRDVNNGFJVQI","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6451","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"28a36299e19f3d7e3d2c6dad9ed3c422cb100fa9558316e5d4c06b7c102a4f5a","abstract_canon_sha256":"0d29cffd4300b05869076a184a121b9852b5f9351caa5dd5c7b4da92c8f6ef66"},"schema_version":"1.0"},"canonical_sha256":"2e5d33b04bf1b20a96d11d5ad315358221557c6cbaa0d5626521204133c16965","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:14.004043Z","signature_b64":"/hU8jwHVa8+fv+iQDXtIfE2HDY4JbEw6T8f90r8Tc9LPNrmITysa31HMLdQRIq2oKYHqaZvG9pEShxM+Vr1BDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e5d33b04bf1b20a96d11d5ad315358221557c6cbaa0d5626521204133c16965","last_reissued_at":"2026-05-18T03:52:14.003422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:14.003422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6451","source_version":1,"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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozsGo93yBOoeN+JRQItMIzNQ4Jqs9LNzs2JVndNaMF/0eQOEK5LaUMzv9R/b6WXhlZLHlQL+rs17F9DW0rMIAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:03:42.699313Z"},"content_sha256":"ee81cd7008e6f913c69ff936c7bc5c67a9efc9909739ba6f4055f604e7d7c5b6","schema_version":"1.0","event_id":"sha256:ee81cd7008e6f913c69ff936c7bc5c67a9efc9909739ba6f4055f604e7d7c5b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FZOTHMCL6GZAVFWRDVNNGFJVQI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Greedy Miser: Learning under Test-time Budgets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Kilian Weinberger (Washington University, Olivier Chapelle (Criteo), St. Louis), Zhixiang Xu (Washington University","submitted_at":"2012-06-27T19:59:59Z","abstract_excerpt":"As machine learning algorithms enter applications in industrial settings, there is increased interest in controlling their cpu-time during testing. The cpu-time consists of the running time of the algorithm and the extraction time of the features. The latter can vary drastically when the feature set is diverse. In this paper, we propose an algorithm, the Greedy Miser, that incorporates the feature extraction cost during training to explicitly minimize the cpu-time during testing. The algorithm is a straightforward extension of stage-wise regression and is equally suitable for regression or mul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6451","kind":"arxiv","version":1},"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-18T03:52:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"asqhL39d51/Q+OMALX1H45c0cEez33nj21NaFiANB094oJ3dZ38o7O323jWfEt2saN5zsZlC0EIfS3N/ND4tAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T21:03:42.699701Z"},"content_sha256":"c55b621145f8203767c586d2c821f1bbe7ace678bc8754c825f23dd9177433c0","schema_version":"1.0","event_id":"sha256:c55b621145f8203767c586d2c821f1bbe7ace678bc8754c825f23dd9177433c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FZOTHMCL6GZAVFWRDVNNGFJVQI/bundle.json","state_url":"https://pith.science/pith/FZOTHMCL6GZAVFWRDVNNGFJVQI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FZOTHMCL6GZAVFWRDVNNGFJVQI/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-05-20T21:03:42Z","links":{"resolver":"https://pith.science/pith/FZOTHMCL6GZAVFWRDVNNGFJVQI","bundle":"https://pith.science/pith/FZOTHMCL6GZAVFWRDVNNGFJVQI/bundle.json","state":"https://pith.science/pith/FZOTHMCL6GZAVFWRDVNNGFJVQI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FZOTHMCL6GZAVFWRDVNNGFJVQI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FZOTHMCL6GZAVFWRDVNNGFJVQI","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":"0d29cffd4300b05869076a184a121b9852b5f9351caa5dd5c7b4da92c8f6ef66","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"28a36299e19f3d7e3d2c6dad9ed3c422cb100fa9558316e5d4c06b7c102a4f5a"},"schema_version":"1.0","source":{"id":"1206.6451","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6451","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6451v1","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6451","created_at":"2026-05-18T03:52:14Z"},{"alias_kind":"pith_short_12","alias_value":"FZOTHMCL6GZA","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FZOTHMCL6GZAVFWR","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FZOTHMCL","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:c55b621145f8203767c586d2c821f1bbe7ace678bc8754c825f23dd9177433c0","target":"graph","created_at":"2026-05-18T03:52:14Z","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":"As machine learning algorithms enter applications in industrial settings, there is increased interest in controlling their cpu-time during testing. The cpu-time consists of the running time of the algorithm and the extraction time of the features. The latter can vary drastically when the feature set is diverse. In this paper, we propose an algorithm, the Greedy Miser, that incorporates the feature extraction cost during training to explicitly minimize the cpu-time during testing. The algorithm is a straightforward extension of stage-wise regression and is equally suitable for regression or mul","authors_text":"Kilian Weinberger (Washington University, Olivier Chapelle (Criteo), St. Louis), Zhixiang Xu (Washington University","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title":"The Greedy Miser: Learning under Test-time Budgets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6451","kind":"arxiv","version":1},"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:ee81cd7008e6f913c69ff936c7bc5c67a9efc9909739ba6f4055f604e7d7c5b6","target":"record","created_at":"2026-05-18T03:52:14Z","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":"0d29cffd4300b05869076a184a121b9852b5f9351caa5dd5c7b4da92c8f6ef66","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-27T19:59:59Z","title_canon_sha256":"28a36299e19f3d7e3d2c6dad9ed3c422cb100fa9558316e5d4c06b7c102a4f5a"},"schema_version":"1.0","source":{"id":"1206.6451","kind":"arxiv","version":1}},"canonical_sha256":"2e5d33b04bf1b20a96d11d5ad315358221557c6cbaa0d5626521204133c16965","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e5d33b04bf1b20a96d11d5ad315358221557c6cbaa0d5626521204133c16965","first_computed_at":"2026-05-18T03:52:14.003422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:14.003422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/hU8jwHVa8+fv+iQDXtIfE2HDY4JbEw6T8f90r8Tc9LPNrmITysa31HMLdQRIq2oKYHqaZvG9pEShxM+Vr1BDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:14.004043Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6451","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee81cd7008e6f913c69ff936c7bc5c67a9efc9909739ba6f4055f604e7d7c5b6","sha256:c55b621145f8203767c586d2c821f1bbe7ace678bc8754c825f23dd9177433c0"],"state_sha256":"d7c3d93380e5786b8d35ff9f30e9b44600e37f0f6518f7e54cb24e3f91556fb0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYnWwsdS991wmX/WjUx2sWQt0L5LXPZLyNSUzKUdjMdtez2EuCr8kZ5TtRFgusTGu9TVKaTY9hlncf7slBfhCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T21:03:42.701702Z","bundle_sha256":"094e2ba2fd600464e5ddb5ca090d80b4dc492fb3fb5309c1958f445ed4e7d794"}}