{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XX5W4IFWWHRPTTFB33ZONUKCR7","short_pith_number":"pith:XX5W4IFW","schema_version":"1.0","canonical_sha256":"bdfb6e20b6b1e2f9cca1def2e6d1428fe0a1dda23227ba58d64354ba6bd1ce1f","source":{"kind":"arxiv","id":"1508.00858","version":9},"attestation_state":"computed","paper":{"title":"Efficient numerical algorithms for regularized regression problem with applications to traffic matrix estimations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Gornov, Andrey Golov, Anton Anikin, Mikhail Mendel, Pavel Dvurechensky, Vladimir Spokoiny, Yury Maximov","submitted_at":"2015-08-04T18:27:50Z","abstract_excerpt":"In this work we collect and compare to each other many different numerical methods for regularized regression problem and for the problem of projection on a hyperplane. Such problems arise, for example, as a subproblem of demand matrix estimation in IP- networks. In this special case matrix of affine constraints has special structure: all elements are 0 or 1 and this matrix is sparse enough. We have to deal with huge-scale convex optimization problem of special type. Using the properties of the problem we try \"to look inside the black-box\" and to see how the best modern methods work being appl"},"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":"1508.00858","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T18:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"67fbfd7ee0a748131680cfbec57be67295a8f148e8469026bec0f37843eaccd5","abstract_canon_sha256":"ba0d2487765d2fcca07dda3cfcd0c8317a216cda846d3bafaaa25fd90ee1f283"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:00.503570Z","signature_b64":"X4sXHjdscDcQpTRl/siXgC1vB9HRzHPK/a99Ty6GsNs4lZTSbzLWg9Kwbs51sGYESlPaXfpNaFOedh08ke9GCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdfb6e20b6b1e2f9cca1def2e6d1428fe0a1dda23227ba58d64354ba6bd1ce1f","last_reissued_at":"2026-05-18T01:17:00.502737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:00.502737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient numerical algorithms for regularized regression problem with applications to traffic matrix estimations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander Gasnikov, Alexander Gornov, Andrey Golov, Anton Anikin, Mikhail Mendel, Pavel Dvurechensky, Vladimir Spokoiny, Yury Maximov","submitted_at":"2015-08-04T18:27:50Z","abstract_excerpt":"In this work we collect and compare to each other many different numerical methods for regularized regression problem and for the problem of projection on a hyperplane. Such problems arise, for example, as a subproblem of demand matrix estimation in IP- networks. In this special case matrix of affine constraints has special structure: all elements are 0 or 1 and this matrix is sparse enough. We have to deal with huge-scale convex optimization problem of special type. Using the properties of the problem we try \"to look inside the black-box\" and to see how the best modern methods work being appl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00858","kind":"arxiv","version":9},"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":"1508.00858","created_at":"2026-05-18T01:17:00.502871+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.00858v9","created_at":"2026-05-18T01:17:00.502871+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00858","created_at":"2026-05-18T01:17:00.502871+00:00"},{"alias_kind":"pith_short_12","alias_value":"XX5W4IFWWHRP","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XX5W4IFWWHRPTTFB","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XX5W4IFW","created_at":"2026-05-18T12:29:50.041715+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/XX5W4IFWWHRPTTFB33ZONUKCR7","json":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7.json","graph_json":"https://pith.science/api/pith-number/XX5W4IFWWHRPTTFB33ZONUKCR7/graph.json","events_json":"https://pith.science/api/pith-number/XX5W4IFWWHRPTTFB33ZONUKCR7/events.json","paper":"https://pith.science/paper/XX5W4IFW"},"agent_actions":{"view_html":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7","download_json":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7.json","view_paper":"https://pith.science/paper/XX5W4IFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.00858&json=true","fetch_graph":"https://pith.science/api/pith-number/XX5W4IFWWHRPTTFB33ZONUKCR7/graph.json","fetch_events":"https://pith.science/api/pith-number/XX5W4IFWWHRPTTFB33ZONUKCR7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/action/storage_attestation","attest_author":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/action/author_attestation","sign_citation":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/action/citation_signature","submit_replication":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/action/replication_record"}},"created_at":"2026-05-18T01:17:00.502871+00:00","updated_at":"2026-05-18T01:17:00.502871+00:00"}