{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OAZMBGEGSDJ53FUY2RYE4YGMHZ","short_pith_number":"pith:OAZMBGEG","canonical_record":{"source":{"id":"1209.4508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T12:27:15Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"870120f83221e4bfb4658e57063d3d8b6b130b10c0abc2878eea7e7a8a9f464e","abstract_canon_sha256":"e81646930ba2785525a5bba7c74ab9cd3ce334483dba75cb642c94a6c36b9c38"},"schema_version":"1.0"},"canonical_sha256":"7032c0988690d3dd9698d4704e60cc3e7b6a47ddfecc8e0479cdaeff6c85ba42","source":{"kind":"arxiv","id":"1209.4508","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4508","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4508v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4508","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"OAZMBGEGSDJ5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OAZMBGEGSDJ53FUY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OAZMBGEG","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OAZMBGEGSDJ53FUY2RYE4YGMHZ","target":"record","payload":{"canonical_record":{"source":{"id":"1209.4508","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T12:27:15Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"870120f83221e4bfb4658e57063d3d8b6b130b10c0abc2878eea7e7a8a9f464e","abstract_canon_sha256":"e81646930ba2785525a5bba7c74ab9cd3ce334483dba75cb642c94a6c36b9c38"},"schema_version":"1.0"},"canonical_sha256":"7032c0988690d3dd9698d4704e60cc3e7b6a47ddfecc8e0479cdaeff6c85ba42","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:11.493425Z","signature_b64":"0S+JLZf6OAeDWz+1Lb5/lKfS/zFBIwe20OkoDCFGz3KEolwKDR2ZMpiuWJJfrmgHl1WpaKZTW8D9xZnDv+T8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7032c0988690d3dd9698d4704e60cc3e7b6a47ddfecc8e0479cdaeff6c85ba42","last_reissued_at":"2026-05-18T03:45:11.492954Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:11.492954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.4508","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:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqDw2cJ31d0fvq0nS6OB7+x1Ly9cWYOl9eJyhF2dfSSr8k1cqdPhivz06d7A5FdNsH1YVpCPOU6zOwGZ50sECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:30:13.329242Z"},"content_sha256":"8a77aa433276ad8f59917e05b7091d06c9d8a1260ddbe400e085453535516334","schema_version":"1.0","event_id":"sha256:8a77aa433276ad8f59917e05b7091d06c9d8a1260ddbe400e085453535516334"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OAZMBGEGSDJ53FUY2RYE4YGMHZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic algorithms for skewed matrix products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"cs.DS","authors_text":"Konstantin Kutzkov","submitted_at":"2012-09-20T12:27:15Z","abstract_excerpt":"Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\\em deterministic} matrix multiplication algorithms.\n  Motivated by applications in data mining, we first consider the case of real-valued, nonnegative $n$-by-$n$ input matrices $A$ and $B$, and show how to obtain a deterministic approximation of the weights of individual entries, as well as the entrywise $p$-norm, of the product $AB$. The algorithm is simple, spa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4508","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:45:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lCF7dkGabJddkl+Mf4WWb1Ke6EuhYdXOvJLgrXqmRk3kJaAcfummC7x0qESr1Ek3MkvK4PI2R94jV1+mX145DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T06:30:13.329614Z"},"content_sha256":"0389aff27112d5bbaae4b030c9a05139a282b2a57bf0cb8cf094172f3c06995d","schema_version":"1.0","event_id":"sha256:0389aff27112d5bbaae4b030c9a05139a282b2a57bf0cb8cf094172f3c06995d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAZMBGEGSDJ53FUY2RYE4YGMHZ/bundle.json","state_url":"https://pith.science/pith/OAZMBGEGSDJ53FUY2RYE4YGMHZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAZMBGEGSDJ53FUY2RYE4YGMHZ/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-20T06:30:13Z","links":{"resolver":"https://pith.science/pith/OAZMBGEGSDJ53FUY2RYE4YGMHZ","bundle":"https://pith.science/pith/OAZMBGEGSDJ53FUY2RYE4YGMHZ/bundle.json","state":"https://pith.science/pith/OAZMBGEGSDJ53FUY2RYE4YGMHZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAZMBGEGSDJ53FUY2RYE4YGMHZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OAZMBGEGSDJ53FUY2RYE4YGMHZ","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":"e81646930ba2785525a5bba7c74ab9cd3ce334483dba75cb642c94a6c36b9c38","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T12:27:15Z","title_canon_sha256":"870120f83221e4bfb4658e57063d3d8b6b130b10c0abc2878eea7e7a8a9f464e"},"schema_version":"1.0","source":{"id":"1209.4508","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.4508","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"arxiv_version","alias_value":"1209.4508v1","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.4508","created_at":"2026-05-18T03:45:11Z"},{"alias_kind":"pith_short_12","alias_value":"OAZMBGEGSDJ5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OAZMBGEGSDJ53FUY","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OAZMBGEG","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:0389aff27112d5bbaae4b030c9a05139a282b2a57bf0cb8cf094172f3c06995d","target":"graph","created_at":"2026-05-18T03:45:11Z","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":"Recently, Pagh presented a randomized approximation algorithm for the multiplication of real-valued matrices building upon work for detecting the most frequent items in data streams. We continue this line of research and present new {\\em deterministic} matrix multiplication algorithms.\n  Motivated by applications in data mining, we first consider the case of real-valued, nonnegative $n$-by-$n$ input matrices $A$ and $B$, and show how to obtain a deterministic approximation of the weights of individual entries, as well as the entrywise $p$-norm, of the product $AB$. The algorithm is simple, spa","authors_text":"Konstantin Kutzkov","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T12:27:15Z","title":"Deterministic algorithms for skewed matrix products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.4508","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:8a77aa433276ad8f59917e05b7091d06c9d8a1260ddbe400e085453535516334","target":"record","created_at":"2026-05-18T03:45:11Z","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":"e81646930ba2785525a5bba7c74ab9cd3ce334483dba75cb642c94a6c36b9c38","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-09-20T12:27:15Z","title_canon_sha256":"870120f83221e4bfb4658e57063d3d8b6b130b10c0abc2878eea7e7a8a9f464e"},"schema_version":"1.0","source":{"id":"1209.4508","kind":"arxiv","version":1}},"canonical_sha256":"7032c0988690d3dd9698d4704e60cc3e7b6a47ddfecc8e0479cdaeff6c85ba42","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7032c0988690d3dd9698d4704e60cc3e7b6a47ddfecc8e0479cdaeff6c85ba42","first_computed_at":"2026-05-18T03:45:11.492954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:45:11.492954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0S+JLZf6OAeDWz+1Lb5/lKfS/zFBIwe20OkoDCFGz3KEolwKDR2ZMpiuWJJfrmgHl1WpaKZTW8D9xZnDv+T8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:45:11.493425Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.4508","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a77aa433276ad8f59917e05b7091d06c9d8a1260ddbe400e085453535516334","sha256:0389aff27112d5bbaae4b030c9a05139a282b2a57bf0cb8cf094172f3c06995d"],"state_sha256":"5582b1598d73588a9e0ef38dbcbc549601425763234bef7631002edc5e04d85a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ej5U/oVhAMLf5OW5QwckKuASiP9dBmjPS+i2cMcr4LOrX8kDwBfEJik3maLfYESAGo3ZaXhrY9o4v95s//GUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T06:30:13.331475Z","bundle_sha256":"5e378dfb051c1f837efe8f6ebd6fd0d3836573b21ed1789eee7e362d81353edb"}}