{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:FL6ZE65VELQMIU2S3QDDRNAV4W","short_pith_number":"pith:FL6ZE65V","canonical_record":{"source":{"id":"1303.0934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-05T05:55:59Z","cross_cats_sorted":["cs.AI","cs.MS"],"title_canon_sha256":"f973e946800a56db10c7b7c706d59f7f3021c56cc3bbc55f6ccd68bba631faed","abstract_canon_sha256":"08d8be1ac7bc28ec551d0ce06509df6edfdf97bec024f66894d876398fe788c0"},"schema_version":"1.0"},"canonical_sha256":"2afd927bb522e0c45352dc0638b415e582efa686711c52c02dca27404b34d03c","source":{"kind":"arxiv","id":"1303.0934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0934","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0934v1","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0934","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"pith_short_12","alias_value":"FL6ZE65VELQM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FL6ZE65VELQMIU2S","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FL6ZE65V","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:FL6ZE65VELQMIU2S3QDDRNAV4W","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-05T05:55:59Z","cross_cats_sorted":["cs.AI","cs.MS"],"title_canon_sha256":"f973e946800a56db10c7b7c706d59f7f3021c56cc3bbc55f6ccd68bba631faed","abstract_canon_sha256":"08d8be1ac7bc28ec551d0ce06509df6edfdf97bec024f66894d876398fe788c0"},"schema_version":"1.0"},"canonical_sha256":"2afd927bb522e0c45352dc0638b415e582efa686711c52c02dca27404b34d03c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:53.426110Z","signature_b64":"CdujTD6SQrpzz/zMhLlvQC4djSqaJibN4KrM1769Kk2k8XtyWhZs1Dsl19RSUY3+uh0w3oRTn9+O5V5Kpw1KDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2afd927bb522e0c45352dc0638b415e582efa686711c52c02dca27404b34d03c","last_reissued_at":"2026-05-18T03:31:53.425672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:53.425672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0934","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:31:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2yiJXufOYMCslU6zannNBM5YdlJrAaey58bTb52ZpVKZqAdwXLINbGFK/aLJ1M/Clpbju2hQBLr/39SNTAHSAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:18:53.560572Z"},"content_sha256":"8b4a92fa5a6f0addcade059482e4a2e47682af03428d4efd0e0c832719c5ec65","schema_version":"1.0","event_id":"sha256:8b4a92fa5a6f0addcade059482e4a2e47682af03428d4efd0e0c832719c5ec65"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:FL6ZE65VELQMIU2S3QDDRNAV4W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GURLS: a Least Squares Library for Supervised Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.MS"],"primary_cat":"cs.LG","authors_text":"Andrea Tacchetti, Lorenzo Rosasco, Matteo Santoro, Pavan K Mallapragada","submitted_at":"2013-03-05T05:55:59Z","abstract_excerpt":"We present GURLS, a least squares, modular, easy-to-extend software library for efficient supervised learning. GURLS is targeted to machine learning practitioners, as well as non-specialists. It offers a number state-of-the-art training strategies for medium and large-scale learning, and routines for efficient model selection. The library is particularly well suited for multi-output problems (multi-category/multi-label). GURLS is currently available in two independent implementations: Matlab and C++. It takes advantage of the favorable properties of regularized least squares algorithm to explo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0934","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:31:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7AV57ob1JFjorbwz7TrTEiKEi6i8N5PflK1SsQvLTUHBfFgcwEfRp9M2bKe000ACFQHIhpKRtGEI5W8uah2XBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:18:53.561267Z"},"content_sha256":"94179c56d017725c87ed313c383a9055dd0470ac6292da7bf388f3d0fb21b0ab","schema_version":"1.0","event_id":"sha256:94179c56d017725c87ed313c383a9055dd0470ac6292da7bf388f3d0fb21b0ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FL6ZE65VELQMIU2S3QDDRNAV4W/bundle.json","state_url":"https://pith.science/pith/FL6ZE65VELQMIU2S3QDDRNAV4W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FL6ZE65VELQMIU2S3QDDRNAV4W/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-26T06:18:53Z","links":{"resolver":"https://pith.science/pith/FL6ZE65VELQMIU2S3QDDRNAV4W","bundle":"https://pith.science/pith/FL6ZE65VELQMIU2S3QDDRNAV4W/bundle.json","state":"https://pith.science/pith/FL6ZE65VELQMIU2S3QDDRNAV4W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FL6ZE65VELQMIU2S3QDDRNAV4W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:FL6ZE65VELQMIU2S3QDDRNAV4W","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":"08d8be1ac7bc28ec551d0ce06509df6edfdf97bec024f66894d876398fe788c0","cross_cats_sorted":["cs.AI","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-05T05:55:59Z","title_canon_sha256":"f973e946800a56db10c7b7c706d59f7f3021c56cc3bbc55f6ccd68bba631faed"},"schema_version":"1.0","source":{"id":"1303.0934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0934","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0934v1","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0934","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"pith_short_12","alias_value":"FL6ZE65VELQM","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"FL6ZE65VELQMIU2S","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"FL6ZE65V","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:94179c56d017725c87ed313c383a9055dd0470ac6292da7bf388f3d0fb21b0ab","target":"graph","created_at":"2026-05-18T03:31:53Z","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 GURLS, a least squares, modular, easy-to-extend software library for efficient supervised learning. GURLS is targeted to machine learning practitioners, as well as non-specialists. It offers a number state-of-the-art training strategies for medium and large-scale learning, and routines for efficient model selection. The library is particularly well suited for multi-output problems (multi-category/multi-label). GURLS is currently available in two independent implementations: Matlab and C++. It takes advantage of the favorable properties of regularized least squares algorithm to explo","authors_text":"Andrea Tacchetti, Lorenzo Rosasco, Matteo Santoro, Pavan K Mallapragada","cross_cats":["cs.AI","cs.MS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-05T05:55:59Z","title":"GURLS: a Least Squares Library for Supervised Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0934","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:8b4a92fa5a6f0addcade059482e4a2e47682af03428d4efd0e0c832719c5ec65","target":"record","created_at":"2026-05-18T03:31:53Z","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":"08d8be1ac7bc28ec551d0ce06509df6edfdf97bec024f66894d876398fe788c0","cross_cats_sorted":["cs.AI","cs.MS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-03-05T05:55:59Z","title_canon_sha256":"f973e946800a56db10c7b7c706d59f7f3021c56cc3bbc55f6ccd68bba631faed"},"schema_version":"1.0","source":{"id":"1303.0934","kind":"arxiv","version":1}},"canonical_sha256":"2afd927bb522e0c45352dc0638b415e582efa686711c52c02dca27404b34d03c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2afd927bb522e0c45352dc0638b415e582efa686711c52c02dca27404b34d03c","first_computed_at":"2026-05-18T03:31:53.425672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:53.425672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CdujTD6SQrpzz/zMhLlvQC4djSqaJibN4KrM1769Kk2k8XtyWhZs1Dsl19RSUY3+uh0w3oRTn9+O5V5Kpw1KDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:53.426110Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b4a92fa5a6f0addcade059482e4a2e47682af03428d4efd0e0c832719c5ec65","sha256:94179c56d017725c87ed313c383a9055dd0470ac6292da7bf388f3d0fb21b0ab"],"state_sha256":"3cfdc464052de26521f3b83c475e34e8a324b9413c0ce67a83486d7050dc4706"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0vC15Ed1XmMofHzKZA2yLtsIQgsDbDK3w92jJDR9NPBShK29gG0bAChiBMKIPf0cRSf5GzXWCqe/smnUMyR/BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:18:53.564427Z","bundle_sha256":"62f57b48ed24c8891b5b80a266f01ef5075f8d144d0ecce3503d9a0b93e54b30"}}