{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DM2KMFTCWBELHKWRHRBHPFG45N","short_pith_number":"pith:DM2KMFTC","canonical_record":{"source":{"id":"2501.19090","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T12:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"adfd67542982dfbd3bf2ae19ac72aa28ac4e9836b96a89c2c0262a479bcc6288","abstract_canon_sha256":"65a9a5daa88f386016aea36fb6a412855526d41dd06e638c25974f4aecc77474"},"schema_version":"1.0"},"canonical_sha256":"1b34a61662b048b3aad13c427794dceb616af8191a2c04cffadf6845ab2a7948","source":{"kind":"arxiv","id":"2501.19090","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19090","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19090v3","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19090","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"DM2KMFTCWBEL","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"pith_short_16","alias_value":"DM2KMFTCWBELHKWR","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"pith_short_8","alias_value":"DM2KMFTC","created_at":"2026-07-05T11:52:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DM2KMFTCWBELHKWRHRBHPFG45N","target":"record","payload":{"canonical_record":{"source":{"id":"2501.19090","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T12:36:31Z","cross_cats_sorted":[],"title_canon_sha256":"adfd67542982dfbd3bf2ae19ac72aa28ac4e9836b96a89c2c0262a479bcc6288","abstract_canon_sha256":"65a9a5daa88f386016aea36fb6a412855526d41dd06e638c25974f4aecc77474"},"schema_version":"1.0"},"canonical_sha256":"1b34a61662b048b3aad13c427794dceb616af8191a2c04cffadf6845ab2a7948","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:52:59.200389Z","signature_b64":"qYBPInyUPS30hvoYBe1ro0zLOnnHTSUJfK2M/sfGgM5ZhVYs7zRkAo2v2ur+dAjF0p+o5krKIkeV0ASP2L71CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b34a61662b048b3aad13c427794dceb616af8191a2c04cffadf6845ab2a7948","last_reissued_at":"2026-07-05T11:52:59.199947Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:52:59.199947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.19090","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-05T11:52:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyUetocHtbf8T/rQZ+lu12JJlP4MnWK3PeHUmzLAvrGCiHj2nGNJz22AnD6i9a2dAQlE6sidKfuMBqU3n12JCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:09:21.933057Z"},"content_sha256":"a3d56a8f8f88a5c272f5d46f09130fc07e7638a923883e26a9d590225fee4e33","schema_version":"1.0","event_id":"sha256:a3d56a8f8f88a5c272f5d46f09130fc07e7638a923883e26a9d590225fee4e33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DM2KMFTCWBELHKWRHRBHPFG45N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pivoting Factorization: A Compact Meta Low-Rank Representation of Sparsity for Efficient Inference in Large Language Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carlo Vittorio Cannistraci, Jialin Zhao, Yingtao Zhang","submitted_at":"2025-01-31T12:36:31Z","abstract_excerpt":"The rapid growth of Large Language Models has driven demand for effective model compression techniques to reduce memory and computation costs. Low-rank pruning has gained attention for its GPU compatibility across all densities. However, low-rank pruning struggles to match the performance of semi-structured pruning, often doubling perplexity at similar densities. In this paper, we propose Pivoting Factorization (PIFA), a novel lossless meta low-rank representation that unsupervisedly learns a compact form of any low-rank representation, effectively eliminating redundant information. PIFA ident"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19090","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/2501.19090/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-05T11:52:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MRCRSIi5bNQS85bDTLMdpvetrIYJ+RdKw48C2pTz25hvoh+Cb5Qeb1LRdnj2FKDi2kBv+pRTV8aWI9Mzkb64DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:09:21.933621Z"},"content_sha256":"4a3dcef09c51b3a015ca397dd88f9d0a0a99c7ba51715b20e29124391e477b66","schema_version":"1.0","event_id":"sha256:4a3dcef09c51b3a015ca397dd88f9d0a0a99c7ba51715b20e29124391e477b66"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DM2KMFTCWBELHKWRHRBHPFG45N/bundle.json","state_url":"https://pith.science/pith/DM2KMFTCWBELHKWRHRBHPFG45N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DM2KMFTCWBELHKWRHRBHPFG45N/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-08-05T09:09:21Z","links":{"resolver":"https://pith.science/pith/DM2KMFTCWBELHKWRHRBHPFG45N","bundle":"https://pith.science/pith/DM2KMFTCWBELHKWRHRBHPFG45N/bundle.json","state":"https://pith.science/pith/DM2KMFTCWBELHKWRHRBHPFG45N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DM2KMFTCWBELHKWRHRBHPFG45N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DM2KMFTCWBELHKWRHRBHPFG45N","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":"65a9a5daa88f386016aea36fb6a412855526d41dd06e638c25974f4aecc77474","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T12:36:31Z","title_canon_sha256":"adfd67542982dfbd3bf2ae19ac72aa28ac4e9836b96a89c2c0262a479bcc6288"},"schema_version":"1.0","source":{"id":"2501.19090","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.19090","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"arxiv_version","alias_value":"2501.19090v3","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.19090","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"pith_short_12","alias_value":"DM2KMFTCWBEL","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"pith_short_16","alias_value":"DM2KMFTCWBELHKWR","created_at":"2026-07-05T11:52:59Z"},{"alias_kind":"pith_short_8","alias_value":"DM2KMFTC","created_at":"2026-07-05T11:52:59Z"}],"graph_snapshots":[{"event_id":"sha256:4a3dcef09c51b3a015ca397dd88f9d0a0a99c7ba51715b20e29124391e477b66","target":"graph","created_at":"2026-07-05T11:52:59Z","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/2501.19090/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The rapid growth of Large Language Models has driven demand for effective model compression techniques to reduce memory and computation costs. Low-rank pruning has gained attention for its GPU compatibility across all densities. However, low-rank pruning struggles to match the performance of semi-structured pruning, often doubling perplexity at similar densities. In this paper, we propose Pivoting Factorization (PIFA), a novel lossless meta low-rank representation that unsupervisedly learns a compact form of any low-rank representation, effectively eliminating redundant information. PIFA ident","authors_text":"Carlo Vittorio Cannistraci, Jialin Zhao, Yingtao Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T12:36:31Z","title":"Pivoting Factorization: A Compact Meta Low-Rank Representation of Sparsity for Efficient Inference in Large Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.19090","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:a3d56a8f8f88a5c272f5d46f09130fc07e7638a923883e26a9d590225fee4e33","target":"record","created_at":"2026-07-05T11:52:59Z","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":"65a9a5daa88f386016aea36fb6a412855526d41dd06e638c25974f4aecc77474","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-01-31T12:36:31Z","title_canon_sha256":"adfd67542982dfbd3bf2ae19ac72aa28ac4e9836b96a89c2c0262a479bcc6288"},"schema_version":"1.0","source":{"id":"2501.19090","kind":"arxiv","version":3}},"canonical_sha256":"1b34a61662b048b3aad13c427794dceb616af8191a2c04cffadf6845ab2a7948","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b34a61662b048b3aad13c427794dceb616af8191a2c04cffadf6845ab2a7948","first_computed_at":"2026-07-05T11:52:59.199947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:52:59.199947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qYBPInyUPS30hvoYBe1ro0zLOnnHTSUJfK2M/sfGgM5ZhVYs7zRkAo2v2ur+dAjF0p+o5krKIkeV0ASP2L71CA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:52:59.200389Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.19090","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3d56a8f8f88a5c272f5d46f09130fc07e7638a923883e26a9d590225fee4e33","sha256:4a3dcef09c51b3a015ca397dd88f9d0a0a99c7ba51715b20e29124391e477b66"],"state_sha256":"3bb2d5f18e70747e55ff7c30328bb24783f083719e59a95bcad37c8c4ddf79bf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYbpuVpX4ziUwyV52e1+1k7qvzk+JyleF9bXMWvTLGJZ/LYGfXif2Qv9TcoLwaUa6BLXRNv33Y6uILEkDLljAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:09:21.937914Z","bundle_sha256":"ddc2a8fc4c467de345944d98f10f36bf7c19b262eb92a669c297cceaeea59dd4"}}