{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GBECSIZ2OEVCSD7P43WW3JVEZ4","short_pith_number":"pith:GBECSIZ2","canonical_record":{"source":{"id":"1505.06169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-05-22T18:28:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"95b98219ef3c7f8f979fe1c52c3f9557556663fb93a7b2dff051961866334ca6","abstract_canon_sha256":"20f610ebf77085c2ad51e2cf22107ed2f9ce416142637bd7a1e3927e13f676f6"},"schema_version":"1.0"},"canonical_sha256":"304829233a712a290fefe6ed6da6a4cf35746a8ecc1a796847d513bf5fab195a","source":{"kind":"arxiv","id":"1505.06169","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06169","created_at":"2026-05-18T02:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06169v1","created_at":"2026-05-18T02:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06169","created_at":"2026-05-18T02:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"GBECSIZ2OEVC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GBECSIZ2OEVCSD7P","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GBECSIZ2","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GBECSIZ2OEVCSD7P43WW3JVEZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06169","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-05-22T18:28:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"95b98219ef3c7f8f979fe1c52c3f9557556663fb93a7b2dff051961866334ca6","abstract_canon_sha256":"20f610ebf77085c2ad51e2cf22107ed2f9ce416142637bd7a1e3927e13f676f6"},"schema_version":"1.0"},"canonical_sha256":"304829233a712a290fefe6ed6da6a4cf35746a8ecc1a796847d513bf5fab195a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:48.864635Z","signature_b64":"Bl4C6S8G1DhbeRc5F8lTrffa6DBKNaQ1nrXh5lny4nQ5W4rC0Wwy1CRizUpmJjGCAW1ScShgm5HNwCkT+kWJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"304829233a712a290fefe6ed6da6a4cf35746a8ecc1a796847d513bf5fab195a","last_reissued_at":"2026-05-18T02:03:48.863876Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:48.863876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06169","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-18T02:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vHPGwpi3FrX6Akr4QN5n5Side2u7ld41atTp3AUUaY9jYjixuqYRlvSEMJa7VJ71XGmkfkMejZ7m9cIICdJbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:38:36.688002Z"},"content_sha256":"fa5ed720a412acf0695efaa021c9d939067b2267cecd69f97c20f2da27ac01a5","schema_version":"1.0","event_id":"sha256:fa5ed720a412acf0695efaa021c9d939067b2267cecd69f97c20f2da27ac01a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GBECSIZ2OEVCSD7P43WW3JVEZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Dynamic Feature Selection for Fast Sequential Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrew McCallum, Emma Strubell, Kate Silverstein, Luke Vilnis","submitted_at":"2015-05-22T18:28:21Z","abstract_excerpt":"We present paired learning and inference algorithms for significantly reducing computation and increasing speed of the vector dot products in the classifiers that are at the heart of many NLP components. This is accomplished by partitioning the features into a sequence of templates which are ordered such that high confidence can often be reached using only a small fraction of all features. Parameter estimation is arranged to maximize accuracy and early confidence in this sequence. Our approach is simpler and better suited to NLP than other related cascade methods. We present experiments in lef"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06169","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-18T02:03:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M8pA80JPW4fdSht4dTF6cN897QSBDpDppjNrOcbBotB4Q2EWP2NHFIjG2A9DYozOLs+LCSEbt6nc/QMmRYxJBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T11:38:36.688717Z"},"content_sha256":"acc9f5a645b87db03e04eb0000cbf3b38d39f464e35883b80b203f0bac6b8fd1","schema_version":"1.0","event_id":"sha256:acc9f5a645b87db03e04eb0000cbf3b38d39f464e35883b80b203f0bac6b8fd1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GBECSIZ2OEVCSD7P43WW3JVEZ4/bundle.json","state_url":"https://pith.science/pith/GBECSIZ2OEVCSD7P43WW3JVEZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GBECSIZ2OEVCSD7P43WW3JVEZ4/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-27T11:38:36Z","links":{"resolver":"https://pith.science/pith/GBECSIZ2OEVCSD7P43WW3JVEZ4","bundle":"https://pith.science/pith/GBECSIZ2OEVCSD7P43WW3JVEZ4/bundle.json","state":"https://pith.science/pith/GBECSIZ2OEVCSD7P43WW3JVEZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GBECSIZ2OEVCSD7P43WW3JVEZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GBECSIZ2OEVCSD7P43WW3JVEZ4","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":"20f610ebf77085c2ad51e2cf22107ed2f9ce416142637bd7a1e3927e13f676f6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-05-22T18:28:21Z","title_canon_sha256":"95b98219ef3c7f8f979fe1c52c3f9557556663fb93a7b2dff051961866334ca6"},"schema_version":"1.0","source":{"id":"1505.06169","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06169","created_at":"2026-05-18T02:03:48Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06169v1","created_at":"2026-05-18T02:03:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06169","created_at":"2026-05-18T02:03:48Z"},{"alias_kind":"pith_short_12","alias_value":"GBECSIZ2OEVC","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GBECSIZ2OEVCSD7P","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GBECSIZ2","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:acc9f5a645b87db03e04eb0000cbf3b38d39f464e35883b80b203f0bac6b8fd1","target":"graph","created_at":"2026-05-18T02:03:48Z","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 present paired learning and inference algorithms for significantly reducing computation and increasing speed of the vector dot products in the classifiers that are at the heart of many NLP components. This is accomplished by partitioning the features into a sequence of templates which are ordered such that high confidence can often be reached using only a small fraction of all features. Parameter estimation is arranged to maximize accuracy and early confidence in this sequence. Our approach is simpler and better suited to NLP than other related cascade methods. We present experiments in lef","authors_text":"Andrew McCallum, Emma Strubell, Kate Silverstein, Luke Vilnis","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-05-22T18:28:21Z","title":"Learning Dynamic Feature Selection for Fast Sequential Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06169","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:fa5ed720a412acf0695efaa021c9d939067b2267cecd69f97c20f2da27ac01a5","target":"record","created_at":"2026-05-18T02:03:48Z","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":"20f610ebf77085c2ad51e2cf22107ed2f9ce416142637bd7a1e3927e13f676f6","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-05-22T18:28:21Z","title_canon_sha256":"95b98219ef3c7f8f979fe1c52c3f9557556663fb93a7b2dff051961866334ca6"},"schema_version":"1.0","source":{"id":"1505.06169","kind":"arxiv","version":1}},"canonical_sha256":"304829233a712a290fefe6ed6da6a4cf35746a8ecc1a796847d513bf5fab195a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"304829233a712a290fefe6ed6da6a4cf35746a8ecc1a796847d513bf5fab195a","first_computed_at":"2026-05-18T02:03:48.863876Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:48.863876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bl4C6S8G1DhbeRc5F8lTrffa6DBKNaQ1nrXh5lny4nQ5W4rC0Wwy1CRizUpmJjGCAW1ScShgm5HNwCkT+kWJAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:48.864635Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06169","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa5ed720a412acf0695efaa021c9d939067b2267cecd69f97c20f2da27ac01a5","sha256:acc9f5a645b87db03e04eb0000cbf3b38d39f464e35883b80b203f0bac6b8fd1"],"state_sha256":"c16e38974a843bdde48eac0432fdda9d08eabd2e96435dbd3ed5e164e1dbf1c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zejdT2op3z7blcA1heXi6pMMJ2UCsxVAkBu8WEP2leRRNN/ITuRovOQy7kFlEyQo4+UPTYVh5q9TnMqCA+ZXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T11:38:36.692511Z","bundle_sha256":"4d9e0559ce1c088c53e6925bcfe3ac665a79f474d268a6ba214456c5467674b5"}}