{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:OMQLMOITIMOUATOXSH4D6VA4GX","short_pith_number":"pith:OMQLMOIT","schema_version":"1.0","canonical_sha256":"7320b63913431d404dd791f83f541c35ed1db14c9b236aa32a23b3a343820b32","source":{"kind":"arxiv","id":"1509.07202","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1509.07202","created_at":"2026-05-18T01:32:09.624854+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07202v1","created_at":"2026-05-18T01:32:09.624854+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07202","created_at":"2026-05-18T01:32:09.624854+00:00"},{"alias_kind":"pith_short_12","alias_value":"OMQLMOITIMOU","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_16","alias_value":"OMQLMOITIMOUATOX","created_at":"2026-05-18T12:29:34.919912+00:00"},{"alias_kind":"pith_short_8","alias_value":"OMQLMOIT","created_at":"2026-05-18T12:29:34.919912+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX","json":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX.json","graph_json":"https://pith.science/api/pith-number/OMQLMOITIMOUATOXSH4D6VA4GX/graph.json","events_json":"https://pith.science/api/pith-number/OMQLMOITIMOUATOXSH4D6VA4GX/events.json","paper":"https://pith.science/paper/OMQLMOIT"},"agent_actions":{"view_html":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX","download_json":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX.json","view_paper":"https://pith.science/paper/OMQLMOIT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07202&json=true","fetch_graph":"https://pith.science/api/pith-number/OMQLMOITIMOUATOXSH4D6VA4GX/graph.json","fetch_events":"https://pith.science/api/pith-number/OMQLMOITIMOUATOXSH4D6VA4GX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/action/storage_attestation","attest_author":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/action/author_attestation","sign_citation":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/action/citation_signature","submit_replication":"https://pith.science/pith/OMQLMOITIMOUATOXSH4D6VA4GX/action/replication_record"}},"created_at":"2026-05-18T01:32:09.624854+00:00","updated_at":"2026-05-18T01:32:09.624854+00:00"}