{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WFMCFSIWX6CV3VHOPSVXOLSCQY","short_pith_number":"pith:WFMCFSIW","canonical_record":{"source":{"id":"2606.00573","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-30T06:53:23Z","cross_cats_sorted":[],"title_canon_sha256":"ab84d415cdf2ac707072dc3884eab7972beb079a8c4fb5e449755659aedf8655","abstract_canon_sha256":"6b37abaf7751f66184f712ef5ffacbd226037d21466c1b62d79672d0b81728d4"},"schema_version":"1.0"},"canonical_sha256":"b15822c916bf855dd4ee7cab772e4286131eae6480ffbb0be0cda95cf8cc8441","source":{"kind":"arxiv","id":"2606.00573","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00573","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00573v1","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00573","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"WFMCFSIWX6CV","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"WFMCFSIWX6CV3VHO","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"WFMCFSIW","created_at":"2026-06-02T01:03:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WFMCFSIWX6CV3VHOPSVXOLSCQY","target":"record","payload":{"canonical_record":{"source":{"id":"2606.00573","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-30T06:53:23Z","cross_cats_sorted":[],"title_canon_sha256":"ab84d415cdf2ac707072dc3884eab7972beb079a8c4fb5e449755659aedf8655","abstract_canon_sha256":"6b37abaf7751f66184f712ef5ffacbd226037d21466c1b62d79672d0b81728d4"},"schema_version":"1.0"},"canonical_sha256":"b15822c916bf855dd4ee7cab772e4286131eae6480ffbb0be0cda95cf8cc8441","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:03:58.654997Z","signature_b64":"PsN0YQl8F0LFMoC2mpMq0/4xQMC0kGlIPqUSZNuvbz7OqWyt1VEWRuJkzl710jkkFHKcmvOMYdD5q2cH+5cNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b15822c916bf855dd4ee7cab772e4286131eae6480ffbb0be0cda95cf8cc8441","last_reissued_at":"2026-06-02T01:03:58.654604Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:03:58.654604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.00573","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-02T01:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aye2Z1iTFr2WiYk7Z4XjMQ4T3Qunjm1l3DMsAARw5GVaRDi/vUup7wg6iB1+KH9S8EieMZUl74hJgs/MKZ1tCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:38:30.781568Z"},"content_sha256":"425aca7f7fb02326ea2084971e002ccfdceb2cf6944ef090dadb5e2bf5ea6ba8","schema_version":"1.0","event_id":"sha256:425aca7f7fb02326ea2084971e002ccfdceb2cf6944ef090dadb5e2bf5ea6ba8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WFMCFSIWX6CV3VHOPSVXOLSCQY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"LASER: Loss-Aware Singular-value Decomposition and Rank Allocation for Efficient Low-Precision Vision-Language Models","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haiyu Wang, Leshu Li, Sai Qian Zhang, Yihui Ren, Yutong Wang","submitted_at":"2026-05-30T06:53:23Z","abstract_excerpt":"Vision-language models (VLMs) deliver strong multimodal reasoning capabilities, but their large computational cost and high parameter counts make deployment challenging on resource-constrained devices. Low-rank decomposition has emerged as a promising compression technique, yet existing methods often optimize local matrix reconstruction error, rely on uniform or heuristic rank allocation, and focus mainly on attention projections while leaving feed-forward networks underexplored. In this paper, we propose~\\textit{LASER} (\\textbf{L}oss-\\textbf{A}ware \\textbf{S}ingular-value d\\textbf{E}compositi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00573","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.00573/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-02T01:03:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7HLWEb5g3dIJKtZ2JMmvminA1iefjRW856kY8+ZGhQ3u4Ao8jqAhy5D9fItFe1MYr0gQgh89MaagSuYEqeAHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T18:38:30.781939Z"},"content_sha256":"e71278df08912087087587580fa4caf8492d8e1e7ebafa2d707409e86e61c6ce","schema_version":"1.0","event_id":"sha256:e71278df08912087087587580fa4caf8492d8e1e7ebafa2d707409e86e61c6ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WFMCFSIWX6CV3VHOPSVXOLSCQY/bundle.json","state_url":"https://pith.science/pith/WFMCFSIWX6CV3VHOPSVXOLSCQY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WFMCFSIWX6CV3VHOPSVXOLSCQY/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-29T18:38:30Z","links":{"resolver":"https://pith.science/pith/WFMCFSIWX6CV3VHOPSVXOLSCQY","bundle":"https://pith.science/pith/WFMCFSIWX6CV3VHOPSVXOLSCQY/bundle.json","state":"https://pith.science/pith/WFMCFSIWX6CV3VHOPSVXOLSCQY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WFMCFSIWX6CV3VHOPSVXOLSCQY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WFMCFSIWX6CV3VHOPSVXOLSCQY","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":"6b37abaf7751f66184f712ef5ffacbd226037d21466c1b62d79672d0b81728d4","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-30T06:53:23Z","title_canon_sha256":"ab84d415cdf2ac707072dc3884eab7972beb079a8c4fb5e449755659aedf8655"},"schema_version":"1.0","source":{"id":"2606.00573","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.00573","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"arxiv_version","alias_value":"2606.00573v1","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.00573","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"pith_short_12","alias_value":"WFMCFSIWX6CV","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"pith_short_16","alias_value":"WFMCFSIWX6CV3VHO","created_at":"2026-06-02T01:03:58Z"},{"alias_kind":"pith_short_8","alias_value":"WFMCFSIW","created_at":"2026-06-02T01:03:58Z"}],"graph_snapshots":[{"event_id":"sha256:e71278df08912087087587580fa4caf8492d8e1e7ebafa2d707409e86e61c6ce","target":"graph","created_at":"2026-06-02T01:03:58Z","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.00573/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Vision-language models (VLMs) deliver strong multimodal reasoning capabilities, but their large computational cost and high parameter counts make deployment challenging on resource-constrained devices. Low-rank decomposition has emerged as a promising compression technique, yet existing methods often optimize local matrix reconstruction error, rely on uniform or heuristic rank allocation, and focus mainly on attention projections while leaving feed-forward networks underexplored. In this paper, we propose~\\textit{LASER} (\\textbf{L}oss-\\textbf{A}ware \\textbf{S}ingular-value d\\textbf{E}compositi","authors_text":"Haiyu Wang, Leshu Li, Sai Qian Zhang, Yihui Ren, Yutong Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-30T06:53:23Z","title":"LASER: Loss-Aware Singular-value Decomposition and Rank Allocation for Efficient Low-Precision Vision-Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.00573","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:425aca7f7fb02326ea2084971e002ccfdceb2cf6944ef090dadb5e2bf5ea6ba8","target":"record","created_at":"2026-06-02T01:03:58Z","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":"6b37abaf7751f66184f712ef5ffacbd226037d21466c1b62d79672d0b81728d4","cross_cats_sorted":[],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-30T06:53:23Z","title_canon_sha256":"ab84d415cdf2ac707072dc3884eab7972beb079a8c4fb5e449755659aedf8655"},"schema_version":"1.0","source":{"id":"2606.00573","kind":"arxiv","version":1}},"canonical_sha256":"b15822c916bf855dd4ee7cab772e4286131eae6480ffbb0be0cda95cf8cc8441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b15822c916bf855dd4ee7cab772e4286131eae6480ffbb0be0cda95cf8cc8441","first_computed_at":"2026-06-02T01:03:58.654604Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T01:03:58.654604Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PsN0YQl8F0LFMoC2mpMq0/4xQMC0kGlIPqUSZNuvbz7OqWyt1VEWRuJkzl710jkkFHKcmvOMYdD5q2cH+5cNCA==","signature_status":"signed_v1","signed_at":"2026-06-02T01:03:58.654997Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.00573","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:425aca7f7fb02326ea2084971e002ccfdceb2cf6944ef090dadb5e2bf5ea6ba8","sha256:e71278df08912087087587580fa4caf8492d8e1e7ebafa2d707409e86e61c6ce"],"state_sha256":"da05cccc279de876d3b041c221a2a69f588a556c21bcacc72dfd314faac9392b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE+SP4Q1U2ddacRm04sa74MHluB/5czoCzBgDTQTeobRewZ7B1gk2wWDWdDjgcoUiS7KL6ZRvUlhhedDEuyfDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T18:38:30.784014Z","bundle_sha256":"88a2c42d872fafab716dd2648deacb21402fc4483492aabca008b1d69e95dfec"}}