{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:RVVANNIOKDVNKDYEX2RTWNWEGR","short_pith_number":"pith:RVVANNIO","canonical_record":{"source":{"id":"2010.09791","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-19T19:06:06Z","cross_cats_sorted":["cs.NA","math.NA","math.PR"],"title_canon_sha256":"7a263095c829663452248e03a6ad6fcadd6331582864530940d3a9ade532e02b","abstract_canon_sha256":"3073fb93d584be53c8352f7f12478bf592006ca7a8a4c7a33d12745c8f928ccd"},"schema_version":"1.0"},"canonical_sha256":"8d6a06b50e50ead50f04bea33b36c43471f195239e4efcc3e49d8ff444001bbe","source":{"kind":"arxiv","id":"2010.09791","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09791","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09791v3","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09791","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"RVVANNIOKDVN","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_16","alias_value":"RVVANNIOKDVNKDYE","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_8","alias_value":"RVVANNIO","created_at":"2026-07-05T03:11:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:RVVANNIOKDVNKDYEX2RTWNWEGR","target":"record","payload":{"canonical_record":{"source":{"id":"2010.09791","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-19T19:06:06Z","cross_cats_sorted":["cs.NA","math.NA","math.PR"],"title_canon_sha256":"7a263095c829663452248e03a6ad6fcadd6331582864530940d3a9ade532e02b","abstract_canon_sha256":"3073fb93d584be53c8352f7f12478bf592006ca7a8a4c7a33d12745c8f928ccd"},"schema_version":"1.0"},"canonical_sha256":"8d6a06b50e50ead50f04bea33b36c43471f195239e4efcc3e49d8ff444001bbe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:11:26.341153Z","signature_b64":"KVoEQiRpwSTP43FiWqM7tBqlCiQVAoVECB5TTdk9Aj3ebKg+i+keoitdzAGNVhqWisI4l3LjsAL2FcTmWkMPBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8d6a06b50e50ead50f04bea33b36c43471f195239e4efcc3e49d8ff444001bbe","last_reissued_at":"2026-07-05T03:11:26.340669Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:11:26.340669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2010.09791","source_version":3,"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-07-05T03:11:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HtL7ODCQ3FiBn4p+wO+g+EvtctADKx/Tdy1PNMSIU9GIGNDs/h4Hlh/WbZqMrIl1pH8/z7JWamhkqh908msDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T13:01:54.264335Z"},"content_sha256":"f5543cea1b1b981ea9f478c96e7822a2d9576323c100b747ba86807e9cbe2c35","schema_version":"1.0","event_id":"sha256:f5543cea1b1b981ea9f478c96e7822a2d9576323c100b747ba86807e9cbe2c35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:RVVANNIOKDVNKDYEX2RTWNWEGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tensor-structured sketching for constrained least squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.PR"],"primary_cat":"math.OC","authors_text":"Ke Chen, Ruhui Jin","submitted_at":"2020-10-19T19:06:06Z","abstract_excerpt":"Constrained least squares problems arise in many applications. Their memory and computation costs are expensive in practice involving high-dimensional input data. We employ the so-called \"sketching\" strategy to project the least squares problem onto a space of a much lower \"sketching dimension\" via a random sketching matrix. The key idea of sketching is to reduce the dimension of the problem as much as possible while maintaining the approximation accuracy.\n  Tensor structure is often present in the data matrices of least squares, including linearized inverse problems and tensor decompositions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09791","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.09791/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:11:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V8Ose4PLRP/YBJZuQn9EEM3I51taKW3AOXLR8RyjiD0ru5a9DGcoUKzG7Ch8aafQwKCjOJryPdgfQgRVuD8sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-10T13:01:54.264717Z"},"content_sha256":"9bbe2f0bb6b7188fd8121ffa73ef464138498306d58f5561ac83aa8e92dfbd7a","schema_version":"1.0","event_id":"sha256:9bbe2f0bb6b7188fd8121ffa73ef464138498306d58f5561ac83aa8e92dfbd7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RVVANNIOKDVNKDYEX2RTWNWEGR/bundle.json","state_url":"https://pith.science/pith/RVVANNIOKDVNKDYEX2RTWNWEGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RVVANNIOKDVNKDYEX2RTWNWEGR/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-07-10T13:01:54Z","links":{"resolver":"https://pith.science/pith/RVVANNIOKDVNKDYEX2RTWNWEGR","bundle":"https://pith.science/pith/RVVANNIOKDVNKDYEX2RTWNWEGR/bundle.json","state":"https://pith.science/pith/RVVANNIOKDVNKDYEX2RTWNWEGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RVVANNIOKDVNKDYEX2RTWNWEGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:RVVANNIOKDVNKDYEX2RTWNWEGR","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":"3073fb93d584be53c8352f7f12478bf592006ca7a8a4c7a33d12745c8f928ccd","cross_cats_sorted":["cs.NA","math.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-19T19:06:06Z","title_canon_sha256":"7a263095c829663452248e03a6ad6fcadd6331582864530940d3a9ade532e02b"},"schema_version":"1.0","source":{"id":"2010.09791","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2010.09791","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"arxiv_version","alias_value":"2010.09791v3","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.09791","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_12","alias_value":"RVVANNIOKDVN","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_16","alias_value":"RVVANNIOKDVNKDYE","created_at":"2026-07-05T03:11:26Z"},{"alias_kind":"pith_short_8","alias_value":"RVVANNIO","created_at":"2026-07-05T03:11:26Z"}],"graph_snapshots":[{"event_id":"sha256:9bbe2f0bb6b7188fd8121ffa73ef464138498306d58f5561ac83aa8e92dfbd7a","target":"graph","created_at":"2026-07-05T03:11:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2010.09791/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constrained least squares problems arise in many applications. Their memory and computation costs are expensive in practice involving high-dimensional input data. We employ the so-called \"sketching\" strategy to project the least squares problem onto a space of a much lower \"sketching dimension\" via a random sketching matrix. The key idea of sketching is to reduce the dimension of the problem as much as possible while maintaining the approximation accuracy.\n  Tensor structure is often present in the data matrices of least squares, including linearized inverse problems and tensor decompositions.","authors_text":"Ke Chen, Ruhui Jin","cross_cats":["cs.NA","math.NA","math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-19T19:06:06Z","title":"Tensor-structured sketching for constrained least squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.09791","kind":"arxiv","version":3},"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:f5543cea1b1b981ea9f478c96e7822a2d9576323c100b747ba86807e9cbe2c35","target":"record","created_at":"2026-07-05T03:11:26Z","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":"3073fb93d584be53c8352f7f12478bf592006ca7a8a4c7a33d12745c8f928ccd","cross_cats_sorted":["cs.NA","math.NA","math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-19T19:06:06Z","title_canon_sha256":"7a263095c829663452248e03a6ad6fcadd6331582864530940d3a9ade532e02b"},"schema_version":"1.0","source":{"id":"2010.09791","kind":"arxiv","version":3}},"canonical_sha256":"8d6a06b50e50ead50f04bea33b36c43471f195239e4efcc3e49d8ff444001bbe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d6a06b50e50ead50f04bea33b36c43471f195239e4efcc3e49d8ff444001bbe","first_computed_at":"2026-07-05T03:11:26.340669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:11:26.340669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KVoEQiRpwSTP43FiWqM7tBqlCiQVAoVECB5TTdk9Aj3ebKg+i+keoitdzAGNVhqWisI4l3LjsAL2FcTmWkMPBA==","signature_status":"signed_v1","signed_at":"2026-07-05T03:11:26.341153Z","signed_message":"canonical_sha256_bytes"},"source_id":"2010.09791","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5543cea1b1b981ea9f478c96e7822a2d9576323c100b747ba86807e9cbe2c35","sha256:9bbe2f0bb6b7188fd8121ffa73ef464138498306d58f5561ac83aa8e92dfbd7a"],"state_sha256":"9ea9dc44aae754801ccdb677cf924904896ea0ff8a7714c79c23475edb8e6cd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTUMjTOc5BcJNTIygKN7Y/TmcsJFXVqancAY70nLbpYaTP16gSBQUzgtyaavxFxxmpG7JAMRTT7LVJRHJKDODQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-10T13:01:54.273407Z","bundle_sha256":"dc3623cfb15d656920a541aa7e216ca4eefc92cb505150f3fcb3f3543ae5bffd"}}