{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HAY55XF72G3KP3TPBQAEK33PAP","short_pith_number":"pith:HAY55XF7","schema_version":"1.0","canonical_sha256":"3831dedcbfd1b6a7ee6f0c00456f6f03e7b460074254fb6b3b0cceb94e3c4ddc","source":{"kind":"arxiv","id":"1410.0440","version":1},"attestation_state":"computed","paper":{"title":"Scalable Nonlinear Learning with Adaptive Polynomial Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, Alina Beygelzimer, Daniel Hsu, John Langford, Matus Telgarsky","submitted_at":"2014-10-02T02:28:04Z","abstract_excerpt":"Can we effectively learn a nonlinear representation in time comparable to linear learning? We describe a new algorithm that explicitly and adaptively expands higher-order interaction features over base linear representations. The algorithm is designed for extreme computational efficiency, and an extensive experimental study shows that its computation/prediction tradeoff ability compares very favorably against strong baselines."},"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":"1410.0440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-10-02T02:28:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"68780e29e0e7fd2591a2265f21a68188cdc26ca9adf151c7a252cc4f14b22d98","abstract_canon_sha256":"148204aa611cd6e8035f40fc6cfac4f99a7f7ecd1766d83c59246c559ecec081"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:16.437657Z","signature_b64":"6sF2kQezhsW5hiw4mrAKEb0FsXoYslVlsvCnIPiwHHZdR1wCqJHZn8DUibv3BA+cbDwaEbrMvPYlTVg/MAeeCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3831dedcbfd1b6a7ee6f0c00456f6f03e7b460074254fb6b3b0cceb94e3c4ddc","last_reissued_at":"2026-05-18T02:41:16.437208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:16.437208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Scalable Nonlinear Learning with Adaptive Polynomial Expansions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alekh Agarwal, Alina Beygelzimer, Daniel Hsu, John Langford, Matus Telgarsky","submitted_at":"2014-10-02T02:28:04Z","abstract_excerpt":"Can we effectively learn a nonlinear representation in time comparable to linear learning? We describe a new algorithm that explicitly and adaptively expands higher-order interaction features over base linear representations. The algorithm is designed for extreme computational efficiency, and an extensive experimental study shows that its computation/prediction tradeoff ability compares very favorably against strong baselines."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0440","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.0440","created_at":"2026-05-18T02:41:16.437275+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0440v1","created_at":"2026-05-18T02:41:16.437275+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0440","created_at":"2026-05-18T02:41:16.437275+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAY55XF72G3K","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAY55XF72G3KP3TP","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAY55XF7","created_at":"2026-05-18T12:28:30.664211+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/HAY55XF72G3KP3TPBQAEK33PAP","json":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP.json","graph_json":"https://pith.science/api/pith-number/HAY55XF72G3KP3TPBQAEK33PAP/graph.json","events_json":"https://pith.science/api/pith-number/HAY55XF72G3KP3TPBQAEK33PAP/events.json","paper":"https://pith.science/paper/HAY55XF7"},"agent_actions":{"view_html":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP","download_json":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP.json","view_paper":"https://pith.science/paper/HAY55XF7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0440&json=true","fetch_graph":"https://pith.science/api/pith-number/HAY55XF72G3KP3TPBQAEK33PAP/graph.json","fetch_events":"https://pith.science/api/pith-number/HAY55XF72G3KP3TPBQAEK33PAP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP/action/storage_attestation","attest_author":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP/action/author_attestation","sign_citation":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP/action/citation_signature","submit_replication":"https://pith.science/pith/HAY55XF72G3KP3TPBQAEK33PAP/action/replication_record"}},"created_at":"2026-05-18T02:41:16.437275+00:00","updated_at":"2026-05-18T02:41:16.437275+00:00"}