{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:JPAWXZT32WTXHAIPODGOH7PPSU","short_pith_number":"pith:JPAWXZT3","schema_version":"1.0","canonical_sha256":"4bc16be67bd5a773810f70cce3fdef9513de85e2a4658daf37608410d9cea7ba","source":{"kind":"arxiv","id":"2412.12204","version":1},"attestation_state":"computed","paper":{"title":"SEE: Sememe Entanglement Encoding for Transformer-bases Models Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Guangxing Cao, Hui Gao, Jing Zhang, Nan Xu, Peng Zhang, Shuzhen Sun, Xindian Ma, Yuexian Hou","submitted_at":"2024-12-15T12:01:43Z","abstract_excerpt":"Transformer-based large language models exhibit groundbreaking capabilities, but their storage and computational costs are prohibitively high, limiting their application in resource-constrained scenarios. An effective approach is to eliminate redundant model parameters and computational costs while incorporating efficient expert-derived knowledge structures to achieve a balance between compression and performance. Therefore, we propose the \\textit{Sememe Entanglement Encoding (SEE)} algorithm. Guided by expert prior knowledge, the model is compressed through the low-rank approximation idea. In"},"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":"2412.12204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-12-15T12:01:43Z","cross_cats_sorted":["cs.AI","cs.CL"],"title_canon_sha256":"f3ecaa951295ee08fb36102bfeb3dd6dc93c70c1349f537bbb6ff5a275c73d37","abstract_canon_sha256":"febbd56c51b049490c01ce41312558e401baf82d05a0a2414345c431ee5acf86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:50:11.468833Z","signature_b64":"4gvtheZ9Slf92DmfZCgwYrbhUoYbj+sjqfXn5B0CaDCyN1Mjl/k7sLSVkjF998h8NVwjIoRpWET7KVOI2cbyCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bc16be67bd5a773810f70cce3fdef9513de85e2a4658daf37608410d9cea7ba","last_reissued_at":"2026-07-05T09:50:11.468392Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:50:11.468392Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SEE: Sememe Entanglement Encoding for Transformer-bases Models Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CL"],"primary_cat":"cs.LG","authors_text":"Guangxing Cao, Hui Gao, Jing Zhang, Nan Xu, Peng Zhang, Shuzhen Sun, Xindian Ma, Yuexian Hou","submitted_at":"2024-12-15T12:01:43Z","abstract_excerpt":"Transformer-based large language models exhibit groundbreaking capabilities, but their storage and computational costs are prohibitively high, limiting their application in resource-constrained scenarios. An effective approach is to eliminate redundant model parameters and computational costs while incorporating efficient expert-derived knowledge structures to achieve a balance between compression and performance. Therefore, we propose the \\textit{Sememe Entanglement Encoding (SEE)} algorithm. Guided by expert prior knowledge, the model is compressed through the low-rank approximation idea. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.12204","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/2412.12204/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":"2412.12204","created_at":"2026-07-05T09:50:11.468444+00:00"},{"alias_kind":"arxiv_version","alias_value":"2412.12204v1","created_at":"2026-07-05T09:50:11.468444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.12204","created_at":"2026-07-05T09:50:11.468444+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPAWXZT32WTX","created_at":"2026-07-05T09:50:11.468444+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPAWXZT32WTXHAIP","created_at":"2026-07-05T09:50:11.468444+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPAWXZT3","created_at":"2026-07-05T09:50:11.468444+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU","json":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU.json","graph_json":"https://pith.science/api/pith-number/JPAWXZT32WTXHAIPODGOH7PPSU/graph.json","events_json":"https://pith.science/api/pith-number/JPAWXZT32WTXHAIPODGOH7PPSU/events.json","paper":"https://pith.science/paper/JPAWXZT3"},"agent_actions":{"view_html":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU","download_json":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU.json","view_paper":"https://pith.science/paper/JPAWXZT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2412.12204&json=true","fetch_graph":"https://pith.science/api/pith-number/JPAWXZT32WTXHAIPODGOH7PPSU/graph.json","fetch_events":"https://pith.science/api/pith-number/JPAWXZT32WTXHAIPODGOH7PPSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU/action/storage_attestation","attest_author":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU/action/author_attestation","sign_citation":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU/action/citation_signature","submit_replication":"https://pith.science/pith/JPAWXZT32WTXHAIPODGOH7PPSU/action/replication_record"}},"created_at":"2026-07-05T09:50:11.468444+00:00","updated_at":"2026-07-05T09:50:11.468444+00:00"}