{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:626BHQBXJ37DSLFQAKNZGLIH5B","short_pith_number":"pith:626BHQBX","canonical_record":{"source":{"id":"1706.02857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-09T07:43:46Z","cross_cats_sorted":["cs.FL","stat.ML"],"title_canon_sha256":"bea8302e831dec02f29fe3e2145e055c08140fd6bb79f164064aca2d6ad6f2e2","abstract_canon_sha256":"676640fb2fb179636827959515268eecee9261f75370567e864cfb9a18871761"},"schema_version":"1.0"},"canonical_sha256":"f6bc13c0374efe392cb0029b932d07e87df780af3a1ec032710504c8dcc290da","source":{"kind":"arxiv","id":"1706.02857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02857","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02857v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02857","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"626BHQBXJ37D","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"626BHQBXJ37DSLFQ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"626BHQBX","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:626BHQBXJ37DSLFQAKNZGLIH5B","target":"record","payload":{"canonical_record":{"source":{"id":"1706.02857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-09T07:43:46Z","cross_cats_sorted":["cs.FL","stat.ML"],"title_canon_sha256":"bea8302e831dec02f29fe3e2145e055c08140fd6bb79f164064aca2d6ad6f2e2","abstract_canon_sha256":"676640fb2fb179636827959515268eecee9261f75370567e864cfb9a18871761"},"schema_version":"1.0"},"canonical_sha256":"f6bc13c0374efe392cb0029b932d07e87df780af3a1ec032710504c8dcc290da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:40.748034Z","signature_b64":"63KeWjoSpathVjSgss59pi1B+9+cjruvxVBUOSA8BGs04YggsJU7CHa8UraZxM82cCp9yEwo+H0dN83kJB9QBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6bc13c0374efe392cb0029b932d07e87df780af3a1ec032710504c8dcc290da","last_reissued_at":"2026-05-18T00:42:40.747450Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:40.747450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.02857","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-18T00:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0YOlj70DZzQ0tLgCuBEdMbVsDaF8s+q9ruMFsxbDIlbQ5PF6ezHMPLGsIfVXzTkry1FwbqS8HOuGd1meZrxKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:32:03.910690Z"},"content_sha256":"8832c11ade88b4d9b96e72b1ea07fd23f10f291d2ed2c26a18371684519e2ad3","schema_version":"1.0","event_id":"sha256:8832c11ade88b4d9b96e72b1ea07fd23f10f291d2ed2c26a18371684519e2ad3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:626BHQBXJ37DSLFQAKNZGLIH5B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Maximum Matching Algorithm for Basis Selection in Spectral Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ariadna Quattoni, Matthias Gall\\'e, Xavier Carreras","submitted_at":"2017-06-09T07:43:46Z","abstract_excerpt":"We present a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a special type of matrix called the Hankel matrix. This matrix is designed to capture the relevant statistics of the training sequences. What is crucial is that to capture long range dependencies we must consider very large Hankel matrices. Thus the computation of the SVD becomes a critical bottleneck. Our s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02857","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-18T00:42:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KK5vw/5i+pMbVlx2QdHL8Lm63pYpi8CH6AUuTdDRlv+d6TxeA1OC0ebC/pVNOELPpurDGowQQ3WKNZxvp2UAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T21:32:03.911043Z"},"content_sha256":"3e5bc7c868497b817e0915293236457530665a5fa797af1f5ff80ea85c6cfb95","schema_version":"1.0","event_id":"sha256:3e5bc7c868497b817e0915293236457530665a5fa797af1f5ff80ea85c6cfb95"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/626BHQBXJ37DSLFQAKNZGLIH5B/bundle.json","state_url":"https://pith.science/pith/626BHQBXJ37DSLFQAKNZGLIH5B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/626BHQBXJ37DSLFQAKNZGLIH5B/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-01T21:32:03Z","links":{"resolver":"https://pith.science/pith/626BHQBXJ37DSLFQAKNZGLIH5B","bundle":"https://pith.science/pith/626BHQBXJ37DSLFQAKNZGLIH5B/bundle.json","state":"https://pith.science/pith/626BHQBXJ37DSLFQAKNZGLIH5B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/626BHQBXJ37DSLFQAKNZGLIH5B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:626BHQBXJ37DSLFQAKNZGLIH5B","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":"676640fb2fb179636827959515268eecee9261f75370567e864cfb9a18871761","cross_cats_sorted":["cs.FL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-09T07:43:46Z","title_canon_sha256":"bea8302e831dec02f29fe3e2145e055c08140fd6bb79f164064aca2d6ad6f2e2"},"schema_version":"1.0","source":{"id":"1706.02857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.02857","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"arxiv_version","alias_value":"1706.02857v1","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.02857","created_at":"2026-05-18T00:42:40Z"},{"alias_kind":"pith_short_12","alias_value":"626BHQBXJ37D","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"626BHQBXJ37DSLFQ","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"626BHQBX","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:3e5bc7c868497b817e0915293236457530665a5fa797af1f5ff80ea85c6cfb95","target":"graph","created_at":"2026-05-18T00:42:40Z","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 a solution to scale spectral algorithms for learning sequence functions. We are interested in the case where these functions are sparse (that is, for most sequences they return 0). Spectral algorithms reduce the learning problem to the task of computing an SVD decomposition over a special type of matrix called the Hankel matrix. This matrix is designed to capture the relevant statistics of the training sequences. What is crucial is that to capture long range dependencies we must consider very large Hankel matrices. Thus the computation of the SVD becomes a critical bottleneck. Our s","authors_text":"Ariadna Quattoni, Matthias Gall\\'e, Xavier Carreras","cross_cats":["cs.FL","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-09T07:43:46Z","title":"A Maximum Matching Algorithm for Basis Selection in Spectral Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.02857","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:8832c11ade88b4d9b96e72b1ea07fd23f10f291d2ed2c26a18371684519e2ad3","target":"record","created_at":"2026-05-18T00:42:40Z","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":"676640fb2fb179636827959515268eecee9261f75370567e864cfb9a18871761","cross_cats_sorted":["cs.FL","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-06-09T07:43:46Z","title_canon_sha256":"bea8302e831dec02f29fe3e2145e055c08140fd6bb79f164064aca2d6ad6f2e2"},"schema_version":"1.0","source":{"id":"1706.02857","kind":"arxiv","version":1}},"canonical_sha256":"f6bc13c0374efe392cb0029b932d07e87df780af3a1ec032710504c8dcc290da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6bc13c0374efe392cb0029b932d07e87df780af3a1ec032710504c8dcc290da","first_computed_at":"2026-05-18T00:42:40.747450Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:40.747450Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"63KeWjoSpathVjSgss59pi1B+9+cjruvxVBUOSA8BGs04YggsJU7CHa8UraZxM82cCp9yEwo+H0dN83kJB9QBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:40.748034Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.02857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8832c11ade88b4d9b96e72b1ea07fd23f10f291d2ed2c26a18371684519e2ad3","sha256:3e5bc7c868497b817e0915293236457530665a5fa797af1f5ff80ea85c6cfb95"],"state_sha256":"aadc35ac2633e6c29371e182e0f3ff39e5ce7e494e097ee55706371ef1f34f74"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qLbtxl39BPoZ1ac497N4Y/rSFPt/hqtF3p0WzR11YfZbHK9hmNpHC7m3X8A5suSQmN5G/jqqJhfaic2N86OGBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T21:32:03.913090Z","bundle_sha256":"83e815f55e411dbe53eef2f48ba16d18277daa99ec26ab8c5635516248f0e50f"}}