{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MK37SGAFAVY2JLULZS2RMGS2GS","short_pith_number":"pith:MK37SGAF","schema_version":"1.0","canonical_sha256":"62b7f918050571a4ae8bccb5161a5a349782aae9ecb410d5c5df10a7ac798653","source":{"kind":"arxiv","id":"2210.10084","version":3},"attestation_state":"computed","paper":{"title":"On History-Deterministic One-Counter Nets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Keya Prakash, K. S. Thejaswini","submitted_at":"2022-10-18T18:27:03Z","abstract_excerpt":"We consider the model of history-deterministic one-counter nets (OCNs). History-determinism is a property of transition systems that allows for a limited kind of non-determinism which can be resolved 'on-the-fly'. Token games, which have been used to characterise history-determinism over various models, also characterise history-determinism over OCNs. By reducing 1-token games to simulation games, we are able to show that checking for history-determinism of OCNs is decidable. Moreover, we prove that this problem is PSPACE-complete for a unary encoding of transitions, and EXPSPACE-complete for "},"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":"2210.10084","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2022-10-18T18:27:03Z","cross_cats_sorted":[],"title_canon_sha256":"3b77849d5970b0c7a7ce168c510eb1c1f4163367980621082162d80aaa587dbb","abstract_canon_sha256":"3d1b97bfe90d55a604db3c6451a7c8e06a1b88b88f697c539421e968f208215a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-28T21:06:50.871024Z","signature_b64":"vQitjGg5963wZMsJHZTvUWLf9p+FjeTT5B8tDD+Vc+1TvNLYUMV/ezmZ5tzFgRaBuMWgIdhnotqh6VimrQPUDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62b7f918050571a4ae8bccb5161a5a349782aae9ecb410d5c5df10a7ac798653","last_reissued_at":"2026-05-28T21:06:50.869892Z","signature_status":"signed_v1","first_computed_at":"2026-05-28T21:06:50.869892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On History-Deterministic One-Counter Nets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Keya Prakash, K. S. Thejaswini","submitted_at":"2022-10-18T18:27:03Z","abstract_excerpt":"We consider the model of history-deterministic one-counter nets (OCNs). History-determinism is a property of transition systems that allows for a limited kind of non-determinism which can be resolved 'on-the-fly'. Token games, which have been used to characterise history-determinism over various models, also characterise history-determinism over OCNs. By reducing 1-token games to simulation games, we are able to show that checking for history-determinism of OCNs is decidable. Moreover, we prove that this problem is PSPACE-complete for a unary encoding of transitions, and EXPSPACE-complete for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2210.10084","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2210.10084/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2210.10084","created_at":"2026-05-28T21:06:50.870045+00:00"},{"alias_kind":"arxiv_version","alias_value":"2210.10084v3","created_at":"2026-05-28T21:06:50.870045+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2210.10084","created_at":"2026-05-28T21:06:50.870045+00:00"},{"alias_kind":"pith_short_12","alias_value":"MK37SGAFAVY2","created_at":"2026-05-28T21:06:50.870045+00:00"},{"alias_kind":"pith_short_16","alias_value":"MK37SGAFAVY2JLUL","created_at":"2026-05-28T21:06:50.870045+00:00"},{"alias_kind":"pith_short_8","alias_value":"MK37SGAF","created_at":"2026-05-28T21:06:50.870045+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/MK37SGAFAVY2JLULZS2RMGS2GS","json":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS.json","graph_json":"https://pith.science/api/pith-number/MK37SGAFAVY2JLULZS2RMGS2GS/graph.json","events_json":"https://pith.science/api/pith-number/MK37SGAFAVY2JLULZS2RMGS2GS/events.json","paper":"https://pith.science/paper/MK37SGAF"},"agent_actions":{"view_html":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS","download_json":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS.json","view_paper":"https://pith.science/paper/MK37SGAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2210.10084&json=true","fetch_graph":"https://pith.science/api/pith-number/MK37SGAFAVY2JLULZS2RMGS2GS/graph.json","fetch_events":"https://pith.science/api/pith-number/MK37SGAFAVY2JLULZS2RMGS2GS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS/action/storage_attestation","attest_author":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS/action/author_attestation","sign_citation":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS/action/citation_signature","submit_replication":"https://pith.science/pith/MK37SGAFAVY2JLULZS2RMGS2GS/action/replication_record"}},"created_at":"2026-05-28T21:06:50.870045+00:00","updated_at":"2026-05-28T21:06:50.870045+00:00"}