{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:SQE5VREHOCT25NTPKJBURHYNEE","short_pith_number":"pith:SQE5VREH","canonical_record":{"source":{"id":"2605.15507","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T01:05:28Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"a73725cf8b4253467ecb3e8bb0c42c3cdb672a95bbf2dcd0dcd0b234dfd2f528","abstract_canon_sha256":"2ff9d458b435b74982ddd2c6099c8f421333f0928c2a6b82a2e1cab6ae0f073c"},"schema_version":"1.0"},"canonical_sha256":"9409dac48770a7aeb66f5243489f0d210c00f457d7c1b188e047b704a1d2cb7a","source":{"kind":"arxiv","id":"2605.15507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15507","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15507v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15507","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"SQE5VREHOCT2","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"SQE5VREHOCT25NTP","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"SQE5VREH","created_at":"2026-05-20T00:01:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:SQE5VREHOCT25NTPKJBURHYNEE","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15507","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T01:05:28Z","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"title_canon_sha256":"a73725cf8b4253467ecb3e8bb0c42c3cdb672a95bbf2dcd0dcd0b234dfd2f528","abstract_canon_sha256":"2ff9d458b435b74982ddd2c6099c8f421333f0928c2a6b82a2e1cab6ae0f073c"},"schema_version":"1.0"},"canonical_sha256":"9409dac48770a7aeb66f5243489f0d210c00f457d7c1b188e047b704a1d2cb7a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:02.238839Z","signature_b64":"VhTF/kIFLAgKcI3CMaBCQrJ03+5MocQcGEF5EAv5YntHvvPClYZIOA1XamsG3buwQOVK2OTQYLy2RwMd4NqNAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9409dac48770a7aeb66f5243489f0d210c00f457d7c1b188e047b704a1d2cb7a","last_reissued_at":"2026-05-20T00:01:02.238040Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:02.238040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15507","source_version":1,"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-05-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q2t1QpppLOnhr2DEi6nkk101X9YSh9KQQe9QW1FTIaAgePreQFAlCml07eyo8MeQnVNHEej0o2a5k3fL7BYICQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:29:48.288437Z"},"content_sha256":"a739fb7e93eaaf335f5b49470c597a635163abc15de3351d831d65a471bdf078","schema_version":"1.0","event_id":"sha256:a739fb7e93eaaf335f5b49470c597a635163abc15de3351d831d65a471bdf078"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:SQE5VREHOCT25NTPKJBURHYNEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PrismQuant: Rate-Distortion-Optimal Vector Quantization for Gaussian-Mixture Sources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A single global reverse-waterfilling level governs the rate-distortion function for Gaussian-mixture sources.","cross_cats":["cs.AI","cs.LG","math.IT"],"primary_cat":"cs.IT","authors_text":"Bumsu Park, Chanho Park, Namyoon Lee, Youngmok Park","submitted_at":"2026-05-15T01:05:28Z","abstract_excerpt":"For a Gaussian source under mean-squared error (MSE), classical transform coding is rate--distortion (RD) optimal: the Karhunen--Loeve transform (KLT) diagonalizes the covariance, reverse waterfilling allocates the bits, and scalar quantization closes the loop. This elegant story breaks down for multimodal sources, where no single covariance can capture heterogeneous local geometries, and the RD function loses its closed form. We revisit this problem through Gaussian-mixture sources and develop a constructive RD theory for them. Our key finding is that the mixture structure incurs only a compo"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We prove that the genie-aided conditional RD function is governed by a single global reverse-waterfilling level shared across all components and eigenmodes. Building on this result, we introduce PrismQuant, which transmits the component label losslessly and encodes the residual using the component-matched KLT, followed by scalar quantization, achieving a rate of H(C)/n bits per source dimension of the converse, with a vanishing asymptotic gap.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The source is exactly a finite Gaussian mixture whose component label can be identified and transmitted losslessly at cost H(C)/n per dimension; the proof assumes a genie that reveals the active component before quantization begins.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"PrismQuant achieves near rate-distortion optimality for Gaussian-mixture sources by losslessly transmitting the mixture component label at H(C)/n bits per dimension and applying component-matched KLT plus scalar quantization, with vanishing gap to the genie-aided bound.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A single global reverse-waterfilling level governs the rate-distortion function for Gaussian-mixture sources.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"61e1c1b2ab50837bc0820b36b4f39a949cbb9b69639f377b44e6b9a3601d439d"},"source":{"id":"2605.15507","kind":"arxiv","version":1},"verdict":{"id":"f11fb69a-0315-456e-8ab9-893b7232599d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:16:10.431011Z","strongest_claim":"We prove that the genie-aided conditional RD function is governed by a single global reverse-waterfilling level shared across all components and eigenmodes. Building on this result, we introduce PrismQuant, which transmits the component label losslessly and encodes the residual using the component-matched KLT, followed by scalar quantization, achieving a rate of H(C)/n bits per source dimension of the converse, with a vanishing asymptotic gap.","one_line_summary":"PrismQuant achieves near rate-distortion optimality for Gaussian-mixture sources by losslessly transmitting the mixture component label at H(C)/n bits per dimension and applying component-matched KLT plus scalar quantization, with vanishing gap to the genie-aided bound.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The source is exactly a finite Gaussian mixture whose component label can be identified and transmitted losslessly at cost H(C)/n per dimension; the proof assumes a genie that reveals the active component before quantization begins.","pith_extraction_headline":"A single global reverse-waterfilling level governs the rate-distortion function for Gaussian-mixture sources."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15507/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.716574Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T15:30:38.158746Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:55.370115Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.058560Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.850742Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.389650Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.637371Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8e8c70375ef41b639924c78539ad677179e0f820b34f8be4236ed58eda6b3abd"},"references":{"count":40,"sample":[{"doi":"","year":1959,"title":"Claude E. Shannon. Coding theorems for a discrete source with a fidelity criterion.IRE National Convention Record, 7(4):142–163, 1959","work_id":"cec3ccab-c871-4607-ba3e-086ba6e4ffaf","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1971,"title":"Prentice-Hall, Englewood Cliffs, NJ, 1971","work_id":"4849ab3d-5cc0-4f7f-8893-44b1dfef7bfb","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Cover and Joy A","work_id":"e92f861e-40d2-4e84-a7b0-5fdbb15e24ad","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2001,"title":"Vivek K. Goyal. Theoretical foundations of transform coding.IEEE Signal Procesing Magazine, 18(5): 9–21, 2001","work_id":"fbe02aaa-3cba-4292-a55d-7100ea393d12","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Bishop.Pattern recognition and machine learning","work_id":"b4736899-5588-4df7-9726-b79de7d1791e","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":40,"snapshot_sha256":"5bec0a91beeb1ded365b4578259ca8e27f4587547030c4a6ad3792242d961c19","internal_anchors":1},"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":"f11fb69a-0315-456e-8ab9-893b7232599d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F55+OjBFDLeyzR5GxiWBeShAIR7C1NkhT1XpM4KkL7woHOefjQYAXM68RjFMfajAeFXGJeTrZUpTVdUT36mSAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T23:29:48.289582Z"},"content_sha256":"0d146d9f0ab1c3ba938384530013b483a8851cbedc47897c5d1b8cc9f13a1760","schema_version":"1.0","event_id":"sha256:0d146d9f0ab1c3ba938384530013b483a8851cbedc47897c5d1b8cc9f13a1760"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQE5VREHOCT25NTPKJBURHYNEE/bundle.json","state_url":"https://pith.science/pith/SQE5VREHOCT25NTPKJBURHYNEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQE5VREHOCT25NTPKJBURHYNEE/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-05-20T23:29:48Z","links":{"resolver":"https://pith.science/pith/SQE5VREHOCT25NTPKJBURHYNEE","bundle":"https://pith.science/pith/SQE5VREHOCT25NTPKJBURHYNEE/bundle.json","state":"https://pith.science/pith/SQE5VREHOCT25NTPKJBURHYNEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQE5VREHOCT25NTPKJBURHYNEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:SQE5VREHOCT25NTPKJBURHYNEE","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":"2ff9d458b435b74982ddd2c6099c8f421333f0928c2a6b82a2e1cab6ae0f073c","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T01:05:28Z","title_canon_sha256":"a73725cf8b4253467ecb3e8bb0c42c3cdb672a95bbf2dcd0dcd0b234dfd2f528"},"schema_version":"1.0","source":{"id":"2605.15507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15507","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15507v1","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15507","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_12","alias_value":"SQE5VREHOCT2","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_16","alias_value":"SQE5VREHOCT25NTP","created_at":"2026-05-20T00:01:02Z"},{"alias_kind":"pith_short_8","alias_value":"SQE5VREH","created_at":"2026-05-20T00:01:02Z"}],"graph_snapshots":[{"event_id":"sha256:0d146d9f0ab1c3ba938384530013b483a8851cbedc47897c5d1b8cc9f13a1760","target":"graph","created_at":"2026-05-20T00:01:02Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We prove that the genie-aided conditional RD function is governed by a single global reverse-waterfilling level shared across all components and eigenmodes. Building on this result, we introduce PrismQuant, which transmits the component label losslessly and encodes the residual using the component-matched KLT, followed by scalar quantization, achieving a rate of H(C)/n bits per source dimension of the converse, with a vanishing asymptotic gap."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The source is exactly a finite Gaussian mixture whose component label can be identified and transmitted losslessly at cost H(C)/n per dimension; the proof assumes a genie that reveals the active component before quantization begins."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"PrismQuant achieves near rate-distortion optimality for Gaussian-mixture sources by losslessly transmitting the mixture component label at H(C)/n bits per dimension and applying component-matched KLT plus scalar quantization, with vanishing gap to the genie-aided bound."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A single global reverse-waterfilling level governs the rate-distortion function for Gaussian-mixture sources."}],"snapshot_sha256":"61e1c1b2ab50837bc0820b36b4f39a949cbb9b69639f377b44e6b9a3601d439d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:31:17.716574Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T15:30:38.158746Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:55.370115Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.058560Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"shingle_duplication","ran_at":"2026-05-19T13:49:41.850742Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.389650Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.637371Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15507/integrity.json","findings":[],"snapshot_sha256":"8e8c70375ef41b639924c78539ad677179e0f820b34f8be4236ed58eda6b3abd","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"For a Gaussian source under mean-squared error (MSE), classical transform coding is rate--distortion (RD) optimal: the Karhunen--Loeve transform (KLT) diagonalizes the covariance, reverse waterfilling allocates the bits, and scalar quantization closes the loop. This elegant story breaks down for multimodal sources, where no single covariance can capture heterogeneous local geometries, and the RD function loses its closed form. We revisit this problem through Gaussian-mixture sources and develop a constructive RD theory for them. Our key finding is that the mixture structure incurs only a compo","authors_text":"Bumsu Park, Chanho Park, Namyoon Lee, Youngmok Park","cross_cats":["cs.AI","cs.LG","math.IT"],"headline":"A single global reverse-waterfilling level governs the rate-distortion function for Gaussian-mixture sources.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T01:05:28Z","title":"PrismQuant: Rate-Distortion-Optimal Vector Quantization for Gaussian-Mixture Sources"},"references":{"count":40,"internal_anchors":1,"resolved_work":40,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Claude E. Shannon. Coding theorems for a discrete source with a fidelity criterion.IRE National Convention Record, 7(4):142–163, 1959","work_id":"cec3ccab-c871-4607-ba3e-086ba6e4ffaf","year":1959},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Prentice-Hall, Englewood Cliffs, NJ, 1971","work_id":"4849ab3d-5cc0-4f7f-8893-44b1dfef7bfb","year":1971},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Cover and Joy A","work_id":"e92f861e-40d2-4e84-a7b0-5fdbb15e24ad","year":2006},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Vivek K. Goyal. Theoretical foundations of transform coding.IEEE Signal Procesing Magazine, 18(5): 9–21, 2001","work_id":"fbe02aaa-3cba-4292-a55d-7100ea393d12","year":2001},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Bishop.Pattern recognition and machine learning","work_id":"b4736899-5588-4df7-9726-b79de7d1791e","year":2006}],"snapshot_sha256":"5bec0a91beeb1ded365b4578259ca8e27f4587547030c4a6ad3792242d961c19"},"source":{"id":"2605.15507","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:16:10.431011Z","id":"f11fb69a-0315-456e-8ab9-893b7232599d","model_set":{"reader":"grok-4.3"},"one_line_summary":"PrismQuant achieves near rate-distortion optimality for Gaussian-mixture sources by losslessly transmitting the mixture component label at H(C)/n bits per dimension and applying component-matched KLT plus scalar quantization, with vanishing gap to the genie-aided bound.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A single global reverse-waterfilling level governs the rate-distortion function for Gaussian-mixture sources.","strongest_claim":"We prove that the genie-aided conditional RD function is governed by a single global reverse-waterfilling level shared across all components and eigenmodes. Building on this result, we introduce PrismQuant, which transmits the component label losslessly and encodes the residual using the component-matched KLT, followed by scalar quantization, achieving a rate of H(C)/n bits per source dimension of the converse, with a vanishing asymptotic gap.","weakest_assumption":"The source is exactly a finite Gaussian mixture whose component label can be identified and transmitted losslessly at cost H(C)/n per dimension; the proof assumes a genie that reveals the active component before quantization begins."}},"verdict_id":"f11fb69a-0315-456e-8ab9-893b7232599d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a739fb7e93eaaf335f5b49470c597a635163abc15de3351d831d65a471bdf078","target":"record","created_at":"2026-05-20T00:01:02Z","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":"2ff9d458b435b74982ddd2c6099c8f421333f0928c2a6b82a2e1cab6ae0f073c","cross_cats_sorted":["cs.AI","cs.LG","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IT","submitted_at":"2026-05-15T01:05:28Z","title_canon_sha256":"a73725cf8b4253467ecb3e8bb0c42c3cdb672a95bbf2dcd0dcd0b234dfd2f528"},"schema_version":"1.0","source":{"id":"2605.15507","kind":"arxiv","version":1}},"canonical_sha256":"9409dac48770a7aeb66f5243489f0d210c00f457d7c1b188e047b704a1d2cb7a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9409dac48770a7aeb66f5243489f0d210c00f457d7c1b188e047b704a1d2cb7a","first_computed_at":"2026-05-20T00:01:02.238040Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:02.238040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VhTF/kIFLAgKcI3CMaBCQrJ03+5MocQcGEF5EAv5YntHvvPClYZIOA1XamsG3buwQOVK2OTQYLy2RwMd4NqNAg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:02.238839Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a739fb7e93eaaf335f5b49470c597a635163abc15de3351d831d65a471bdf078","sha256:0d146d9f0ab1c3ba938384530013b483a8851cbedc47897c5d1b8cc9f13a1760"],"state_sha256":"53294c0eb32f3651d6c036e5b6b8a18e28da7802cb70db6798433ffeff7f7559"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fWfXwZ1x42IT6+/aKWTjtL3H9QsCQemMyI8xXCnUk2IEV2Gg+l3P9ahzKlR8G2JhJxr9UB/UYyGqqppdi0vQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T23:29:48.293531Z","bundle_sha256":"85033e07299e83b4fb6e3f76b3f516d8081b35cbcab952afdd27e6d393fd329f"}}