{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OMQLMOITIMOUATOXSH4D6VA4GX","short_pith_number":"pith:OMQLMOIT","canonical_record":{"source":{"id":"1509.07202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-24T01:53:08Z","cross_cats_sorted":[],"title_canon_sha256":"920944ca74c158fd87887b7f483bd6d04a1d3fbe8380924061322cd80a56e51b","abstract_canon_sha256":"99432738816013d2caabe498442eb7dbff4efb76aef87506bce5499e2ccdae8f"},"schema_version":"1.0"},"canonical_sha256":"7320b63913431d404dd791f83f541c35ed1db14c9b236aa32a23b3a343820b32","source":{"kind":"arxiv","id":"1509.07202","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07202","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07202v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07202","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"OMQLMOITIMOU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMQLMOITIMOUATOX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMQLMOIT","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OMQLMOITIMOUATOXSH4D6VA4GX","target":"record","payload":{"canonical_record":{"source":{"id":"1509.07202","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-24T01:53:08Z","cross_cats_sorted":[],"title_canon_sha256":"920944ca74c158fd87887b7f483bd6d04a1d3fbe8380924061322cd80a56e51b","abstract_canon_sha256":"99432738816013d2caabe498442eb7dbff4efb76aef87506bce5499e2ccdae8f"},"schema_version":"1.0"},"canonical_sha256":"7320b63913431d404dd791f83f541c35ed1db14c9b236aa32a23b3a343820b32","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:09.625510Z","signature_b64":"S8AOOTb85H1s7j+j5k38KaX24G7KHd3S7LYEqIlsANEooxFVs0cV8lO1mlm53EUgUWZtKqro7BNoDuoXVSH1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7320b63913431d404dd791f83f541c35ed1db14c9b236aa32a23b3a343820b32","last_reissued_at":"2026-05-18T01:32:09.624740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:09.624740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.07202","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:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Torc72Rr/e9VSPm3gjq9EjNPodeh72RPrdw+k41AGAWYr+dNJw+eau/arZT8/nkH+L5RjBfUA6H9jvWQM/rXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:40.706689Z"},"content_sha256":"72ec83adca4740086dac9397a413ff5a499c8127b69da206890093272e59a167","schema_version":"1.0","event_id":"sha256:72ec83adca4740086dac9397a413ff5a499c8127b69da206890093272e59a167"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OMQLMOITIMOUATOXSH4D6VA4GX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Rayna Dimitrova, Rupak Majumdar","submitted_at":"2015-09-24T01:53:08Z","abstract_excerpt":"Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization of automata-theoretic  infinite-state verification from strings to labeled series-parallel graphs. We define a model of non-deterministic, 2-way, concurrent automata working on series-parallel graphs and communicating through shared registers on the nodes of the graph. We consider the following verification problem: given a family of series-parallel graphs d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07202","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:32:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UKmSYthrFl2i9VBqoqBbSGjVD2scUeQobooKom7zho59kz1CmkMgLKtDJj0CvQjYFxzEJIniA2WA0mCJDkpUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T12:15:40.707046Z"},"content_sha256":"50ec8c6aeeea239281913729a8e8e6fb538c89e7b64b829fdae09c2aa1f3796d","schema_version":"1.0","event_id":"sha256:50ec8c6aeeea239281913729a8e8e6fb538c89e7b64b829fdae09c2aa1f3796d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/bundle.json","state_url":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OMQLMOITIMOUATOXSH4D6VA4GX/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-06-02T12:15:40Z","links":{"resolver":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX","bundle":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/bundle.json","state":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OMQLMOITIMOUATOXSH4D6VA4GX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OMQLMOITIMOUATOXSH4D6VA4GX","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":"99432738816013d2caabe498442eb7dbff4efb76aef87506bce5499e2ccdae8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-24T01:53:08Z","title_canon_sha256":"920944ca74c158fd87887b7f483bd6d04a1d3fbe8380924061322cd80a56e51b"},"schema_version":"1.0","source":{"id":"1509.07202","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.07202","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"arxiv_version","alias_value":"1509.07202v1","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07202","created_at":"2026-05-18T01:32:09Z"},{"alias_kind":"pith_short_12","alias_value":"OMQLMOITIMOU","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OMQLMOITIMOUATOX","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OMQLMOIT","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:50ec8c6aeeea239281913729a8e8e6fb538c89e7b64b829fdae09c2aa1f3796d","target":"graph","created_at":"2026-05-18T01:32:09Z","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":"Extensions to finite-state automata on strings, such as multi-head automata or multi-counter automata, have been successfully used to encode many infinite-state non-regular verification problems. In this paper, we consider a generalization of automata-theoretic  infinite-state verification from strings to labeled series-parallel graphs. We define a model of non-deterministic, 2-way, concurrent automata working on series-parallel graphs and communicating through shared registers on the nodes of the graph. We consider the following verification problem: given a family of series-parallel graphs d","authors_text":"Rayna Dimitrova, Rupak Majumdar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-24T01:53:08Z","title":"Reachability Analysis of Reversal-bounded Automata on Series-Parallel Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07202","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:72ec83adca4740086dac9397a413ff5a499c8127b69da206890093272e59a167","target":"record","created_at":"2026-05-18T01:32:09Z","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":"99432738816013d2caabe498442eb7dbff4efb76aef87506bce5499e2ccdae8f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2015-09-24T01:53:08Z","title_canon_sha256":"920944ca74c158fd87887b7f483bd6d04a1d3fbe8380924061322cd80a56e51b"},"schema_version":"1.0","source":{"id":"1509.07202","kind":"arxiv","version":1}},"canonical_sha256":"7320b63913431d404dd791f83f541c35ed1db14c9b236aa32a23b3a343820b32","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7320b63913431d404dd791f83f541c35ed1db14c9b236aa32a23b3a343820b32","first_computed_at":"2026-05-18T01:32:09.624740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:09.624740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S8AOOTb85H1s7j+j5k38KaX24G7KHd3S7LYEqIlsANEooxFVs0cV8lO1mlm53EUgUWZtKqro7BNoDuoXVSH1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:09.625510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.07202","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72ec83adca4740086dac9397a413ff5a499c8127b69da206890093272e59a167","sha256:50ec8c6aeeea239281913729a8e8e6fb538c89e7b64b829fdae09c2aa1f3796d"],"state_sha256":"96cbdc8a24520c2679748b8786be96040a90163cbb7f690afcd9824c700eea35"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R6nOgG33rqI2UVMkCx4CF7mOehPZmBK73bn1FTT5VVprV/hi01940vcRDo+U018gbKQ2F3FkdEd7UoAu5qt+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T12:15:40.709863Z","bundle_sha256":"e1c012e6df80fb6654449afa1fc6d2854191b46bb7ad6636db308a8f9fef806a"}}