{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4HMFX66PRWEX2FKYULWBRCQ6VE","short_pith_number":"pith:4HMFX66P","schema_version":"1.0","canonical_sha256":"e1d85bfbcf8d897d1558a2ec188a1ea915ee9c15ca832b59f0de7de21bb5dcea","source":{"kind":"arxiv","id":"1407.0645","version":2},"attestation_state":"computed","paper":{"title":"Branching Bisimilarity of Normed BPA Processes is in NEXPTIME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Petr Jan\\v{c}ar, Wojciech Czerwi\\'nski","submitted_at":"2014-07-02T16:53:04Z","abstract_excerpt":"Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a simpler approach based on relative prime decompositions that leads to a nondeterministic exponential-time algorithm; this is close to the known exponential-time lower bound."},"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":"1407.0645","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-07-02T16:53:04Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"5616a238cadbcd0e7fb9f1bbfec86c21ff7ef1188cd4fff87294ab455eca8a8f","abstract_canon_sha256":"e77be5a4cad9bc857d51140f5ca0fce5c81a5f3dceb64d19ff59020e0f9e5125"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:24:08.858736Z","signature_b64":"hrWVSgpX9Nf42wxGx3vBwl5pXO8BQbtriUhdWBSsLjLsE6DW5GRd4P871BAz31PS4CKjOCHaahMImMAz7QwJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1d85bfbcf8d897d1558a2ec188a1ea915ee9c15ca832b59f0de7de21bb5dcea","last_reissued_at":"2026-05-18T01:24:08.858111Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:24:08.858111Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Branching Bisimilarity of Normed BPA Processes is in NEXPTIME","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.LO","authors_text":"Petr Jan\\v{c}ar, Wojciech Czerwi\\'nski","submitted_at":"2014-07-02T16:53:04Z","abstract_excerpt":"Branching bisimilarity on normed BPA processes was recently shown to be decidable by Yuxi Fu (ICALP 2013) but his proof has not provided any upper complexity bound. We present a simpler approach based on relative prime decompositions that leads to a nondeterministic exponential-time algorithm; this is close to the known exponential-time lower bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0645","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.0645","created_at":"2026-05-18T01:24:08.858226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0645v2","created_at":"2026-05-18T01:24:08.858226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0645","created_at":"2026-05-18T01:24:08.858226+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HMFX66PRWEX","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HMFX66PRWEX2FKY","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HMFX66P","created_at":"2026-05-18T12:28:14.216126+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/4HMFX66PRWEX2FKYULWBRCQ6VE","json":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE.json","graph_json":"https://pith.science/api/pith-number/4HMFX66PRWEX2FKYULWBRCQ6VE/graph.json","events_json":"https://pith.science/api/pith-number/4HMFX66PRWEX2FKYULWBRCQ6VE/events.json","paper":"https://pith.science/paper/4HMFX66P"},"agent_actions":{"view_html":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE","download_json":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE.json","view_paper":"https://pith.science/paper/4HMFX66P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0645&json=true","fetch_graph":"https://pith.science/api/pith-number/4HMFX66PRWEX2FKYULWBRCQ6VE/graph.json","fetch_events":"https://pith.science/api/pith-number/4HMFX66PRWEX2FKYULWBRCQ6VE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE/action/storage_attestation","attest_author":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE/action/author_attestation","sign_citation":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE/action/citation_signature","submit_replication":"https://pith.science/pith/4HMFX66PRWEX2FKYULWBRCQ6VE/action/replication_record"}},"created_at":"2026-05-18T01:24:08.858226+00:00","updated_at":"2026-05-18T01:24:08.858226+00:00"}