{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KLPHBNHI6ESQAWJLEGU2HW2DZZ","short_pith_number":"pith:KLPHBNHI","schema_version":"1.0","canonical_sha256":"52de70b4e8f12500592b21a9a3db43ce7546d6a10b5294309e7da168d0831058","source":{"kind":"arxiv","id":"1604.05448","version":1},"attestation_state":"computed","paper":{"title":"Online Row Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Jakub Pachocki, Michael B. Cohen","submitted_at":"2016-04-19T07:08:56Z","abstract_excerpt":"Finding a small spectral approximation for a tall $n \\times d$ matrix $A$ is a fundamental numerical primitive. For a number of reasons, one often seeks an approximation whose rows are sampled from those of $A$. Row sampling improves interpretability, saves space when $A$ is sparse, and preserves row structure, which is especially important, for example, when $A$ represents a graph.\n  However, correctly sampling rows from $A$ can be costly when the matrix is large and cannot be stored and processed in memory. Hence, a number of recent publications focus on row sampling in the streaming setting"},"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":"1604.05448","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-19T07:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"d365015ffd71c00442d4284ecd122852526ab708fe92098f88b34530f23b6231","abstract_canon_sha256":"382822e18dbb16b52782a1074c5fb2a69e533354f52a11d7197eef9ba54b0d08"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:53.919974Z","signature_b64":"mwUO4apwjZSUCPp2A6opC2xTP2rjQLfgH0xqIjzkoT6jQpcR5iwDTQup52SoszvHnLwmPnUWcxYVBg0siNgpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52de70b4e8f12500592b21a9a3db43ce7546d6a10b5294309e7da168d0831058","last_reissued_at":"2026-05-18T01:16:53.919422Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:53.919422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Row Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Cameron Musco, Jakub Pachocki, Michael B. Cohen","submitted_at":"2016-04-19T07:08:56Z","abstract_excerpt":"Finding a small spectral approximation for a tall $n \\times d$ matrix $A$ is a fundamental numerical primitive. For a number of reasons, one often seeks an approximation whose rows are sampled from those of $A$. Row sampling improves interpretability, saves space when $A$ is sparse, and preserves row structure, which is especially important, for example, when $A$ represents a graph.\n  However, correctly sampling rows from $A$ can be costly when the matrix is large and cannot be stored and processed in memory. Hence, a number of recent publications focus on row sampling in the streaming setting"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.05448","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.05448","created_at":"2026-05-18T01:16:53.919525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.05448v1","created_at":"2026-05-18T01:16:53.919525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.05448","created_at":"2026-05-18T01:16:53.919525+00:00"},{"alias_kind":"pith_short_12","alias_value":"KLPHBNHI6ESQ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KLPHBNHI6ESQAWJL","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KLPHBNHI","created_at":"2026-05-18T12:30:25.849896+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/KLPHBNHI6ESQAWJLEGU2HW2DZZ","json":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ.json","graph_json":"https://pith.science/api/pith-number/KLPHBNHI6ESQAWJLEGU2HW2DZZ/graph.json","events_json":"https://pith.science/api/pith-number/KLPHBNHI6ESQAWJLEGU2HW2DZZ/events.json","paper":"https://pith.science/paper/KLPHBNHI"},"agent_actions":{"view_html":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ","download_json":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ.json","view_paper":"https://pith.science/paper/KLPHBNHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.05448&json=true","fetch_graph":"https://pith.science/api/pith-number/KLPHBNHI6ESQAWJLEGU2HW2DZZ/graph.json","fetch_events":"https://pith.science/api/pith-number/KLPHBNHI6ESQAWJLEGU2HW2DZZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ/action/storage_attestation","attest_author":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ/action/author_attestation","sign_citation":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ/action/citation_signature","submit_replication":"https://pith.science/pith/KLPHBNHI6ESQAWJLEGU2HW2DZZ/action/replication_record"}},"created_at":"2026-05-18T01:16:53.919525+00:00","updated_at":"2026-05-18T01:16:53.919525+00:00"}