{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6GRIPU2LWTGFWEE2NH4NPVKDEM","short_pith_number":"pith:6GRIPU2L","canonical_record":{"source":{"id":"1511.01442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-04T19:17:18Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0c49e8d6d13210851650f507a6dfb42b46314789ccf08f2e00537594f60ebefb","abstract_canon_sha256":"e18ee9942d0e831631ac1f304e26554d4bebedad65a1486afd71a8deb28ee3c6"},"schema_version":"1.0"},"canonical_sha256":"f1a287d34bb4cc5b109a69f8d7d54323240181835220e38f76583c4ffb9df18e","source":{"kind":"arxiv","id":"1511.01442","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01442","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01442v2","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01442","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"6GRIPU2LWTGF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6GRIPU2LWTGFWEE2","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6GRIPU2L","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6GRIPU2LWTGFWEE2NH4NPVKDEM","target":"record","payload":{"canonical_record":{"source":{"id":"1511.01442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-04T19:17:18Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"0c49e8d6d13210851650f507a6dfb42b46314789ccf08f2e00537594f60ebefb","abstract_canon_sha256":"e18ee9942d0e831631ac1f304e26554d4bebedad65a1486afd71a8deb28ee3c6"},"schema_version":"1.0"},"canonical_sha256":"f1a287d34bb4cc5b109a69f8d7d54323240181835220e38f76583c4ffb9df18e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:48.150344Z","signature_b64":"c1saDITEgZJqTi0rGzlw+2VOkMHSy9UTU0C6Jn6zsgEGmVmcIGVwR4rkeWkV7Ee3JUQjaTwNLhOqGevxhVmKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1a287d34bb4cc5b109a69f8d7d54323240181835220e38f76583c4ffb9df18e","last_reissued_at":"2026-05-18T01:23:48.149611Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:48.149611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.01442","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-05-18T01:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AtDlKNinZlZm87xoLRgeVQB5W6OEVhLUCtZbkvVQYsf5tJyR8fJJFa0qMIlMDJBXjBXJiHXSWTunpNXn6rQeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:46:01.543783Z"},"content_sha256":"90d335340022dbc7981f95714e83b9b3a7e33d90c50ac17a9b4656317887e52b","schema_version":"1.0","event_id":"sha256:90d335340022dbc7981f95714e83b9b3a7e33d90c50ac17a9b4656317887e52b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6GRIPU2LWTGFWEE2NH4NPVKDEM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Low-Rank Approximation of Weighted Tree Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LG","authors_text":"Borja Balle, Guillaume Rabusseau, Shay B. Cohen","submitted_at":"2015-11-04T19:17:18Z","abstract_excerpt":"We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and latent-variable PCFGs. Our method relies on a singular value decomposition of the underlying Hankel matrix defined by the WTA. Our main theoretical result is an efficient algorithm for computing the SVD of an infinite Hankel matrix implicitly represented as a WTA. We provide an analysis of the approximation error induced by the minimization, and we evaluate our method on real-world data originating in newswire treebank. We show that the model ach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01442","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":""},"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-05-18T01:23:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v0RNz5ztmYV7PGlRXwypj5U0cgLAO09JCzo/OyghY3bAAgIIQac0XgcVVQtHqxgr3EWRFiFuK04faFKmbt1qAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:46:01.544134Z"},"content_sha256":"bca4aefa4ee155cc661c1dfa9f0fa945a7da06216620cd3b2d8f118edc8e1098","schema_version":"1.0","event_id":"sha256:bca4aefa4ee155cc661c1dfa9f0fa945a7da06216620cd3b2d8f118edc8e1098"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6GRIPU2LWTGFWEE2NH4NPVKDEM/bundle.json","state_url":"https://pith.science/pith/6GRIPU2LWTGFWEE2NH4NPVKDEM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6GRIPU2LWTGFWEE2NH4NPVKDEM/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-30T09:46:01Z","links":{"resolver":"https://pith.science/pith/6GRIPU2LWTGFWEE2NH4NPVKDEM","bundle":"https://pith.science/pith/6GRIPU2LWTGFWEE2NH4NPVKDEM/bundle.json","state":"https://pith.science/pith/6GRIPU2LWTGFWEE2NH4NPVKDEM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6GRIPU2LWTGFWEE2NH4NPVKDEM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6GRIPU2LWTGFWEE2NH4NPVKDEM","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":"e18ee9942d0e831631ac1f304e26554d4bebedad65a1486afd71a8deb28ee3c6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-04T19:17:18Z","title_canon_sha256":"0c49e8d6d13210851650f507a6dfb42b46314789ccf08f2e00537594f60ebefb"},"schema_version":"1.0","source":{"id":"1511.01442","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.01442","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"arxiv_version","alias_value":"1511.01442v2","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.01442","created_at":"2026-05-18T01:23:48Z"},{"alias_kind":"pith_short_12","alias_value":"6GRIPU2LWTGF","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6GRIPU2LWTGFWEE2","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6GRIPU2L","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:bca4aefa4ee155cc661c1dfa9f0fa945a7da06216620cd3b2d8f118edc8e1098","target":"graph","created_at":"2026-05-18T01:23:48Z","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"},"paper":{"abstract_excerpt":"We describe a technique to minimize weighted tree automata (WTA), a powerful formalisms that subsumes probabilistic context-free grammars (PCFGs) and latent-variable PCFGs. Our method relies on a singular value decomposition of the underlying Hankel matrix defined by the WTA. Our main theoretical result is an efficient algorithm for computing the SVD of an infinite Hankel matrix implicitly represented as a WTA. We provide an analysis of the approximation error induced by the minimization, and we evaluate our method on real-world data originating in newswire treebank. We show that the model ach","authors_text":"Borja Balle, Guillaume Rabusseau, Shay B. Cohen","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-04T19:17:18Z","title":"Low-Rank Approximation of Weighted Tree Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.01442","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:90d335340022dbc7981f95714e83b9b3a7e33d90c50ac17a9b4656317887e52b","target":"record","created_at":"2026-05-18T01:23:48Z","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":"e18ee9942d0e831631ac1f304e26554d4bebedad65a1486afd71a8deb28ee3c6","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-11-04T19:17:18Z","title_canon_sha256":"0c49e8d6d13210851650f507a6dfb42b46314789ccf08f2e00537594f60ebefb"},"schema_version":"1.0","source":{"id":"1511.01442","kind":"arxiv","version":2}},"canonical_sha256":"f1a287d34bb4cc5b109a69f8d7d54323240181835220e38f76583c4ffb9df18e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f1a287d34bb4cc5b109a69f8d7d54323240181835220e38f76583c4ffb9df18e","first_computed_at":"2026-05-18T01:23:48.149611Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:48.149611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c1saDITEgZJqTi0rGzlw+2VOkMHSy9UTU0C6Jn6zsgEGmVmcIGVwR4rkeWkV7Ee3JUQjaTwNLhOqGevxhVmKBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:48.150344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.01442","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90d335340022dbc7981f95714e83b9b3a7e33d90c50ac17a9b4656317887e52b","sha256:bca4aefa4ee155cc661c1dfa9f0fa945a7da06216620cd3b2d8f118edc8e1098"],"state_sha256":"864fa2fbadb97f8156a042cab0680dcd5beb80cc71899e10af554d1a8bb7834d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4h6Y+Kf9rrBSHWQq+jS2SZBGdw6/jEoh2b1S2KZC9B6IpA66LnXSuldMhAovRbJXtnyxf2IJ60qwvfAljmy3CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:46:01.546309Z","bundle_sha256":"2d5631a4c3a9e8e19d10f52a44076cd75c52c53a4270844e0ef86abda37a1dc4"}}