{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:AFHKDYOFBCFRX7YB6DVYPJH6XN","short_pith_number":"pith:AFHKDYOF","canonical_record":{"source":{"id":"2102.06860","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-02-13T04:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"26ca6d87f41846e3f4117cc8fd27a0f0f703fb490bf22ce0ac7fbbfdfb6119a3","abstract_canon_sha256":"83444bffc3ea8608a843724cb26daf39e08413f002cab9de7fd4b7e108765193"},"schema_version":"1.0"},"canonical_sha256":"014ea1e1c5088b1bff01f0eb87a4febb55efec46524b56f5622e7e5e7373bebc","source":{"kind":"arxiv","id":"2102.06860","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.06860","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"arxiv_version","alias_value":"2102.06860v3","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06860","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"pith_short_12","alias_value":"AFHKDYOFBCFR","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"pith_short_16","alias_value":"AFHKDYOFBCFRX7YB","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"pith_short_8","alias_value":"AFHKDYOF","created_at":"2026-07-05T02:40:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:AFHKDYOFBCFRX7YB6DVYPJH6XN","target":"record","payload":{"canonical_record":{"source":{"id":"2102.06860","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-02-13T04:54:46Z","cross_cats_sorted":[],"title_canon_sha256":"26ca6d87f41846e3f4117cc8fd27a0f0f703fb490bf22ce0ac7fbbfdfb6119a3","abstract_canon_sha256":"83444bffc3ea8608a843724cb26daf39e08413f002cab9de7fd4b7e108765193"},"schema_version":"1.0"},"canonical_sha256":"014ea1e1c5088b1bff01f0eb87a4febb55efec46524b56f5622e7e5e7373bebc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:40:32.181852Z","signature_b64":"ZlCcjnEVUZC6YKdvXwPBfv0lbxRiPK8iwIZRdEnHA7n+5yZV/Z8+OMvhCXKE4EMpc9TS4DoxUAZimcLpk5ZOAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"014ea1e1c5088b1bff01f0eb87a4febb55efec46524b56f5622e7e5e7373bebc","last_reissued_at":"2026-07-05T02:40:32.181475Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:40:32.181475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2102.06860","source_version":3,"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-05T02:40:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UO9D4b1oPEMDjZCDrDwysXXHrXKDiEW+8v/X5I34r8HkcvJzbaoVbjkJaYnPhPbqHBk/xPwX79ZkqH7ppojPCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:40:44.974347Z"},"content_sha256":"c25f17279e4beface71f4a9932ae8152380bdaace59d304bb021653ca1c73df7","schema_version":"1.0","event_id":"sha256:c25f17279e4beface71f4a9932ae8152380bdaace59d304bb021653ca1c73df7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:AFHKDYOFBCFRX7YB6DVYPJH6XN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Borja Balle, Clara Lacroce, Doina Precup, Guillaume Rabusseau, Prakash Panangaden","submitted_at":"2021-02-13T04:54:46Z","abstract_excerpt":"We address the approximate minimization problem for weighted finite automata (WFAs) with weights in $\\mathbb{R}$, over a one-letter alphabet: to compute the best possible approximation of a WFA given a bound on the number of states. This work is grounded in Adamyan-Arov-Krein Approximation theory, a remarkable collection of results on the approximation of Hankel operators. In addition to its intrinsic mathematical relevance, this theory has proven to be very effective for model reduction. We adapt these results to the framework of weighted automata over a one-letter alphabet. We provide theore"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06860","kind":"arxiv","version":3},"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/2102.06860/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-05T02:40:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3/eHsdqeQH07ZYCyEmMEcAHrKi1U3HCVLrOaToqgsgB66jIFLxX4+SSnpLT/sSX5xXqQCRd6t0PhSjTrN/yRDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T15:40:44.974826Z"},"content_sha256":"014f8be41a622202e43ea660c067a61fb28ff73798c91ab612f469253b0b64c5","schema_version":"1.0","event_id":"sha256:014f8be41a622202e43ea660c067a61fb28ff73798c91ab612f469253b0b64c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AFHKDYOFBCFRX7YB6DVYPJH6XN/bundle.json","state_url":"https://pith.science/pith/AFHKDYOFBCFRX7YB6DVYPJH6XN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AFHKDYOFBCFRX7YB6DVYPJH6XN/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-04T15:40:44Z","links":{"resolver":"https://pith.science/pith/AFHKDYOFBCFRX7YB6DVYPJH6XN","bundle":"https://pith.science/pith/AFHKDYOFBCFRX7YB6DVYPJH6XN/bundle.json","state":"https://pith.science/pith/AFHKDYOFBCFRX7YB6DVYPJH6XN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AFHKDYOFBCFRX7YB6DVYPJH6XN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:AFHKDYOFBCFRX7YB6DVYPJH6XN","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":"83444bffc3ea8608a843724cb26daf39e08413f002cab9de7fd4b7e108765193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-02-13T04:54:46Z","title_canon_sha256":"26ca6d87f41846e3f4117cc8fd27a0f0f703fb490bf22ce0ac7fbbfdfb6119a3"},"schema_version":"1.0","source":{"id":"2102.06860","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2102.06860","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"arxiv_version","alias_value":"2102.06860v3","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.06860","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"pith_short_12","alias_value":"AFHKDYOFBCFR","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"pith_short_16","alias_value":"AFHKDYOFBCFRX7YB","created_at":"2026-07-05T02:40:32Z"},{"alias_kind":"pith_short_8","alias_value":"AFHKDYOF","created_at":"2026-07-05T02:40:32Z"}],"graph_snapshots":[{"event_id":"sha256:014f8be41a622202e43ea660c067a61fb28ff73798c91ab612f469253b0b64c5","target":"graph","created_at":"2026-07-05T02:40:32Z","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/2102.06860/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We address the approximate minimization problem for weighted finite automata (WFAs) with weights in $\\mathbb{R}$, over a one-letter alphabet: to compute the best possible approximation of a WFA given a bound on the number of states. This work is grounded in Adamyan-Arov-Krein Approximation theory, a remarkable collection of results on the approximation of Hankel operators. In addition to its intrinsic mathematical relevance, this theory has proven to be very effective for model reduction. We adapt these results to the framework of weighted automata over a one-letter alphabet. We provide theore","authors_text":"Borja Balle, Clara Lacroce, Doina Precup, Guillaume Rabusseau, Prakash Panangaden","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-02-13T04:54:46Z","title":"Optimal Spectral-Norm Approximate Minimization of Weighted Finite Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.06860","kind":"arxiv","version":3},"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:c25f17279e4beface71f4a9932ae8152380bdaace59d304bb021653ca1c73df7","target":"record","created_at":"2026-07-05T02:40:32Z","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":"83444bffc3ea8608a843724cb26daf39e08413f002cab9de7fd4b7e108765193","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2021-02-13T04:54:46Z","title_canon_sha256":"26ca6d87f41846e3f4117cc8fd27a0f0f703fb490bf22ce0ac7fbbfdfb6119a3"},"schema_version":"1.0","source":{"id":"2102.06860","kind":"arxiv","version":3}},"canonical_sha256":"014ea1e1c5088b1bff01f0eb87a4febb55efec46524b56f5622e7e5e7373bebc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"014ea1e1c5088b1bff01f0eb87a4febb55efec46524b56f5622e7e5e7373bebc","first_computed_at":"2026-07-05T02:40:32.181475Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:40:32.181475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZlCcjnEVUZC6YKdvXwPBfv0lbxRiPK8iwIZRdEnHA7n+5yZV/Z8+OMvhCXKE4EMpc9TS4DoxUAZimcLpk5ZOAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:40:32.181852Z","signed_message":"canonical_sha256_bytes"},"source_id":"2102.06860","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c25f17279e4beface71f4a9932ae8152380bdaace59d304bb021653ca1c73df7","sha256:014f8be41a622202e43ea660c067a61fb28ff73798c91ab612f469253b0b64c5"],"state_sha256":"a23c59bc56a19837523d6f4dd0af5096d0ffab5c97ba366955d37afd749a29df"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okfjCRE5yGXl3pLegJJCFFv4UaHEvsMmxPZNPUKeQY38tO4zS9p9caDan7NzHmwJhqu36qbLDOqWPGIPr+/KCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T15:40:44.978404Z","bundle_sha256":"6e5a2ccbeba7a55e7496e0fa8945e7d1a0d88a4e774b3622ec4113e06190f6b0"}}