{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:PAQJ3KJKPMO3ODGD3NH4IE4Y5S","short_pith_number":"pith:PAQJ3KJK","canonical_record":{"source":{"id":"2009.05647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-11T20:21:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"315868a97341c7af674e4893538c55998363c6deba37891824f495a8c1614d6b","abstract_canon_sha256":"bd0ab73251740badc2984e36d7c0fe7541d3ee4ab22efc36b2ded8905ff47361"},"schema_version":"1.0"},"canonical_sha256":"78209da92a7b1db70cc3db4fc41398ecac3b01530faa2c542579d94b4aad8c58","source":{"kind":"arxiv","id":"2009.05647","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.05647","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"2009.05647v2","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05647","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"PAQJ3KJKPMO3","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"pith_short_16","alias_value":"PAQJ3KJKPMO3ODGD","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"pith_short_8","alias_value":"PAQJ3KJK","created_at":"2026-07-05T01:38:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:PAQJ3KJKPMO3ODGD3NH4IE4Y5S","target":"record","payload":{"canonical_record":{"source":{"id":"2009.05647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-11T20:21:42Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"315868a97341c7af674e4893538c55998363c6deba37891824f495a8c1614d6b","abstract_canon_sha256":"bd0ab73251740badc2984e36d7c0fe7541d3ee4ab22efc36b2ded8905ff47361"},"schema_version":"1.0"},"canonical_sha256":"78209da92a7b1db70cc3db4fc41398ecac3b01530faa2c542579d94b4aad8c58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:38:04.045646Z","signature_b64":"5kmssiq0gH2xx/oEskTNw3hNtLo/dwouuz8Jz8qSBFvftyH3QeluQWwnvhX8v1+qBPDwuOTLcIxvgjNvdJ6ZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78209da92a7b1db70cc3db4fc41398ecac3b01530faa2c542579d94b4aad8c58","last_reissued_at":"2026-07-05T01:38:04.045214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:38:04.045214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.05647","source_version":2,"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-05T01:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z5ZXVX7mvuKkzJYebibjFIUXRBl2rqKQUY1Jzr7re3Biv+prSVTqit+2dM/SszOPUD9nTTQfldw8OJ1xmO6/BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:36:52.591360Z"},"content_sha256":"9446586ee3fc05a2a1c18a93ee052a000a40d508a28cfeabc4a541f43611ee07","schema_version":"1.0","event_id":"sha256:9446586ee3fc05a2a1c18a93ee052a000a40d508a28cfeabc4a541f43611ee07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:PAQJ3KJKPMO3ODGD3NH4IE4Y5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressed Deep Networks: Goodbye SVD, Hello Robust Low-Rank Approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Alaa Maalouf, Dan Feldman, Matan Weksler, Murad Tukan","submitted_at":"2020-09-11T20:21:42Z","abstract_excerpt":"A common technique for compressing a neural network is to compute the $k$-rank $\\ell_2$ approximation $A_{k,2}$ of the matrix $A\\in\\mathbb{R}^{n\\times d}$ that corresponds to a fully connected layer (or embedding layer). Here, $d$ is the number of the neurons in the layer, $n$ is the number in the next one, and $A_{k,2}$ can be stored in $O((n+d)k)$ memory instead of $O(nd)$.\n  This $\\ell_2$-approximation minimizes the sum over every entry to the power of $p=2$ in the matrix $A - A_{k,2}$, among every matrix $A_{k,2}\\in\\mathbb{R}^{n\\times d}$ whose rank is $k$. While it can be computed efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05647","kind":"arxiv","version":2},"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/2009.05647/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-05T01:38:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pF1stjOfqbPspeX9Ut68PcgRyAqTsVPtugBPmFyBH9efP6Qe/lHP1ZgG3hT4WM77Ny9cDhiDzHQ/1/0Ve8+pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:36:52.591726Z"},"content_sha256":"67b56c68042e0ff2185e286b7415f658f339c97781b2e0985754ae22d5d79780","schema_version":"1.0","event_id":"sha256:67b56c68042e0ff2185e286b7415f658f339c97781b2e0985754ae22d5d79780"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PAQJ3KJKPMO3ODGD3NH4IE4Y5S/bundle.json","state_url":"https://pith.science/pith/PAQJ3KJKPMO3ODGD3NH4IE4Y5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PAQJ3KJKPMO3ODGD3NH4IE4Y5S/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-07T13:36:52Z","links":{"resolver":"https://pith.science/pith/PAQJ3KJKPMO3ODGD3NH4IE4Y5S","bundle":"https://pith.science/pith/PAQJ3KJKPMO3ODGD3NH4IE4Y5S/bundle.json","state":"https://pith.science/pith/PAQJ3KJKPMO3ODGD3NH4IE4Y5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PAQJ3KJKPMO3ODGD3NH4IE4Y5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:PAQJ3KJKPMO3ODGD3NH4IE4Y5S","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":"bd0ab73251740badc2984e36d7c0fe7541d3ee4ab22efc36b2ded8905ff47361","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-11T20:21:42Z","title_canon_sha256":"315868a97341c7af674e4893538c55998363c6deba37891824f495a8c1614d6b"},"schema_version":"1.0","source":{"id":"2009.05647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.05647","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"arxiv_version","alias_value":"2009.05647v2","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.05647","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"pith_short_12","alias_value":"PAQJ3KJKPMO3","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"pith_short_16","alias_value":"PAQJ3KJKPMO3ODGD","created_at":"2026-07-05T01:38:04Z"},{"alias_kind":"pith_short_8","alias_value":"PAQJ3KJK","created_at":"2026-07-05T01:38:04Z"}],"graph_snapshots":[{"event_id":"sha256:67b56c68042e0ff2185e286b7415f658f339c97781b2e0985754ae22d5d79780","target":"graph","created_at":"2026-07-05T01:38:04Z","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/2009.05647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A common technique for compressing a neural network is to compute the $k$-rank $\\ell_2$ approximation $A_{k,2}$ of the matrix $A\\in\\mathbb{R}^{n\\times d}$ that corresponds to a fully connected layer (or embedding layer). Here, $d$ is the number of the neurons in the layer, $n$ is the number in the next one, and $A_{k,2}$ can be stored in $O((n+d)k)$ memory instead of $O(nd)$.\n  This $\\ell_2$-approximation minimizes the sum over every entry to the power of $p=2$ in the matrix $A - A_{k,2}$, among every matrix $A_{k,2}\\in\\mathbb{R}^{n\\times d}$ whose rank is $k$. While it can be computed efficie","authors_text":"Alaa Maalouf, Dan Feldman, Matan Weksler, Murad Tukan","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-11T20:21:42Z","title":"Compressed Deep Networks: Goodbye SVD, Hello Robust Low-Rank Approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.05647","kind":"arxiv","version":2},"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:9446586ee3fc05a2a1c18a93ee052a000a40d508a28cfeabc4a541f43611ee07","target":"record","created_at":"2026-07-05T01:38:04Z","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":"bd0ab73251740badc2984e36d7c0fe7541d3ee4ab22efc36b2ded8905ff47361","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-09-11T20:21:42Z","title_canon_sha256":"315868a97341c7af674e4893538c55998363c6deba37891824f495a8c1614d6b"},"schema_version":"1.0","source":{"id":"2009.05647","kind":"arxiv","version":2}},"canonical_sha256":"78209da92a7b1db70cc3db4fc41398ecac3b01530faa2c542579d94b4aad8c58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78209da92a7b1db70cc3db4fc41398ecac3b01530faa2c542579d94b4aad8c58","first_computed_at":"2026-07-05T01:38:04.045214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:38:04.045214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5kmssiq0gH2xx/oEskTNw3hNtLo/dwouuz8Jz8qSBFvftyH3QeluQWwnvhX8v1+qBPDwuOTLcIxvgjNvdJ6ZAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:38:04.045646Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.05647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9446586ee3fc05a2a1c18a93ee052a000a40d508a28cfeabc4a541f43611ee07","sha256:67b56c68042e0ff2185e286b7415f658f339c97781b2e0985754ae22d5d79780"],"state_sha256":"a3dfb4881b2fe10e1a6d43246c91135c83f380c0770bd28d682efda17c08d95b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rxWx1FFQ+rj/HfAkJAcqP9eTIzatrXNZ1CQmciTgYaU8SWpGIJaudkbPPabESquuU1mFaSHHvyJoeM+Gtd+aBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:36:52.593591Z","bundle_sha256":"39e287af4fcddaf66531d55376d52cb7fa0df226d7113d32e310b93479796bf8"}}