{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:4AVOGRFPD6LSQYVZU7Y65WSM2I","short_pith_number":"pith:4AVOGRFP","schema_version":"1.0","canonical_sha256":"e02ae344af1f972862b9a7f1eeda4cd216424c43c8a28cfa29a1c32a328fa75f","source":{"kind":"arxiv","id":"2205.08869","version":3},"attestation_state":"computed","paper":{"title":"Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fabian Meyer, J\\\"urgen Giesl, Nils Lommen","submitted_at":"2022-05-18T11:33:18Z","abstract_excerpt":"There exist several results on deciding termination and computing runtime bounds for triangular weakly non-linear loops (twn-loops). We show how to use results on such subclasses of programs where complexity bounds are computable within incomplete approaches for complexity analysis of full integer programs. To this end, we present a novel modular approach which computes local runtime bounds for subprograms which can be transformed into twn-loops. These local runtime bounds are then lifted to global runtime bounds for the whole program. The power of our approach is shown by our implementation i"},"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":"2205.08869","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2022-05-18T11:33:18Z","cross_cats_sorted":[],"title_canon_sha256":"dbec246dbad287251d73db7b6bada59676e37ea81bff0c73165bda1ca7784dee","abstract_canon_sha256":"5da36b5bb92222b77570439240509b3eddee26dfac71dba465ac6d99e9e2a378"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:36:06.454942Z","signature_b64":"CwguYfrEyuoR2STxm1pLaBoylhc0puVtOu8Hv4tPiHg3y5aL2XieFew1HsTfjQJc/Kjp938Xsbq0r/BfS+XNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e02ae344af1f972862b9a7f1eeda4cd216424c43c8a28cfa29a1c32a328fa75f","last_reissued_at":"2026-07-05T09:36:06.454498Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:36:06.454498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Fabian Meyer, J\\\"urgen Giesl, Nils Lommen","submitted_at":"2022-05-18T11:33:18Z","abstract_excerpt":"There exist several results on deciding termination and computing runtime bounds for triangular weakly non-linear loops (twn-loops). We show how to use results on such subclasses of programs where complexity bounds are computable within incomplete approaches for complexity analysis of full integer programs. To this end, we present a novel modular approach which computes local runtime bounds for subprograms which can be transformed into twn-loops. These local runtime bounds are then lifted to global runtime bounds for the whole program. The power of our approach is shown by our implementation i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.08869","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/2205.08869/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":"2205.08869","created_at":"2026-07-05T09:36:06.454555+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.08869v3","created_at":"2026-07-05T09:36:06.454555+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.08869","created_at":"2026-07-05T09:36:06.454555+00:00"},{"alias_kind":"pith_short_12","alias_value":"4AVOGRFPD6LS","created_at":"2026-07-05T09:36:06.454555+00:00"},{"alias_kind":"pith_short_16","alias_value":"4AVOGRFPD6LSQYVZ","created_at":"2026-07-05T09:36:06.454555+00:00"},{"alias_kind":"pith_short_8","alias_value":"4AVOGRFP","created_at":"2026-07-05T09:36:06.454555+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/4AVOGRFPD6LSQYVZU7Y65WSM2I","json":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I.json","graph_json":"https://pith.science/api/pith-number/4AVOGRFPD6LSQYVZU7Y65WSM2I/graph.json","events_json":"https://pith.science/api/pith-number/4AVOGRFPD6LSQYVZU7Y65WSM2I/events.json","paper":"https://pith.science/paper/4AVOGRFP"},"agent_actions":{"view_html":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I","download_json":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I.json","view_paper":"https://pith.science/paper/4AVOGRFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.08869&json=true","fetch_graph":"https://pith.science/api/pith-number/4AVOGRFPD6LSQYVZU7Y65WSM2I/graph.json","fetch_events":"https://pith.science/api/pith-number/4AVOGRFPD6LSQYVZU7Y65WSM2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I/action/storage_attestation","attest_author":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I/action/author_attestation","sign_citation":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I/action/citation_signature","submit_replication":"https://pith.science/pith/4AVOGRFPD6LSQYVZU7Y65WSM2I/action/replication_record"}},"created_at":"2026-07-05T09:36:06.454555+00:00","updated_at":"2026-07-05T09:36:06.454555+00:00"}