{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:XDFRLAX7SHEUXALGBIJNEUN6A5","short_pith_number":"pith:XDFRLAX7","canonical_record":{"source":{"id":"0907.4296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-07-24T15:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"fd7cf46ad1cb930a22e6b2e7c32a8cb41354e70af2fe9a23d6ef71b056c2b109","abstract_canon_sha256":"cbbc0f3b902790a07acb0ba8ff72cabdbe3e4c3edde6ba1a2386d4fc073d6f0b"},"schema_version":"1.0"},"canonical_sha256":"b8cb1582ff91c94b81660a12d251be0745d1b5609ed7d00b0bb5176b36d75c38","source":{"kind":"arxiv","id":"0907.4296","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.4296","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"0907.4296v2","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4296","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"XDFRLAX7SHEU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XDFRLAX7SHEUXALG","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XDFRLAX7","created_at":"2026-05-18T12:26:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:XDFRLAX7SHEUXALGBIJNEUN6A5","target":"record","payload":{"canonical_record":{"source":{"id":"0907.4296","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-07-24T15:22:46Z","cross_cats_sorted":[],"title_canon_sha256":"fd7cf46ad1cb930a22e6b2e7c32a8cb41354e70af2fe9a23d6ef71b056c2b109","abstract_canon_sha256":"cbbc0f3b902790a07acb0ba8ff72cabdbe3e4c3edde6ba1a2386d4fc073d6f0b"},"schema_version":"1.0"},"canonical_sha256":"b8cb1582ff91c94b81660a12d251be0745d1b5609ed7d00b0bb5176b36d75c38","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:04.090175Z","signature_b64":"54DXsZHBdxhslQwjXjnpqq8l11eKUZnoP5oy6ndLHAYXlSAi6KtAfRBhl0+S4QLVxL3Ruy85Z7rqFmJEli8hCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8cb1582ff91c94b81660a12d251be0745d1b5609ed7d00b0bb5176b36d75c38","last_reissued_at":"2026-05-18T04:08:04.089699Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:04.089699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0907.4296","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-18T04:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SPCdIG+V5rzZXrPqfh1ucI/CwnzbAhTjCIWlL6XZPET2UNVYzFA+u3D388aAbP7fxW5BlxS1vw+blQvv/cHoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:38.670243Z"},"content_sha256":"aa48c4a37358a2fa155583f159dd90fd10e3e5acaf0aaaa288797a158866426a","schema_version":"1.0","event_id":"sha256:aa48c4a37358a2fa155583f159dd90fd10e3e5acaf0aaaa288797a158866426a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:XDFRLAX7SHEUXALGBIJNEUN6A5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algorithms for Glushkov K-graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Marianne Flouret, Pascal Caron","submitted_at":"2009-07-24T15:22:46Z","abstract_excerpt":"The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expression-to-automaton algorithmic short cut (On a synthesis algorithm for abstract automata, Ukr. Matem. Zhurnal, 12(2):147-156, 1960, In Russian). The Glushkov graphs have been characterized (P. Caron and D. Ziadi, Characterization of Glushkov automata. Theoret. Comput. Sci., 233(1-2):75-90, 2000) in terms of simple graph theoretical properties and certain reduction rules. We show how to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4296","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-18T04:08:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOs3lOjd4lWaTfsQF/FEsbKpI/qICbX7jTFScL4Ut1s2ADrwhKGxOgcgR4FRXk2CVDQ0OPfk/Hdsg4PSk2JNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:38.670935Z"},"content_sha256":"370b1a38db1df6a1011d3d720b5d9d6e6bbe25c6f27e23003fe7dd9bada1c010","schema_version":"1.0","event_id":"sha256:370b1a38db1df6a1011d3d720b5d9d6e6bbe25c6f27e23003fe7dd9bada1c010"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XDFRLAX7SHEUXALGBIJNEUN6A5/bundle.json","state_url":"https://pith.science/pith/XDFRLAX7SHEUXALGBIJNEUN6A5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XDFRLAX7SHEUXALGBIJNEUN6A5/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-27T23:20:38Z","links":{"resolver":"https://pith.science/pith/XDFRLAX7SHEUXALGBIJNEUN6A5","bundle":"https://pith.science/pith/XDFRLAX7SHEUXALGBIJNEUN6A5/bundle.json","state":"https://pith.science/pith/XDFRLAX7SHEUXALGBIJNEUN6A5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XDFRLAX7SHEUXALGBIJNEUN6A5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:XDFRLAX7SHEUXALGBIJNEUN6A5","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":"cbbc0f3b902790a07acb0ba8ff72cabdbe3e4c3edde6ba1a2386d4fc073d6f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-07-24T15:22:46Z","title_canon_sha256":"fd7cf46ad1cb930a22e6b2e7c32a8cb41354e70af2fe9a23d6ef71b056c2b109"},"schema_version":"1.0","source":{"id":"0907.4296","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0907.4296","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"arxiv_version","alias_value":"0907.4296v2","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0907.4296","created_at":"2026-05-18T04:08:04Z"},{"alias_kind":"pith_short_12","alias_value":"XDFRLAX7SHEU","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_16","alias_value":"XDFRLAX7SHEUXALG","created_at":"2026-05-18T12:26:02Z"},{"alias_kind":"pith_short_8","alias_value":"XDFRLAX7","created_at":"2026-05-18T12:26:02Z"}],"graph_snapshots":[{"event_id":"sha256:370b1a38db1df6a1011d3d720b5d9d6e6bbe25c6f27e23003fe7dd9bada1c010","target":"graph","created_at":"2026-05-18T04:08:04Z","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":"The automata arising from the well known conversion of regular expression to non deterministic automata have rather particular transition graphs. We refer to them as the Glushkov graphs, to honour his nice expression-to-automaton algorithmic short cut (On a synthesis algorithm for abstract automata, Ukr. Matem. Zhurnal, 12(2):147-156, 1960, In Russian). The Glushkov graphs have been characterized (P. Caron and D. Ziadi, Characterization of Glushkov automata. Theoret. Comput. Sci., 233(1-2):75-90, 2000) in terms of simple graph theoretical properties and certain reduction rules. We show how to ","authors_text":"Marianne Flouret, Pascal Caron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-07-24T15:22:46Z","title":"Algorithms for Glushkov K-graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0907.4296","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:aa48c4a37358a2fa155583f159dd90fd10e3e5acaf0aaaa288797a158866426a","target":"record","created_at":"2026-05-18T04:08:04Z","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":"cbbc0f3b902790a07acb0ba8ff72cabdbe3e4c3edde6ba1a2386d4fc073d6f0b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2009-07-24T15:22:46Z","title_canon_sha256":"fd7cf46ad1cb930a22e6b2e7c32a8cb41354e70af2fe9a23d6ef71b056c2b109"},"schema_version":"1.0","source":{"id":"0907.4296","kind":"arxiv","version":2}},"canonical_sha256":"b8cb1582ff91c94b81660a12d251be0745d1b5609ed7d00b0bb5176b36d75c38","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8cb1582ff91c94b81660a12d251be0745d1b5609ed7d00b0bb5176b36d75c38","first_computed_at":"2026-05-18T04:08:04.089699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:04.089699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"54DXsZHBdxhslQwjXjnpqq8l11eKUZnoP5oy6ndLHAYXlSAi6KtAfRBhl0+S4QLVxL3Ruy85Z7rqFmJEli8hCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:04.090175Z","signed_message":"canonical_sha256_bytes"},"source_id":"0907.4296","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa48c4a37358a2fa155583f159dd90fd10e3e5acaf0aaaa288797a158866426a","sha256:370b1a38db1df6a1011d3d720b5d9d6e6bbe25c6f27e23003fe7dd9bada1c010"],"state_sha256":"92bf08ae3c05948b562a8d65c2adddc23486c1f4ff400e588a67b2c5d7c413e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bC+De246bMFtG8unSh9D1LedM4fOgwbHrwiVLMf1hUjeXMGNSoRhiKjFWuAU499YMf5l8V343wdq4bz+nNs6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:20:38.674555Z","bundle_sha256":"60764462b52a997db1b77425d611a2b9aa28895b199b1ce91ed7ad2d244240c7"}}