{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JLJF23NJRL2LIDE7MVYXLZRIDH","short_pith_number":"pith:JLJF23NJ","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"},"canonical_sha256":"4ad25d6da98af4b40c9f657175e62819e705f1aa30c368648ce550252cd8abba","source":{"kind":"arxiv","id":"1311.4733","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4733","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4733v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4733","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"JLJF23NJRL2L","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JLJF23NJRL2LIDE7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JLJF23NJ","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JLJF23NJRL2LIDE7MVYXLZRIDH","target":"record","payload":{"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"},"canonical_sha256":"4ad25d6da98af4b40c9f657175e62819e705f1aa30c368648ce550252cd8abba","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"},"source_kind":"arxiv","source_id":"1311.4733","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFf+hn/imXt8Fn/wqgzqc7febg24kuF0jJKW5+70TppKyD/1tNems8vGhcmmMa830EBm4VfuknQzkpG3ULgyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:36:00.553862Z"},"content_sha256":"dcd8fb057ea6aa364e91e7fac2a1a1b7d597b7788a7083f873bf94b629dbd8b2","schema_version":"1.0","event_id":"sha256:dcd8fb057ea6aa364e91e7fac2a1a1b7d597b7788a7083f873bf94b629dbd8b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JLJF23NJRL2LIDE7MVYXLZRIDH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JGQnnPMU/S0LLAUMe4Zgn3ASh818SD606DVDsK8pe3tTMoVKDP6gZGVkFuxr/CHjp6EZ5OfyEFvLHikH/XKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T05:36:00.554203Z"},"content_sha256":"daf311cd20c2c60ea966e5734c29590353360b8ec05b36d34e7d5ecf96a42e68","schema_version":"1.0","event_id":"sha256:daf311cd20c2c60ea966e5734c29590353360b8ec05b36d34e7d5ecf96a42e68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/bundle.json","state_url":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-20T05:36:00Z","links":{"resolver":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH","bundle":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/bundle.json","state":"https://pith.science/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLJF23NJRL2LIDE7MVYXLZRIDH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JLJF23NJRL2LIDE7MVYXLZRIDH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1fa3cd353accec0a25d8008c0d8619582300ec1110fd4a564ef1fea6ecf73c28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-11-19T13:31:54Z","title_canon_sha256":"b714fef7fde0a8e802288b698e113971c1205fa5332a2b59a5e61756b79eac40"},"schema_version":"1.0","source":{"id":"1311.4733","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4733","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4733v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4733","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"JLJF23NJRL2L","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JLJF23NJRL2LIDE7","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JLJF23NJ","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:daf311cd20c2c60ea966e5734c29590353360b8ec05b36d34e7d5ecf96a42e68","target":"graph","created_at":"2026-05-18T03:06:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"David Van Horn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-11-19T13:31:54Z","title":"The Complexity of Flow Analysis in Higher-Order Languages"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4733","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dcd8fb057ea6aa364e91e7fac2a1a1b7d597b7788a7083f873bf94b629dbd8b2","target":"record","created_at":"2026-05-18T03:06:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1fa3cd353accec0a25d8008c0d8619582300ec1110fd4a564ef1fea6ecf73c28","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-11-19T13:31:54Z","title_canon_sha256":"b714fef7fde0a8e802288b698e113971c1205fa5332a2b59a5e61756b79eac40"},"schema_version":"1.0","source":{"id":"1311.4733","kind":"arxiv","version":1}},"canonical_sha256":"4ad25d6da98af4b40c9f657175e62819e705f1aa30c368648ce550252cd8abba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ad25d6da98af4b40c9f657175e62819e705f1aa30c368648ce550252cd8abba","first_computed_at":"2026-05-18T03:06:43.606669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:43.606669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lJTWXPghFmvlgnHzk+Y+iPU477DIo7ERx+Zsz31fRxptytF+Osd546BBXQI66ypAzjXj13Ct5mvmO5WFNrDWCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:43.607147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4733","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dcd8fb057ea6aa364e91e7fac2a1a1b7d597b7788a7083f873bf94b629dbd8b2","sha256:daf311cd20c2c60ea966e5734c29590353360b8ec05b36d34e7d5ecf96a42e68"],"state_sha256":"b1262f23e51e6488f4bfbfb28baa087512c102c0cff84621e7fc3ac65529fcd7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZIgdxDxAhxlTGD5DrJqsot7gNDsVjFKbJokoluM2UXgO/1mhy8ZYPUlRLiYundtlXA5FBIVcQtf22SOCdN1QCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T05:36:00.556114Z","bundle_sha256":"118e5afa4166ed709c05eecc2d7fe9456eeb1d827543f5ab7bcc371d6752fed8"}}