{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:W5JFKXPMPPBWNQPPCM7T3CDGGI","short_pith_number":"pith:W5JFKXPM","schema_version":"1.0","canonical_sha256":"b752555dec7bc366c1ef133f3d88663221843b053c3384a52869e2293e5370f1","source":{"kind":"arxiv","id":"1610.02725","version":2},"attestation_state":"computed","paper":{"title":"SLANTS: Sequential Adaptive Nonlinear Modeling of Vector Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Edoardo Airoldi, Jie Ding, Qiuyi Han, Vahid Tarokh","submitted_at":"2016-10-09T21:46:16Z","abstract_excerpt":"We propose a method for adaptive nonlinear sequential modeling of vector-time series data. Data is modeled as a nonlinear function of past values corrupted by noise, and the underlying non-linear function is assumed to be approximately expandable in a spline basis. We cast the modeling of data as finding a good fit representation in the linear span of multi-dimensional spline basis, and use a variant of l1-penalty regularization in order to reduce the dimensionality of representation. Using adaptive filtering techniques, we design our online algorithm to automatically tune the underlying param"},"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":"1610.02725","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-10-09T21:46:16Z","cross_cats_sorted":[],"title_canon_sha256":"a9e2a3830442f48d68482e72a758e0e3053be772905e066af922a9b6af07c50d","abstract_canon_sha256":"16f4c0391df4d33f3390e87b49a64433e2411abf5f1b926cd904e4f68e29af38"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:22.636746Z","signature_b64":"kKWu9sjIHpSKk7rUqKwyLyrZb7NQ9NExIZBPCz0OarZJj7mq6ceSrie5t+JTMFaei4BYl+2bMBk9LQlAfMe8DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b752555dec7bc366c1ef133f3d88663221843b053c3384a52869e2293e5370f1","last_reissued_at":"2026-05-18T00:33:22.636116Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:22.636116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SLANTS: Sequential Adaptive Nonlinear Modeling of Vector Time Series","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Edoardo Airoldi, Jie Ding, Qiuyi Han, Vahid Tarokh","submitted_at":"2016-10-09T21:46:16Z","abstract_excerpt":"We propose a method for adaptive nonlinear sequential modeling of vector-time series data. Data is modeled as a nonlinear function of past values corrupted by noise, and the underlying non-linear function is assumed to be approximately expandable in a spline basis. We cast the modeling of data as finding a good fit representation in the linear span of multi-dimensional spline basis, and use a variant of l1-penalty regularization in order to reduce the dimensionality of representation. Using adaptive filtering techniques, we design our online algorithm to automatically tune the underlying param"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02725","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":"1610.02725","created_at":"2026-05-18T00:33:22.636221+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02725v2","created_at":"2026-05-18T00:33:22.636221+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02725","created_at":"2026-05-18T00:33:22.636221+00:00"},{"alias_kind":"pith_short_12","alias_value":"W5JFKXPMPPBW","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"W5JFKXPMPPBWNQPP","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"W5JFKXPM","created_at":"2026-05-18T12:30:48.956258+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/W5JFKXPMPPBWNQPPCM7T3CDGGI","json":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI.json","graph_json":"https://pith.science/api/pith-number/W5JFKXPMPPBWNQPPCM7T3CDGGI/graph.json","events_json":"https://pith.science/api/pith-number/W5JFKXPMPPBWNQPPCM7T3CDGGI/events.json","paper":"https://pith.science/paper/W5JFKXPM"},"agent_actions":{"view_html":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI","download_json":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI.json","view_paper":"https://pith.science/paper/W5JFKXPM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02725&json=true","fetch_graph":"https://pith.science/api/pith-number/W5JFKXPMPPBWNQPPCM7T3CDGGI/graph.json","fetch_events":"https://pith.science/api/pith-number/W5JFKXPMPPBWNQPPCM7T3CDGGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI/action/storage_attestation","attest_author":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI/action/author_attestation","sign_citation":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI/action/citation_signature","submit_replication":"https://pith.science/pith/W5JFKXPMPPBWNQPPCM7T3CDGGI/action/replication_record"}},"created_at":"2026-05-18T00:33:22.636221+00:00","updated_at":"2026-05-18T00:33:22.636221+00:00"}