{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XX5W4IFWWHRPTTFB33ZONUKCR7","short_pith_number":"pith:XX5W4IFW","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"},"canonical_sha256":"bdfb6e20b6b1e2f9cca1def2e6d1428fe0a1dda23227ba58d64354ba6bd1ce1f","source":{"kind":"arxiv","id":"1508.00858","version":9},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00858","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00858v9","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00858","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"XX5W4IFWWHRP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XX5W4IFWWHRPTTFB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XX5W4IFW","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XX5W4IFWWHRPTTFB33ZONUKCR7","target":"record","payload":{"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"},"canonical_sha256":"bdfb6e20b6b1e2f9cca1def2e6d1428fe0a1dda23227ba58d64354ba6bd1ce1f","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"},"source_kind":"arxiv","source_id":"1508.00858","source_version":9,"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-18T01:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RIbhLLmlw5u7DrHp9hQ0Nqy4+BX6IDCDPGQh+C5BPcZvU+J4JjTEXjlNUe0EjT3np1ioCLYqShjtFZzXAREAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:52:49.763205Z"},"content_sha256":"acc948774b8845aec4489dabaf02910696ab7e8365df973201f9147c0bdfe401","schema_version":"1.0","event_id":"sha256:acc948774b8845aec4489dabaf02910696ab7e8365df973201f9147c0bdfe401"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XX5W4IFWWHRPTTFB33ZONUKCR7","target":"graph","payload":{"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"},"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-18T01:17:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/EWScOGL5K0gpUd/TMwAiyZu6F3RFdKxFDey1uVbXYWhFixnQRAwGJqE1HPNQ85957TgBdfoZotCH/B8L41DDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T06:52:49.763968Z"},"content_sha256":"3b045d81b91c8d5ca1489a6acfe42a2f20da11b62fa5cf65cf7dce8cce5fb9ab","schema_version":"1.0","event_id":"sha256:3b045d81b91c8d5ca1489a6acfe42a2f20da11b62fa5cf65cf7dce8cce5fb9ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/bundle.json","state_url":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/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-10T06:52:49Z","links":{"resolver":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7","bundle":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/bundle.json","state":"https://pith.science/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XX5W4IFWWHRPTTFB33ZONUKCR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XX5W4IFWWHRPTTFB33ZONUKCR7","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":"ba0d2487765d2fcca07dda3cfcd0c8317a216cda846d3bafaaa25fd90ee1f283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T18:27:50Z","title_canon_sha256":"67fbfd7ee0a748131680cfbec57be67295a8f148e8469026bec0f37843eaccd5"},"schema_version":"1.0","source":{"id":"1508.00858","kind":"arxiv","version":9}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.00858","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"arxiv_version","alias_value":"1508.00858v9","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.00858","created_at":"2026-05-18T01:17:00Z"},{"alias_kind":"pith_short_12","alias_value":"XX5W4IFWWHRP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XX5W4IFWWHRPTTFB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XX5W4IFW","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:3b045d81b91c8d5ca1489a6acfe42a2f20da11b62fa5cf65cf7dce8cce5fb9ab","target":"graph","created_at":"2026-05-18T01:17:00Z","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":"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","authors_text":"Alexander Gasnikov, Alexander Gornov, Andrey Golov, Anton Anikin, Mikhail Mendel, Pavel Dvurechensky, Vladimir Spokoiny, Yury Maximov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T18:27:50Z","title":"Efficient numerical algorithms for regularized regression problem with applications to traffic matrix estimations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.00858","kind":"arxiv","version":9},"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:acc948774b8845aec4489dabaf02910696ab7e8365df973201f9147c0bdfe401","target":"record","created_at":"2026-05-18T01:17:00Z","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":"ba0d2487765d2fcca07dda3cfcd0c8317a216cda846d3bafaaa25fd90ee1f283","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-08-04T18:27:50Z","title_canon_sha256":"67fbfd7ee0a748131680cfbec57be67295a8f148e8469026bec0f37843eaccd5"},"schema_version":"1.0","source":{"id":"1508.00858","kind":"arxiv","version":9}},"canonical_sha256":"bdfb6e20b6b1e2f9cca1def2e6d1428fe0a1dda23227ba58d64354ba6bd1ce1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bdfb6e20b6b1e2f9cca1def2e6d1428fe0a1dda23227ba58d64354ba6bd1ce1f","first_computed_at":"2026-05-18T01:17:00.502737Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:00.502737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X4sXHjdscDcQpTRl/siXgC1vB9HRzHPK/a99Ty6GsNs4lZTSbzLWg9Kwbs51sGYESlPaXfpNaFOedh08ke9GCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:00.503570Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.00858","source_kind":"arxiv","source_version":9}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acc948774b8845aec4489dabaf02910696ab7e8365df973201f9147c0bdfe401","sha256:3b045d81b91c8d5ca1489a6acfe42a2f20da11b62fa5cf65cf7dce8cce5fb9ab"],"state_sha256":"e18eeff8c6886e518cad035a5342b65f05adeb332ef0f4d57b5f91017addd5d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EaExhzcXzdfUxaicScZNroNpFDfZBhtwrfyyUWNk8Q1kVT8XPHNvuhzs39ltRJIAkdQ81nZl1ti/xa19BzUKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T06:52:49.768118Z","bundle_sha256":"7047e531f827ad0fc06f8a93fc953ae564f2af4eb43020b9428dc722cf1bb7a8"}}