{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:MQSA55RNEHVW7UAWXXKILOP5KB","short_pith_number":"pith:MQSA55RN","canonical_record":{"source":{"id":"2309.10310","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-19T04:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"3ee4c11beb6b28826415d6440f96841f66ca69f0de619e1ea3b0ec1c36bcf389","abstract_canon_sha256":"d93c899ba9a04531172c9d022425749ea9005f1c132cb7174a235ba7d01b1eb3"},"schema_version":"1.0"},"canonical_sha256":"64240ef62d21eb6fd016bdd485b9fd5045399171cf0c64bc953138e564e89a1f","source":{"kind":"arxiv","id":"2309.10310","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.10310","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"2309.10310v2","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10310","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"MQSA55RNEHVW","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"pith_short_16","alias_value":"MQSA55RNEHVW7UAW","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"pith_short_8","alias_value":"MQSA55RN","created_at":"2026-07-05T06:52:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:MQSA55RNEHVW7UAWXXKILOP5KB","target":"record","payload":{"canonical_record":{"source":{"id":"2309.10310","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-19T04:48:01Z","cross_cats_sorted":[],"title_canon_sha256":"3ee4c11beb6b28826415d6440f96841f66ca69f0de619e1ea3b0ec1c36bcf389","abstract_canon_sha256":"d93c899ba9a04531172c9d022425749ea9005f1c132cb7174a235ba7d01b1eb3"},"schema_version":"1.0"},"canonical_sha256":"64240ef62d21eb6fd016bdd485b9fd5045399171cf0c64bc953138e564e89a1f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:26.520193Z","signature_b64":"9CKUzPNppFQ7ZBfdN5YpEh7XZ4qYL++rrbx0S6wPuBJ1uvpZvndvp7szvQltdJkvLt18ck0sQhin+esp6q1mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64240ef62d21eb6fd016bdd485b9fd5045399171cf0c64bc953138e564e89a1f","last_reissued_at":"2026-07-05T06:52:26.519723Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:26.519723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.10310","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-05T06:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NJJwTNOW2Py5veLqQErAKimQnhWVq64hovcZ2dKA5YypDBb+rQmUMx/I1OdFaeR9CAyw8DJDl2DYX9TTi4UaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T08:00:27.560932Z"},"content_sha256":"44da498e3779f5390bce4f4d35a4c311954acf69d182098603eda65e323af838","schema_version":"1.0","event_id":"sha256:44da498e3779f5390bce4f4d35a4c311954acf69d182098603eda65e323af838"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:MQSA55RNEHVW7UAWXXKILOP5KB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jihoon Ko, Jinhong Jung, Kijung Shin, Taehyung Kwon","submitted_at":"2023-09-19T04:48:01Z","abstract_excerpt":"Many real-world datasets are represented as tensors, i.e., multi-dimensional arrays of numerical values. Storing them without compression often requires substantial space, which grows exponentially with the order. While many tensor compression algorithms are available, many of them rely on strong data assumptions regarding its order, sparsity, rank, and smoothness. In this work, we propose TENSORCODEC, a lossy compression algorithm for general tensors that do not necessarily adhere to strong input data assumptions. TENSORCODEC incorporates three key ideas. The first idea is Neural Tensor-Train"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10310","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/2309.10310/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-05T06:52:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5ltdBeSbhh5ZLNFGr/kbTKqMoTk9o6Na4vJlQW32zRHSt81ZdT8ChY76cvyy0x1WaneFFlwYDYWF2boo1NrAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-11T08:00:27.561439Z"},"content_sha256":"06a63235774d71c87d9b548b06e03d2819d6737c55c0e7d0ce06a802e5096c39","schema_version":"1.0","event_id":"sha256:06a63235774d71c87d9b548b06e03d2819d6737c55c0e7d0ce06a802e5096c39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MQSA55RNEHVW7UAWXXKILOP5KB/bundle.json","state_url":"https://pith.science/pith/MQSA55RNEHVW7UAWXXKILOP5KB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MQSA55RNEHVW7UAWXXKILOP5KB/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-07-11T08:00:27Z","links":{"resolver":"https://pith.science/pith/MQSA55RNEHVW7UAWXXKILOP5KB","bundle":"https://pith.science/pith/MQSA55RNEHVW7UAWXXKILOP5KB/bundle.json","state":"https://pith.science/pith/MQSA55RNEHVW7UAWXXKILOP5KB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MQSA55RNEHVW7UAWXXKILOP5KB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:MQSA55RNEHVW7UAWXXKILOP5KB","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":"d93c899ba9a04531172c9d022425749ea9005f1c132cb7174a235ba7d01b1eb3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-19T04:48:01Z","title_canon_sha256":"3ee4c11beb6b28826415d6440f96841f66ca69f0de619e1ea3b0ec1c36bcf389"},"schema_version":"1.0","source":{"id":"2309.10310","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.10310","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"arxiv_version","alias_value":"2309.10310v2","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10310","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"pith_short_12","alias_value":"MQSA55RNEHVW","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"pith_short_16","alias_value":"MQSA55RNEHVW7UAW","created_at":"2026-07-05T06:52:26Z"},{"alias_kind":"pith_short_8","alias_value":"MQSA55RN","created_at":"2026-07-05T06:52:26Z"}],"graph_snapshots":[{"event_id":"sha256:06a63235774d71c87d9b548b06e03d2819d6737c55c0e7d0ce06a802e5096c39","target":"graph","created_at":"2026-07-05T06:52:26Z","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/2309.10310/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many real-world datasets are represented as tensors, i.e., multi-dimensional arrays of numerical values. Storing them without compression often requires substantial space, which grows exponentially with the order. While many tensor compression algorithms are available, many of them rely on strong data assumptions regarding its order, sparsity, rank, and smoothness. In this work, we propose TENSORCODEC, a lossy compression algorithm for general tensors that do not necessarily adhere to strong input data assumptions. TENSORCODEC incorporates three key ideas. The first idea is Neural Tensor-Train","authors_text":"Jihoon Ko, Jinhong Jung, Kijung Shin, Taehyung Kwon","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-19T04:48:01Z","title":"TensorCodec: Compact Lossy Compression of Tensors without Strong Data Assumptions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10310","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:44da498e3779f5390bce4f4d35a4c311954acf69d182098603eda65e323af838","target":"record","created_at":"2026-07-05T06:52:26Z","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":"d93c899ba9a04531172c9d022425749ea9005f1c132cb7174a235ba7d01b1eb3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-09-19T04:48:01Z","title_canon_sha256":"3ee4c11beb6b28826415d6440f96841f66ca69f0de619e1ea3b0ec1c36bcf389"},"schema_version":"1.0","source":{"id":"2309.10310","kind":"arxiv","version":2}},"canonical_sha256":"64240ef62d21eb6fd016bdd485b9fd5045399171cf0c64bc953138e564e89a1f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"64240ef62d21eb6fd016bdd485b9fd5045399171cf0c64bc953138e564e89a1f","first_computed_at":"2026-07-05T06:52:26.519723Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:52:26.519723Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9CKUzPNppFQ7ZBfdN5YpEh7XZ4qYL++rrbx0S6wPuBJ1uvpZvndvp7szvQltdJkvLt18ck0sQhin+esp6q1mBw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:52:26.520193Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.10310","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44da498e3779f5390bce4f4d35a4c311954acf69d182098603eda65e323af838","sha256:06a63235774d71c87d9b548b06e03d2819d6737c55c0e7d0ce06a802e5096c39"],"state_sha256":"a53ed6c1fc194d4dc1d7ff81fa6d1b1b5ee061009b54bd03a06583cdc3caca32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LdLFdTTlGgEZxIiEBt6pGLF4L6afr9ZA9HzAHLJkyUPsnVX3w5J+a6iKEPxX4PlxVNrHHtlGu0AUcdUPc+HUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-11T08:00:27.564103Z","bundle_sha256":"a5624ac980018eeb3d81e21a5917d95da45b5e145d7550d318da6fd9e2f27cb7"}}