{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:DCEXL2GB7H7WPMI6XK432RZTOO","short_pith_number":"pith:DCEXL2GB","canonical_record":{"source":{"id":"2206.00172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2022-06-01T01:24:21Z","cross_cats_sorted":[],"title_canon_sha256":"e4cb07177bf9f14a130e816bd060b877fca120cfd51f71b36c6c3e15c10f5a6e","abstract_canon_sha256":"4a927672aec77e958488a533c8021c85356c34541ba2eeff78ad32b93d0e6993"},"schema_version":"1.0"},"canonical_sha256":"188975e8c1f9ff67b11ebab9bd473373b52e9c890e9f5f4c73ace711b16b5dbd","source":{"kind":"arxiv","id":"2206.00172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.00172","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"arxiv_version","alias_value":"2206.00172v1","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00172","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"pith_short_12","alias_value":"DCEXL2GB7H7W","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"pith_short_16","alias_value":"DCEXL2GB7H7WPMI6","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"pith_short_8","alias_value":"DCEXL2GB","created_at":"2026-07-05T04:28:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:DCEXL2GB7H7WPMI6XK432RZTOO","target":"record","payload":{"canonical_record":{"source":{"id":"2206.00172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2022-06-01T01:24:21Z","cross_cats_sorted":[],"title_canon_sha256":"e4cb07177bf9f14a130e816bd060b877fca120cfd51f71b36c6c3e15c10f5a6e","abstract_canon_sha256":"4a927672aec77e958488a533c8021c85356c34541ba2eeff78ad32b93d0e6993"},"schema_version":"1.0"},"canonical_sha256":"188975e8c1f9ff67b11ebab9bd473373b52e9c890e9f5f4c73ace711b16b5dbd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:13.767377Z","signature_b64":"NhxCrNFURu3QuOuDsQOIf4wNVaeuDye4ui1Vemr/uEfu8tGa4RBRTnwQe7QcJY5d+kiB6JXkD8YBjwqeCwNrCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"188975e8c1f9ff67b11ebab9bd473373b52e9c890e9f5f4c73ace711b16b5dbd","last_reissued_at":"2026-07-05T04:28:13.767006Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:13.767006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.00172","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-07-05T04:28:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P5X6NnsyOlB1EKqckhumHu13BILoY+5d2CixIXU71zgtWrLxbtAgysSZ1bTFsszREf2jzk+l6jn2CpZxOhMvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:29:43.362430Z"},"content_sha256":"398c2935300f066808e7d3b75a4fed86e61ccdc739dbe9dda464e438f2bedadf","schema_version":"1.0","event_id":"sha256:398c2935300f066808e7d3b75a4fed86e61ccdc739dbe9dda464e438f2bedadf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:DCEXL2GB7H7WPMI6XK432RZTOO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Towards an AAK Theory Approach to Approximate Minimization in the Multi-Letter Case","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Clara Lacroce, Guillaume Rabusseau, Prakash Panangaden","submitted_at":"2022-06-01T01:24:21Z","abstract_excerpt":"We study the approximate minimization problem of weighted finite automata (WFAs): given a WFA, we want to compute its optimal approximation when restricted to a given size. We reformulate the problem as a rank-minimization task in the spectral norm, and propose a framework to apply Adamyan-Arov-Krein (AAK) theory to the approximation problem. This approach has already been successfully applied to the case of WFAs and language modelling black boxes over one-letter alphabets \\citep{AAK-WFA,AAK-RNN}. Extending the result to multi-letter alphabets requires solving the following two steps. First, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00172","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/2206.00172/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-05T04:28:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oe9Uvr45/7S04XEi4yyvH23PelnSyhbOpXzBPMZEXSdbYVgU9B/MNEkyP7uHpiRUwuBLDFYAOGbagtEci4erBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T20:29:43.362934Z"},"content_sha256":"dbc18970a78666b08a32e0bfe358fbd5b1655dd8779b5633f2d06c2cbe557674","schema_version":"1.0","event_id":"sha256:dbc18970a78666b08a32e0bfe358fbd5b1655dd8779b5633f2d06c2cbe557674"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DCEXL2GB7H7WPMI6XK432RZTOO/bundle.json","state_url":"https://pith.science/pith/DCEXL2GB7H7WPMI6XK432RZTOO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DCEXL2GB7H7WPMI6XK432RZTOO/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-19T20:29:43Z","links":{"resolver":"https://pith.science/pith/DCEXL2GB7H7WPMI6XK432RZTOO","bundle":"https://pith.science/pith/DCEXL2GB7H7WPMI6XK432RZTOO/bundle.json","state":"https://pith.science/pith/DCEXL2GB7H7WPMI6XK432RZTOO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DCEXL2GB7H7WPMI6XK432RZTOO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:DCEXL2GB7H7WPMI6XK432RZTOO","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":"4a927672aec77e958488a533c8021c85356c34541ba2eeff78ad32b93d0e6993","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2022-06-01T01:24:21Z","title_canon_sha256":"e4cb07177bf9f14a130e816bd060b877fca120cfd51f71b36c6c3e15c10f5a6e"},"schema_version":"1.0","source":{"id":"2206.00172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.00172","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"arxiv_version","alias_value":"2206.00172v1","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.00172","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"pith_short_12","alias_value":"DCEXL2GB7H7W","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"pith_short_16","alias_value":"DCEXL2GB7H7WPMI6","created_at":"2026-07-05T04:28:13Z"},{"alias_kind":"pith_short_8","alias_value":"DCEXL2GB","created_at":"2026-07-05T04:28:13Z"}],"graph_snapshots":[{"event_id":"sha256:dbc18970a78666b08a32e0bfe358fbd5b1655dd8779b5633f2d06c2cbe557674","target":"graph","created_at":"2026-07-05T04:28:13Z","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/2206.00172/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the approximate minimization problem of weighted finite automata (WFAs): given a WFA, we want to compute its optimal approximation when restricted to a given size. We reformulate the problem as a rank-minimization task in the spectral norm, and propose a framework to apply Adamyan-Arov-Krein (AAK) theory to the approximation problem. This approach has already been successfully applied to the case of WFAs and language modelling black boxes over one-letter alphabets \\citep{AAK-WFA,AAK-RNN}. Extending the result to multi-letter alphabets requires solving the following two steps. First, w","authors_text":"Clara Lacroce, Guillaume Rabusseau, Prakash Panangaden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2022-06-01T01:24:21Z","title":"Towards an AAK Theory Approach to Approximate Minimization in the Multi-Letter Case"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.00172","kind":"arxiv","version":1},"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:398c2935300f066808e7d3b75a4fed86e61ccdc739dbe9dda464e438f2bedadf","target":"record","created_at":"2026-07-05T04:28:13Z","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":"4a927672aec77e958488a533c8021c85356c34541ba2eeff78ad32b93d0e6993","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2022-06-01T01:24:21Z","title_canon_sha256":"e4cb07177bf9f14a130e816bd060b877fca120cfd51f71b36c6c3e15c10f5a6e"},"schema_version":"1.0","source":{"id":"2206.00172","kind":"arxiv","version":1}},"canonical_sha256":"188975e8c1f9ff67b11ebab9bd473373b52e9c890e9f5f4c73ace711b16b5dbd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"188975e8c1f9ff67b11ebab9bd473373b52e9c890e9f5f4c73ace711b16b5dbd","first_computed_at":"2026-07-05T04:28:13.767006Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:28:13.767006Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NhxCrNFURu3QuOuDsQOIf4wNVaeuDye4ui1Vemr/uEfu8tGa4RBRTnwQe7QcJY5d+kiB6JXkD8YBjwqeCwNrCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:28:13.767377Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.00172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:398c2935300f066808e7d3b75a4fed86e61ccdc739dbe9dda464e438f2bedadf","sha256:dbc18970a78666b08a32e0bfe358fbd5b1655dd8779b5633f2d06c2cbe557674"],"state_sha256":"d0dde766b2fbe4695cc81ecca409a1b6e517041f58b83b778c7cf9ad7986e9e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0mBYTSSCR5hGdUyBflzN+qeEekHvKUUHQViD4yTJndPR6XHVgjnJWJ+zzrxLAvQBM6ZjD6vuEABGj9Rp49e8Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T20:29:43.367654Z","bundle_sha256":"10a0b5502a9ecdf29986b0c66d5479d276e4cf76a3ff30a92c69fde355c1824c"}}