{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:SPVBAJDUQ55PTILEPEGEGVMTJY","short_pith_number":"pith:SPVBAJDU","schema_version":"1.0","canonical_sha256":"93ea102474877af9a164790c4355934e36e5a6ff587abe766402cf9565c60794","source":{"kind":"arxiv","id":"1410.4011","version":5},"attestation_state":"computed","paper":{"title":"Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.PL","authors_text":"Amir M. Ben-Amram, Aviad Pineles","submitted_at":"2014-10-15T11:16:16Z","abstract_excerpt":"We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially bounded as a function of the input; and similarly for the running time. Such complexity properties are undecidable for a Turing-complete programming language, and a common work-around in program analysis is to settle for sound but incomplete solutions.  In contrast, we consider a class of programs that is Turing-incomplete, but strong enough to include sever"},"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":"1410.4011","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2014-10-15T11:16:16Z","cross_cats_sorted":["cs.FL","cs.LO"],"title_canon_sha256":"ec8acc0511706df73a4d6bf0071dab3630af2810469736caa31abdcfb78699b6","abstract_canon_sha256":"4768738091e854ce73c3bd72de5ce64c93981ca8be3d50a693a16193ab2d8041"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:21.892712Z","signature_b64":"gVkFcHGWUs/0avPkIcaSplyrG1KcT+gV5hQJurYWvGv74csPv4Saakz4LxJkpLXCKkqgxlFF068SYUjKE6YbBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93ea102474877af9a164790c4355934e36e5a6ff587abe766402cf9565c60794","last_reissued_at":"2026-05-18T01:11:21.892223Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:21.892223Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flowchart Programs, Regular Expressions, and Decidability of Polynomial Growth-Rate","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.LO"],"primary_cat":"cs.PL","authors_text":"Amir M. Ben-Amram, Aviad Pineles","submitted_at":"2014-10-15T11:16:16Z","abstract_excerpt":"We present a new method for inferring complexity properties for a class of programs in the form of flowcharts annotated with loop information. Specifically, our method can (soundly and completely) decide if computed values are polynomially bounded as a function of the input; and similarly for the running time. Such complexity properties are undecidable for a Turing-complete programming language, and a common work-around in program analysis is to settle for sound but incomplete solutions.  In contrast, we consider a class of programs that is Turing-incomplete, but strong enough to include sever"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4011","kind":"arxiv","version":5},"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":"1410.4011","created_at":"2026-05-18T01:11:21.892300+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4011v5","created_at":"2026-05-18T01:11:21.892300+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4011","created_at":"2026-05-18T01:11:21.892300+00:00"},{"alias_kind":"pith_short_12","alias_value":"SPVBAJDUQ55P","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_16","alias_value":"SPVBAJDUQ55PTILE","created_at":"2026-05-18T12:28:49.207871+00:00"},{"alias_kind":"pith_short_8","alias_value":"SPVBAJDU","created_at":"2026-05-18T12:28:49.207871+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/SPVBAJDUQ55PTILEPEGEGVMTJY","json":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY.json","graph_json":"https://pith.science/api/pith-number/SPVBAJDUQ55PTILEPEGEGVMTJY/graph.json","events_json":"https://pith.science/api/pith-number/SPVBAJDUQ55PTILEPEGEGVMTJY/events.json","paper":"https://pith.science/paper/SPVBAJDU"},"agent_actions":{"view_html":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY","download_json":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY.json","view_paper":"https://pith.science/paper/SPVBAJDU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4011&json=true","fetch_graph":"https://pith.science/api/pith-number/SPVBAJDUQ55PTILEPEGEGVMTJY/graph.json","fetch_events":"https://pith.science/api/pith-number/SPVBAJDUQ55PTILEPEGEGVMTJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY/action/storage_attestation","attest_author":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY/action/author_attestation","sign_citation":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY/action/citation_signature","submit_replication":"https://pith.science/pith/SPVBAJDUQ55PTILEPEGEGVMTJY/action/replication_record"}},"created_at":"2026-05-18T01:11:21.892300+00:00","updated_at":"2026-05-18T01:11:21.892300+00:00"}