{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:57JJPCFWUNGXNLUVINLCQVIDKY","short_pith_number":"pith:57JJPCFW","schema_version":"1.0","canonical_sha256":"efd29788b6a34d76ae9543562855035605c09c7dfdddfe9065606347daa27a1f","source":{"kind":"arxiv","id":"2302.04570","version":2},"attestation_state":"computed","paper":{"title":"NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Jihoon Ko, Jinhong Jung, Kijung Shin, Taehyung Kwon","submitted_at":"2023-02-09T11:17:34Z","abstract_excerpt":"Many real-world data are naturally represented as a sparse reorderable matrix, whose rows and columns can be arbitrarily ordered (e.g., the adjacency matrix of a bipartite graph). Storing a sparse matrix in conventional ways requires an amount of space linear in the number of non-zeros, and lossy compression of sparse matrices (e.g., Truncated SVD) typically requires an amount of space linear in the number of rows and columns. In this work, we propose NeuKron for compressing a sparse reorderable matrix into a constant-size space. NeuKron generalizes Kronecker products using a recurrent neural "},"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":"2302.04570","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T11:17:34Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"93e89d76bdb55c0a1296311b8c3861551121ca5358dc55c7cd52293e72562e05","abstract_canon_sha256":"618876be288c5069162aa703921bd92daf5c8de9f1a740fb26f61392a5dff5fd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:56:41.397104Z","signature_b64":"q4/QtXZaZ0hu/A2zoI+GV03s/Ufm+n/DC6vU2qL2mYhaxKMwqz+QYXd/eFpuuy24gGIub7AXrqFBdTHDdEUaCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efd29788b6a34d76ae9543562855035605c09c7dfdddfe9065606347daa27a1f","last_reissued_at":"2026-07-05T05:56:41.396692Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:56:41.396692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Jihoon Ko, Jinhong Jung, Kijung Shin, Taehyung Kwon","submitted_at":"2023-02-09T11:17:34Z","abstract_excerpt":"Many real-world data are naturally represented as a sparse reorderable matrix, whose rows and columns can be arbitrarily ordered (e.g., the adjacency matrix of a bipartite graph). Storing a sparse matrix in conventional ways requires an amount of space linear in the number of non-zeros, and lossy compression of sparse matrices (e.g., Truncated SVD) typically requires an amount of space linear in the number of rows and columns. In this work, we propose NeuKron for compressing a sparse reorderable matrix into a constant-size space. NeuKron generalizes Kronecker products using a recurrent neural "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04570","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/2302.04570/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":"2302.04570","created_at":"2026-07-05T05:56:41.396745+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.04570v2","created_at":"2026-07-05T05:56:41.396745+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04570","created_at":"2026-07-05T05:56:41.396745+00:00"},{"alias_kind":"pith_short_12","alias_value":"57JJPCFWUNGX","created_at":"2026-07-05T05:56:41.396745+00:00"},{"alias_kind":"pith_short_16","alias_value":"57JJPCFWUNGXNLUV","created_at":"2026-07-05T05:56:41.396745+00:00"},{"alias_kind":"pith_short_8","alias_value":"57JJPCFW","created_at":"2026-07-05T05:56:41.396745+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/57JJPCFWUNGXNLUVINLCQVIDKY","json":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY.json","graph_json":"https://pith.science/api/pith-number/57JJPCFWUNGXNLUVINLCQVIDKY/graph.json","events_json":"https://pith.science/api/pith-number/57JJPCFWUNGXNLUVINLCQVIDKY/events.json","paper":"https://pith.science/paper/57JJPCFW"},"agent_actions":{"view_html":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY","download_json":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY.json","view_paper":"https://pith.science/paper/57JJPCFW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.04570&json=true","fetch_graph":"https://pith.science/api/pith-number/57JJPCFWUNGXNLUVINLCQVIDKY/graph.json","fetch_events":"https://pith.science/api/pith-number/57JJPCFWUNGXNLUVINLCQVIDKY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/action/storage_attestation","attest_author":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/action/author_attestation","sign_citation":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/action/citation_signature","submit_replication":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/action/replication_record"}},"created_at":"2026-07-05T05:56:41.396745+00:00","updated_at":"2026-07-05T05:56:41.396745+00:00"}