{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:LHSE2KQC6QEAOJOUG3I2TXIUTU","short_pith_number":"pith:LHSE2KQC","schema_version":"1.0","canonical_sha256":"59e44d2a02f4080725d436d1a9dd149d25f4fcedb1b12331a992a84069547737","source":{"kind":"arxiv","id":"1111.0670","version":2},"attestation_state":"computed","paper":{"title":"Regular Functions, Cost Register Automata, and Generalized Min-Cost Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Jyotirmoy V. Deshmukh, Loris D'Antoni, Mukund Raghothaman, Rajeev Alur, Yifei Yuan","submitted_at":"2011-11-02T21:39:12Z","abstract_excerpt":"Motivated by the successful application of the theory of regular languages to formal verification of finite-state systems, there is a renewed interest in developing a theory of analyzable functions from strings to numerical values that can provide a foundation for analyzing {\\em quantitative} properties of finite-state systems. In this paper, we propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and $\\min$), a notion of {\\em regularity} that provides a yardstick to measure expressiveness, and study decisi"},"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":"1111.0670","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2011-11-02T21:39:12Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"6a524516e167b65d2e0e302c0f8733c8a86b22066a55fcc45b2984253d813c02","abstract_canon_sha256":"5da8b5f90121aa954af9498fb1b6498927f5423a839ae99de6a34fc541a081da"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:49.404914Z","signature_b64":"dbFPsmZIn72PcwZka4WVcj1EOrOiOUV+8uBnljWDxAy6Ia9Ra4AVVoqjHJ3Yz47n6CfZhTBcPBSPaPOmDmcxAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59e44d2a02f4080725d436d1a9dd149d25f4fcedb1b12331a992a84069547737","last_reissued_at":"2026-05-18T04:01:49.404178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:49.404178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Regular Functions, Cost Register Automata, and Generalized Min-Cost Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Jyotirmoy V. Deshmukh, Loris D'Antoni, Mukund Raghothaman, Rajeev Alur, Yifei Yuan","submitted_at":"2011-11-02T21:39:12Z","abstract_excerpt":"Motivated by the successful application of the theory of regular languages to formal verification of finite-state systems, there is a renewed interest in developing a theory of analyzable functions from strings to numerical values that can provide a foundation for analyzing {\\em quantitative} properties of finite-state systems. In this paper, we propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and $\\min$), a notion of {\\em regularity} that provides a yardstick to measure expressiveness, and study decisi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.0670","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":"1111.0670","created_at":"2026-05-18T04:01:49.404287+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.0670v2","created_at":"2026-05-18T04:01:49.404287+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.0670","created_at":"2026-05-18T04:01:49.404287+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHSE2KQC6QEA","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHSE2KQC6QEAOJOU","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHSE2KQC","created_at":"2026-05-18T12:26:34.985390+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/LHSE2KQC6QEAOJOUG3I2TXIUTU","json":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU.json","graph_json":"https://pith.science/api/pith-number/LHSE2KQC6QEAOJOUG3I2TXIUTU/graph.json","events_json":"https://pith.science/api/pith-number/LHSE2KQC6QEAOJOUG3I2TXIUTU/events.json","paper":"https://pith.science/paper/LHSE2KQC"},"agent_actions":{"view_html":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU","download_json":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU.json","view_paper":"https://pith.science/paper/LHSE2KQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.0670&json=true","fetch_graph":"https://pith.science/api/pith-number/LHSE2KQC6QEAOJOUG3I2TXIUTU/graph.json","fetch_events":"https://pith.science/api/pith-number/LHSE2KQC6QEAOJOUG3I2TXIUTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU/action/storage_attestation","attest_author":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU/action/author_attestation","sign_citation":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU/action/citation_signature","submit_replication":"https://pith.science/pith/LHSE2KQC6QEAOJOUG3I2TXIUTU/action/replication_record"}},"created_at":"2026-05-18T04:01:49.404287+00:00","updated_at":"2026-05-18T04:01:49.404287+00:00"}