{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:57JJPCFWUNGXNLUVINLCQVIDKY","short_pith_number":"pith:57JJPCFW","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"},"canonical_sha256":"efd29788b6a34d76ae9543562855035605c09c7dfdddfe9065606347daa27a1f","source":{"kind":"arxiv","id":"2302.04570","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04570","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04570v2","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04570","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"pith_short_12","alias_value":"57JJPCFWUNGX","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"pith_short_16","alias_value":"57JJPCFWUNGXNLUV","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"pith_short_8","alias_value":"57JJPCFW","created_at":"2026-07-05T05:56:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:57JJPCFWUNGXNLUVINLCQVIDKY","target":"record","payload":{"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"},"canonical_sha256":"efd29788b6a34d76ae9543562855035605c09c7dfdddfe9065606347daa27a1f","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"},"source_kind":"arxiv","source_id":"2302.04570","source_version":2,"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-07-05T05:56:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rz6X9UrthSteMbggXxkeGJC9Ha7HXoRaewwT8+Ms2/+pXN7tnABrspe1ietRMveWOHt4p9StH+OJYFyulOxjDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:33:50.107618Z"},"content_sha256":"456ce47eb1322bd6b5c1331a8b4d2c563258da8d58cb1c9ff89b3e63050a67b4","schema_version":"1.0","event_id":"sha256:456ce47eb1322bd6b5c1331a8b4d2c563258da8d58cb1c9ff89b3e63050a67b4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:57JJPCFWUNGXNLUVINLCQVIDKY","target":"graph","payload":{"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"},"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-07-05T05:56:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJfksOgJfs2LDtuJcFFxFvBsyR39ibclbphkocpL5oi9JtgH/j1e17ueFcDokBCgxP8MXVL6ok5Uq1JAhskMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T16:33:50.108172Z"},"content_sha256":"88de5531f4e5707e3a7489a1aed7001844c28d46d2a0394cb388995b057d8c03","schema_version":"1.0","event_id":"sha256:88de5531f4e5707e3a7489a1aed7001844c28d46d2a0394cb388995b057d8c03"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/bundle.json","state_url":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/57JJPCFWUNGXNLUVINLCQVIDKY/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-08-03T16:33:50Z","links":{"resolver":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY","bundle":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/bundle.json","state":"https://pith.science/pith/57JJPCFWUNGXNLUVINLCQVIDKY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/57JJPCFWUNGXNLUVINLCQVIDKY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:57JJPCFWUNGXNLUVINLCQVIDKY","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":"618876be288c5069162aa703921bd92daf5c8de9f1a740fb26f61392a5dff5fd","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T11:17:34Z","title_canon_sha256":"93e89d76bdb55c0a1296311b8c3861551121ca5358dc55c7cd52293e72562e05"},"schema_version":"1.0","source":{"id":"2302.04570","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2302.04570","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"arxiv_version","alias_value":"2302.04570v2","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.04570","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"pith_short_12","alias_value":"57JJPCFWUNGX","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"pith_short_16","alias_value":"57JJPCFWUNGXNLUV","created_at":"2026-07-05T05:56:41Z"},{"alias_kind":"pith_short_8","alias_value":"57JJPCFW","created_at":"2026-07-05T05:56:41Z"}],"graph_snapshots":[{"event_id":"sha256:88de5531f4e5707e3a7489a1aed7001844c28d46d2a0394cb388995b057d8c03","target":"graph","created_at":"2026-07-05T05:56:41Z","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/2302.04570/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Jihoon Ko, Jinhong Jung, Kijung Shin, Taehyung Kwon","cross_cats":["cs.SI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T11:17:34Z","title":"NeuKron: Constant-Size Lossy Compression of Sparse Reorderable Matrices and Tensors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.04570","kind":"arxiv","version":2},"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:456ce47eb1322bd6b5c1331a8b4d2c563258da8d58cb1c9ff89b3e63050a67b4","target":"record","created_at":"2026-07-05T05:56:41Z","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":"618876be288c5069162aa703921bd92daf5c8de9f1a740fb26f61392a5dff5fd","cross_cats_sorted":["cs.SI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-02-09T11:17:34Z","title_canon_sha256":"93e89d76bdb55c0a1296311b8c3861551121ca5358dc55c7cd52293e72562e05"},"schema_version":"1.0","source":{"id":"2302.04570","kind":"arxiv","version":2}},"canonical_sha256":"efd29788b6a34d76ae9543562855035605c09c7dfdddfe9065606347daa27a1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"efd29788b6a34d76ae9543562855035605c09c7dfdddfe9065606347daa27a1f","first_computed_at":"2026-07-05T05:56:41.396692Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:56:41.396692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4/QtXZaZ0hu/A2zoI+GV03s/Ufm+n/DC6vU2qL2mYhaxKMwqz+QYXd/eFpuuy24gGIub7AXrqFBdTHDdEUaCw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:56:41.397104Z","signed_message":"canonical_sha256_bytes"},"source_id":"2302.04570","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:456ce47eb1322bd6b5c1331a8b4d2c563258da8d58cb1c9ff89b3e63050a67b4","sha256:88de5531f4e5707e3a7489a1aed7001844c28d46d2a0394cb388995b057d8c03"],"state_sha256":"7900fe7d50b633f6ae3c444a9b2d32bb29f546d9ec70bf66e6398465729eedd0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BfXCXuPqPQkTnR7N/rGFlGe9pjM+pUws7IFLChyTS929yEVE+t+zXJTOHF2YGzfYXgjQbhXqnRz5onX1q3VSBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T16:33:50.112966Z","bundle_sha256":"84ec43d0e686bc4368bbe7c80f45b741af225c8bc00d0073257b4c6ac3a2d6b6"}}