{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:2LFZ3JK4HBCWKEYBEAMJZTDPB2","short_pith_number":"pith:2LFZ3JK4","canonical_record":{"source":{"id":"1605.01530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-05T08:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"ba929738a8bdac1911fe468c676901dba334d53704185451b98448354ec9a862","abstract_canon_sha256":"6bd423241146da2162b32542aeb600813c5c244125c12a8cdbb6bcdb7a173fa5"},"schema_version":"1.0"},"canonical_sha256":"d2cb9da55c384565130120189ccc6f0e895293b024a306a6389ba46c3843c750","source":{"kind":"arxiv","id":"1605.01530","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01530","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01530v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01530","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"2LFZ3JK4HBCW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2LFZ3JK4HBCWKEYB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2LFZ3JK4","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:2LFZ3JK4HBCWKEYBEAMJZTDPB2","target":"record","payload":{"canonical_record":{"source":{"id":"1605.01530","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-05T08:50:48Z","cross_cats_sorted":[],"title_canon_sha256":"ba929738a8bdac1911fe468c676901dba334d53704185451b98448354ec9a862","abstract_canon_sha256":"6bd423241146da2162b32542aeb600813c5c244125c12a8cdbb6bcdb7a173fa5"},"schema_version":"1.0"},"canonical_sha256":"d2cb9da55c384565130120189ccc6f0e895293b024a306a6389ba46c3843c750","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:33.435999Z","signature_b64":"ozUFmea2xUC9BZtzMAxxJWBa/dnkii1SToBgJJNSi3qDB7nKdHDcRLcAPAS5c6sM9/WzIML1SwReQZwn8inYCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2cb9da55c384565130120189ccc6f0e895293b024a306a6389ba46c3843c750","last_reissued_at":"2026-05-18T01:15:33.435377Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:33.435377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.01530","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-18T01:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HoaUraRVa9n0fubn1wGcN9icBccMOUHBn0B+sh4IF3IgIHBX1HRjViegdwQ1SebRFdHQTSIVqMXQV7mjNbDsDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:53:58.042937Z"},"content_sha256":"28f7ac15f8e5293d3aaef97350d07079d5bfdce1eaaecb4e6e96508d1643eeb8","schema_version":"1.0","event_id":"sha256:28f7ac15f8e5293d3aaef97350d07079d5bfdce1eaaecb4e6e96508d1643eeb8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:2LFZ3JK4HBCWKEYBEAMJZTDPB2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Derived-term Automata for Extended Weighted Rational Expressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Akim Demaille","submitted_at":"2016-05-05T08:50:48Z","abstract_excerpt":"We present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational expansions. We introduce an inductive algorithm to compute the expansion of an expression from which the automaton follows. This algorithm is independent of the size of the alphabet, and actually even supports infinite alphabets. It can easily be accommodated to generate deterministic (weighted) automata. These constructs are implemented in Vcsn, a free-software"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01530","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":""},"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:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2Y1G/vHvHK28JXrxzGKslqo150nJ7ixT8PkWXiQu0Hyt/eD2GPfNMUht93LEHnIDm5gRWErGVVhyLt/p7Lt0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T05:53:58.043284Z"},"content_sha256":"65676780bf54999c6c497ffc1056dc47b943512043d53ee57f8509f8593007fe","schema_version":"1.0","event_id":"sha256:65676780bf54999c6c497ffc1056dc47b943512043d53ee57f8509f8593007fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LFZ3JK4HBCWKEYBEAMJZTDPB2/bundle.json","state_url":"https://pith.science/pith/2LFZ3JK4HBCWKEYBEAMJZTDPB2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LFZ3JK4HBCWKEYBEAMJZTDPB2/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-02T05:53:58Z","links":{"resolver":"https://pith.science/pith/2LFZ3JK4HBCWKEYBEAMJZTDPB2","bundle":"https://pith.science/pith/2LFZ3JK4HBCWKEYBEAMJZTDPB2/bundle.json","state":"https://pith.science/pith/2LFZ3JK4HBCWKEYBEAMJZTDPB2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LFZ3JK4HBCWKEYBEAMJZTDPB2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:2LFZ3JK4HBCWKEYBEAMJZTDPB2","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":"6bd423241146da2162b32542aeb600813c5c244125c12a8cdbb6bcdb7a173fa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-05T08:50:48Z","title_canon_sha256":"ba929738a8bdac1911fe468c676901dba334d53704185451b98448354ec9a862"},"schema_version":"1.0","source":{"id":"1605.01530","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01530","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01530v1","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01530","created_at":"2026-05-18T01:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"2LFZ3JK4HBCW","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"2LFZ3JK4HBCWKEYB","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"2LFZ3JK4","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:65676780bf54999c6c497ffc1056dc47b943512043d53ee57f8509f8593007fe","target":"graph","created_at":"2026-05-18T01:15:33Z","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 present an algorithm to build an automaton from a rational expression. This approach introduces support for extended weighted expressions. Inspired by derived-term based algorithms, its core relies on a different construct, rational expansions. We introduce an inductive algorithm to compute the expansion of an expression from which the automaton follows. This algorithm is independent of the size of the alphabet, and actually even supports infinite alphabets. It can easily be accommodated to generate deterministic (weighted) automata. These constructs are implemented in Vcsn, a free-software","authors_text":"Akim Demaille","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-05T08:50:48Z","title":"Derived-term Automata for Extended Weighted Rational Expressions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01530","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:28f7ac15f8e5293d3aaef97350d07079d5bfdce1eaaecb4e6e96508d1643eeb8","target":"record","created_at":"2026-05-18T01:15:33Z","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":"6bd423241146da2162b32542aeb600813c5c244125c12a8cdbb6bcdb7a173fa5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2016-05-05T08:50:48Z","title_canon_sha256":"ba929738a8bdac1911fe468c676901dba334d53704185451b98448354ec9a862"},"schema_version":"1.0","source":{"id":"1605.01530","kind":"arxiv","version":1}},"canonical_sha256":"d2cb9da55c384565130120189ccc6f0e895293b024a306a6389ba46c3843c750","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2cb9da55c384565130120189ccc6f0e895293b024a306a6389ba46c3843c750","first_computed_at":"2026-05-18T01:15:33.435377Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:33.435377Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ozUFmea2xUC9BZtzMAxxJWBa/dnkii1SToBgJJNSi3qDB7nKdHDcRLcAPAS5c6sM9/WzIML1SwReQZwn8inYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:33.435999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01530","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28f7ac15f8e5293d3aaef97350d07079d5bfdce1eaaecb4e6e96508d1643eeb8","sha256:65676780bf54999c6c497ffc1056dc47b943512043d53ee57f8509f8593007fe"],"state_sha256":"6c62e7dc2aba4fd3b065cfb3160c2930a783f136d78564e42d31b62d787b6dcb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Igq+oABfrvcDv5VFfqfMRx5/8UVH8fHbSSK353JgTjsniUZOieIh2gO56woEipeSAGZUwP8foXS93LN1eqJuDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T05:53:58.045274Z","bundle_sha256":"29ece948def501046bbcc1bc1fcd103069c625a6976e75b68cc0784d6a6a7f33"}}