{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JLJF23NJRL2LIDE7MVYXLZRIDH","short_pith_number":"pith:JLJF23NJ","schema_version":"1.0","canonical_sha256":"4ad25d6da98af4b40c9f657175e62819e705f1aa30c368648ce550252cd8abba","source":{"kind":"arxiv","id":"1311.4733","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Flow Analysis in Higher-Order Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Van Horn","submitted_at":"2013-11-19T13:31:54Z","abstract_excerpt":"This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis problems in higher-order programming languages. We give exact characterizations of the computational complexity of 0CFA, the $k$CFA hierarchy, and related analyses. In each case, we precisely capture both the expressiveness and feasibility of the analysis, identifying the elements responsible for the trade-off.\n  0CFA is complete for polynomial time. This result relies on the insight that when a program is linear (each bound variable occurs exactly once), the analysis makes no approximation; abstract and"},"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":"1311.4733","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-11-19T13:31:54Z","cross_cats_sorted":[],"title_canon_sha256":"b714fef7fde0a8e802288b698e113971c1205fa5332a2b59a5e61756b79eac40","abstract_canon_sha256":"1fa3cd353accec0a25d8008c0d8619582300ec1110fd4a564ef1fea6ecf73c28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.607147Z","signature_b64":"lJTWXPghFmvlgnHzk+Y+iPU477DIo7ERx+Zsz31fRxptytF+Osd546BBXQI66ypAzjXj13Ct5mvmO5WFNrDWCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ad25d6da98af4b40c9f657175e62819e705f1aa30c368648ce550252cd8abba","last_reissued_at":"2026-05-18T03:06:43.606669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.606669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Flow Analysis in Higher-Order Languages","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"David Van Horn","submitted_at":"2013-11-19T13:31:54Z","abstract_excerpt":"This dissertation proves lower bounds on the inherent difficulty of deciding flow analysis problems in higher-order programming languages. We give exact characterizations of the computational complexity of 0CFA, the $k$CFA hierarchy, and related analyses. In each case, we precisely capture both the expressiveness and feasibility of the analysis, identifying the elements responsible for the trade-off.\n  0CFA is complete for polynomial time. This result relies on the insight that when a program is linear (each bound variable occurs exactly once), the analysis makes no approximation; abstract and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4733","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":"1311.4733","created_at":"2026-05-18T03:06:43.606742+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4733v1","created_at":"2026-05-18T03:06:43.606742+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4733","created_at":"2026-05-18T03:06:43.606742+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLJF23NJRL2L","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLJF23NJRL2LIDE7","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLJF23NJ","created_at":"2026-05-18T12:27:49.015174+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/JLJF23NJRL2LIDE7MVYXLZRIDH","json":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH.json","graph_json":"https://pith.science/api/pith-number/JLJF23NJRL2LIDE7MVYXLZRIDH/graph.json","events_json":"https://pith.science/api/pith-number/JLJF23NJRL2LIDE7MVYXLZRIDH/events.json","paper":"https://pith.science/paper/JLJF23NJ"},"agent_actions":{"view_html":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH","download_json":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH.json","view_paper":"https://pith.science/paper/JLJF23NJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4733&json=true","fetch_graph":"https://pith.science/api/pith-number/JLJF23NJRL2LIDE7MVYXLZRIDH/graph.json","fetch_events":"https://pith.science/api/pith-number/JLJF23NJRL2LIDE7MVYXLZRIDH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/action/storage_attestation","attest_author":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/action/author_attestation","sign_citation":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/action/citation_signature","submit_replication":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/action/replication_record"}},"created_at":"2026-05-18T03:06:43.606742+00:00","updated_at":"2026-05-18T03:06:43.606742+00:00"}