{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ARXPC4DSKEIBGRWLR5CSGJOWM2","short_pith_number":"pith:ARXPC4DS","canonical_record":{"source":{"id":"2606.21847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T03:10:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"33ab8f5edba35c53213709bc3dd954af5b62509c6c5bd3034fba80aec751b8eb","abstract_canon_sha256":"267906a7a3a346621edc35aa089e6d31df04a14df2bb5bd9b748275b66389988"},"schema_version":"1.0"},"canonical_sha256":"046ef1707251101346cb8f452325d6669d436ee0fcdb955651e5e02daa835e1d","source":{"kind":"arxiv","id":"2606.21847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21847","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21847v1","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21847","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"ARXPC4DSKEIB","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"pith_short_16","alias_value":"ARXPC4DSKEIBGRWL","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"pith_short_8","alias_value":"ARXPC4DS","created_at":"2026-06-23T02:13:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ARXPC4DSKEIBGRWLR5CSGJOWM2","target":"record","payload":{"canonical_record":{"source":{"id":"2606.21847","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T03:10:33Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"33ab8f5edba35c53213709bc3dd954af5b62509c6c5bd3034fba80aec751b8eb","abstract_canon_sha256":"267906a7a3a346621edc35aa089e6d31df04a14df2bb5bd9b748275b66389988"},"schema_version":"1.0"},"canonical_sha256":"046ef1707251101346cb8f452325d6669d436ee0fcdb955651e5e02daa835e1d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T02:13:00.703042Z","signature_b64":"/T0EwhRznbrsdsxZOGfcJ7Pgh7MU+94ei0eutfZK/GZPF7nBmDTV38DXh9y3r2WbgVJL7JY8aSG77IZhofusCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"046ef1707251101346cb8f452325d6669d436ee0fcdb955651e5e02daa835e1d","last_reissued_at":"2026-06-23T02:13:00.702519Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T02:13:00.702519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.21847","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-06-23T02:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8+JxqHhxkwyJegZqTOeKK9frHKeDCGU7mq0NgTRKjN9nlFw+8cuIxQ8Expgs2sfiAOhcBlK9ugADgxwKS7oCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:11:12.063864Z"},"content_sha256":"1b17538c6ab56a48c5893f7d4b2d7644661c33ae01f89d7883f1783e62d65937","schema_version":"1.0","event_id":"sha256:1b17538c6ab56a48c5893f7d4b2d7644661c33ae01f89d7883f1783e62d65937"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ARXPC4DSKEIBGRWLR5CSGJOWM2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"UniRank: Unified Rank Allocation for Low-Rank LLM Compression","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Chao Han, Fei Ma, Haozhe Hu, Wei Zhang, Xiaoyu Shen","submitted_at":"2026-06-20T03:10:33Z","abstract_excerpt":"Low-rank decomposition serves as a promising compression paradigm for large language models, however, rank allocation remains challenging: manual rules lack generalizability, and learning-based approaches incur heavy computational overhead. To address these issues, we formulate global low-rank allocation as a sorting-and-truncation pipeline, and score each singular component via dual criteria: \\textbf{Local} singular energy ratio that quantifies the intrinsic importance within the decomposed parameter matrix and \\textbf{Global} functional importance (measured by input-output cosine similarity)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21847","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.21847/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-06-23T02:13:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uNV8uzetzqqrnvVy83VPq0qb6Lr64jiTXWl0o5+w5DU51JLQfoHD5pnqhtJzBXRLAeOU2JRPvD0hJoIUjEs+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T15:11:12.064242Z"},"content_sha256":"3345b5f77aaf6a336ba352185fc6ef98ac7aad2025bfc17cdb869f201a90b0de","schema_version":"1.0","event_id":"sha256:3345b5f77aaf6a336ba352185fc6ef98ac7aad2025bfc17cdb869f201a90b0de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/bundle.json","state_url":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/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-04T15:11:12Z","links":{"resolver":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2","bundle":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/bundle.json","state":"https://pith.science/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ARXPC4DSKEIBGRWLR5CSGJOWM2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ARXPC4DSKEIBGRWLR5CSGJOWM2","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":"267906a7a3a346621edc35aa089e6d31df04a14df2bb5bd9b748275b66389988","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T03:10:33Z","title_canon_sha256":"33ab8f5edba35c53213709bc3dd954af5b62509c6c5bd3034fba80aec751b8eb"},"schema_version":"1.0","source":{"id":"2606.21847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.21847","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"arxiv_version","alias_value":"2606.21847v1","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.21847","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"pith_short_12","alias_value":"ARXPC4DSKEIB","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"pith_short_16","alias_value":"ARXPC4DSKEIBGRWL","created_at":"2026-06-23T02:13:00Z"},{"alias_kind":"pith_short_8","alias_value":"ARXPC4DS","created_at":"2026-06-23T02:13:00Z"}],"graph_snapshots":[{"event_id":"sha256:3345b5f77aaf6a336ba352185fc6ef98ac7aad2025bfc17cdb869f201a90b0de","target":"graph","created_at":"2026-06-23T02:13:00Z","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/2606.21847/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Low-rank decomposition serves as a promising compression paradigm for large language models, however, rank allocation remains challenging: manual rules lack generalizability, and learning-based approaches incur heavy computational overhead. To address these issues, we formulate global low-rank allocation as a sorting-and-truncation pipeline, and score each singular component via dual criteria: \\textbf{Local} singular energy ratio that quantifies the intrinsic importance within the decomposed parameter matrix and \\textbf{Global} functional importance (measured by input-output cosine similarity)","authors_text":"Chao Han, Fei Ma, Haozhe Hu, Wei Zhang, Xiaoyu Shen","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T03:10:33Z","title":"UniRank: Unified Rank Allocation for Low-Rank LLM Compression"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.21847","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:1b17538c6ab56a48c5893f7d4b2d7644661c33ae01f89d7883f1783e62d65937","target":"record","created_at":"2026-06-23T02:13:00Z","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":"267906a7a3a346621edc35aa089e6d31df04a14df2bb5bd9b748275b66389988","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-06-20T03:10:33Z","title_canon_sha256":"33ab8f5edba35c53213709bc3dd954af5b62509c6c5bd3034fba80aec751b8eb"},"schema_version":"1.0","source":{"id":"2606.21847","kind":"arxiv","version":1}},"canonical_sha256":"046ef1707251101346cb8f452325d6669d436ee0fcdb955651e5e02daa835e1d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"046ef1707251101346cb8f452325d6669d436ee0fcdb955651e5e02daa835e1d","first_computed_at":"2026-06-23T02:13:00.702519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T02:13:00.702519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/T0EwhRznbrsdsxZOGfcJ7Pgh7MU+94ei0eutfZK/GZPF7nBmDTV38DXh9y3r2WbgVJL7JY8aSG77IZhofusCQ==","signature_status":"signed_v1","signed_at":"2026-06-23T02:13:00.703042Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.21847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1b17538c6ab56a48c5893f7d4b2d7644661c33ae01f89d7883f1783e62d65937","sha256:3345b5f77aaf6a336ba352185fc6ef98ac7aad2025bfc17cdb869f201a90b0de"],"state_sha256":"bf5a9357d83b62c8c81fc8c7e3dab9b24b2ba5ec6359db48d9ce5799b6c47158"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tisFKp8w5ilqZ4nYc80p9syyshMzq+bdxj+75bbkoxFvX87pTwlwJAUfAUbAfyV83e7GQYL05OiOCDqvFVPhDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T15:11:12.066208Z","bundle_sha256":"493b0af12869e6554f184cfb5e84fe6864ec2fcc39741aa42503944e51e737c4"}}