{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:6ROQDVJRRSM3VHEJ7SYYOLJVKY","short_pith_number":"pith:6ROQDVJR","schema_version":"1.0","canonical_sha256":"f45d01d5318c99ba9c89fcb1872d3556265d3a8827cdee0aac47b4888061d8a5","source":{"kind":"arxiv","id":"2308.14929","version":2},"attestation_state":"computed","paper":{"title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongyi Wang, Samuel Horvath, Shashank Rajput, Stefanos Laskaridis","submitted_at":"2023-08-28T23:08:15Z","abstract_excerpt":"Deep Neural Networks (DNNs) have been a large driver for AI breakthroughs in recent years. However, these models have been getting increasingly large as they become more accurate and safe. This means that their training becomes increasingly costly and time-consuming and typically yields a single model to fit all targets. Various techniques have been proposed in the literature to mitigate this, including pruning, sparsification, or quantization of model weights and updates. While achieving high compression rates, they often incur significant computational overheads at training or lead to non-ne"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2308.14929","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-28T23:08:15Z","cross_cats_sorted":[],"title_canon_sha256":"9282bd6a1e55e0dec4c9263f1368e5879f7abcaa5b180c9e6ea4a22e3e911c9a","abstract_canon_sha256":"522781d67e9b7d0574a9aca8d352d587f51a469d3ccb053eac252f322eb6a27e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:31:41.318665Z","signature_b64":"Nnlp8ddPWcCGpwHysaa1wGH/Fhmonf86qvj+jCWtf2tZWJin28SPtB4xmgn0/dSt2o6gx2Rq/aX4s9HoYJvwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f45d01d5318c99ba9c89fcb1872d3556265d3a8827cdee0aac47b4888061d8a5","last_reissued_at":"2026-07-05T08:31:41.318177Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:31:41.318177Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maestro: Uncovering Low-Rank Structures via Trainable Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Hongyi Wang, Samuel Horvath, Shashank Rajput, Stefanos Laskaridis","submitted_at":"2023-08-28T23:08:15Z","abstract_excerpt":"Deep Neural Networks (DNNs) have been a large driver for AI breakthroughs in recent years. However, these models have been getting increasingly large as they become more accurate and safe. This means that their training becomes increasingly costly and time-consuming and typically yields a single model to fit all targets. Various techniques have been proposed in the literature to mitigate this, including pruning, sparsification, or quantization of model weights and updates. While achieving high compression rates, they often incur significant computational overheads at training or lead to non-ne"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.14929","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/2308.14929/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2308.14929","created_at":"2026-07-05T08:31:41.318230+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.14929v2","created_at":"2026-07-05T08:31:41.318230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.14929","created_at":"2026-07-05T08:31:41.318230+00:00"},{"alias_kind":"pith_short_12","alias_value":"6ROQDVJRRSM3","created_at":"2026-07-05T08:31:41.318230+00:00"},{"alias_kind":"pith_short_16","alias_value":"6ROQDVJRRSM3VHEJ","created_at":"2026-07-05T08:31:41.318230+00:00"},{"alias_kind":"pith_short_8","alias_value":"6ROQDVJR","created_at":"2026-07-05T08:31:41.318230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15573","citing_title":"Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems","ref_index":114,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY","json":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY.json","graph_json":"https://pith.science/api/pith-number/6ROQDVJRRSM3VHEJ7SYYOLJVKY/graph.json","events_json":"https://pith.science/api/pith-number/6ROQDVJRRSM3VHEJ7SYYOLJVKY/events.json","paper":"https://pith.science/paper/6ROQDVJR"},"agent_actions":{"view_html":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY","download_json":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY.json","view_paper":"https://pith.science/paper/6ROQDVJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.14929&json=true","fetch_graph":"https://pith.science/api/pith-number/6ROQDVJRRSM3VHEJ7SYYOLJVKY/graph.json","fetch_events":"https://pith.science/api/pith-number/6ROQDVJRRSM3VHEJ7SYYOLJVKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY/action/storage_attestation","attest_author":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY/action/author_attestation","sign_citation":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY/action/citation_signature","submit_replication":"https://pith.science/pith/6ROQDVJRRSM3VHEJ7SYYOLJVKY/action/replication_record"}},"created_at":"2026-07-05T08:31:41.318230+00:00","updated_at":"2026-07-05T08:31:41.318230+00:00"}