{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OALSCII5FZRAFOHONQTSLCBVE2","short_pith_number":"pith:OALSCII5","schema_version":"1.0","canonical_sha256":"701721211d2e6202b8ee6c2725883526be7fc0ea764d11afbea7742c31e9d007","source":{"kind":"arxiv","id":"1710.04490","version":1},"attestation_state":"computed","paper":{"title":"Average Stack Cost of Buechi Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jakub Michaliszyn, Jan Otop","submitted_at":"2017-10-12T13:10:30Z","abstract_excerpt":"We study the average stack cost of Buechi pushdown automata (Buechi PDA). We associate a non-negative price with each stack symbol and define the cost of a stack as the sum of costs of all its elements. We introduce and study the average stack cost problem (ASC), which asks whether there exists an accepting run of a given Buechi PDA such that the long-run average of stack costs is below some given threshold. The ASC problem generalizes mean-payoff objective and can be used to express quantitative properties of pushdown systems. In particular, we can compute the average response time using the "},"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":"1710.04490","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-10-12T13:10:30Z","cross_cats_sorted":[],"title_canon_sha256":"38c65495c716635f2f6c39eafd970f180d0c51a201bd23773e337ba8d44f3707","abstract_canon_sha256":"791d6ca9415b4b8993ec230e93eccf59ffa8fb57a3f2b246dadc49c4f963e024"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:00.877490Z","signature_b64":"M6I5Bnjrw4XCks2gbfjRErDUxiME7RuHYdHfaIO7YgX4yF9cAuoP9ubJSPV5C/WgCH9+dRUl/F26ic/KCOh4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"701721211d2e6202b8ee6c2725883526be7fc0ea764d11afbea7742c31e9d007","last_reissued_at":"2026-05-18T00:33:00.876689Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:00.876689Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Average Stack Cost of Buechi Pushdown Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Jakub Michaliszyn, Jan Otop","submitted_at":"2017-10-12T13:10:30Z","abstract_excerpt":"We study the average stack cost of Buechi pushdown automata (Buechi PDA). We associate a non-negative price with each stack symbol and define the cost of a stack as the sum of costs of all its elements. We introduce and study the average stack cost problem (ASC), which asks whether there exists an accepting run of a given Buechi PDA such that the long-run average of stack costs is below some given threshold. The ASC problem generalizes mean-payoff objective and can be used to express quantitative properties of pushdown systems. In particular, we can compute the average response time using the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.04490","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":"1710.04490","created_at":"2026-05-18T00:33:00.876824+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.04490v1","created_at":"2026-05-18T00:33:00.876824+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.04490","created_at":"2026-05-18T00:33:00.876824+00:00"},{"alias_kind":"pith_short_12","alias_value":"OALSCII5FZRA","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OALSCII5FZRAFOHO","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OALSCII5","created_at":"2026-05-18T12:31:34.259226+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/OALSCII5FZRAFOHONQTSLCBVE2","json":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2.json","graph_json":"https://pith.science/api/pith-number/OALSCII5FZRAFOHONQTSLCBVE2/graph.json","events_json":"https://pith.science/api/pith-number/OALSCII5FZRAFOHONQTSLCBVE2/events.json","paper":"https://pith.science/paper/OALSCII5"},"agent_actions":{"view_html":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2","download_json":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2.json","view_paper":"https://pith.science/paper/OALSCII5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.04490&json=true","fetch_graph":"https://pith.science/api/pith-number/OALSCII5FZRAFOHONQTSLCBVE2/graph.json","fetch_events":"https://pith.science/api/pith-number/OALSCII5FZRAFOHONQTSLCBVE2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2/action/storage_attestation","attest_author":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2/action/author_attestation","sign_citation":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2/action/citation_signature","submit_replication":"https://pith.science/pith/OALSCII5FZRAFOHONQTSLCBVE2/action/replication_record"}},"created_at":"2026-05-18T00:33:00.876824+00:00","updated_at":"2026-05-18T00:33:00.876824+00:00"}