{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LOLPMUTQQ3QNIPSO3NCMBCNHHF","short_pith_number":"pith:LOLPMUTQ","schema_version":"1.0","canonical_sha256":"5b96f6527086e0d43e4edb44c089a739557c9e6a8624f9c941be010f604fe0d2","source":{"kind":"arxiv","id":"1310.3481","version":1},"attestation_state":"computed","paper":{"title":"An Algebraic Framework for Compositional Program Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Azadeh Farzan, Zachary Kincaid","submitted_at":"2013-10-13T13:41:25Z","abstract_excerpt":"The purpose of a program analysis is to compute an abstract meaning for a program which approximates its dynamic behaviour. A compositional program analysis accomplishes this task with a divide-and-conquer strategy: the meaning of a program is computed by dividing it into sub-programs, computing their meaning, and then combining the results. Compositional program analyses are desirable because they can yield scalable (and easily parallelizable) program analyses.\n  This paper presents algebraic framework for designing, implementing, and proving the correctness of compositional program analyses."},"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":"1310.3481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2013-10-13T13:41:25Z","cross_cats_sorted":[],"title_canon_sha256":"e54255d9fd7bf205965008658b6b7545e6935d058028f48e25298c28571f1bb5","abstract_canon_sha256":"bfa0714bb0dd36bbd28fb37ef49374558227e7fef6711c59838928bd87014a1c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:35.617507Z","signature_b64":"KYxbbO/XpaQC1lR+UaBA54VpBZFSQts5M9gSMQLqbsifREUYj77LWXOreqcWy/kAMBWoej407IFDneIibileAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b96f6527086e0d43e4edb44c089a739557c9e6a8624f9c941be010f604fe0d2","last_reissued_at":"2026-05-18T03:10:35.617039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:35.617039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algebraic Framework for Compositional Program Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Azadeh Farzan, Zachary Kincaid","submitted_at":"2013-10-13T13:41:25Z","abstract_excerpt":"The purpose of a program analysis is to compute an abstract meaning for a program which approximates its dynamic behaviour. A compositional program analysis accomplishes this task with a divide-and-conquer strategy: the meaning of a program is computed by dividing it into sub-programs, computing their meaning, and then combining the results. Compositional program analyses are desirable because they can yield scalable (and easily parallelizable) program analyses.\n  This paper presents algebraic framework for designing, implementing, and proving the correctness of compositional program analyses."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.3481","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":"1310.3481","created_at":"2026-05-18T03:10:35.617111+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.3481v1","created_at":"2026-05-18T03:10:35.617111+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.3481","created_at":"2026-05-18T03:10:35.617111+00:00"},{"alias_kind":"pith_short_12","alias_value":"LOLPMUTQQ3QN","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LOLPMUTQQ3QNIPSO","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LOLPMUTQ","created_at":"2026-05-18T12:27:51.066281+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/LOLPMUTQQ3QNIPSO3NCMBCNHHF","json":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF.json","graph_json":"https://pith.science/api/pith-number/LOLPMUTQQ3QNIPSO3NCMBCNHHF/graph.json","events_json":"https://pith.science/api/pith-number/LOLPMUTQQ3QNIPSO3NCMBCNHHF/events.json","paper":"https://pith.science/paper/LOLPMUTQ"},"agent_actions":{"view_html":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF","download_json":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF.json","view_paper":"https://pith.science/paper/LOLPMUTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.3481&json=true","fetch_graph":"https://pith.science/api/pith-number/LOLPMUTQQ3QNIPSO3NCMBCNHHF/graph.json","fetch_events":"https://pith.science/api/pith-number/LOLPMUTQQ3QNIPSO3NCMBCNHHF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF/action/storage_attestation","attest_author":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF/action/author_attestation","sign_citation":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF/action/citation_signature","submit_replication":"https://pith.science/pith/LOLPMUTQQ3QNIPSO3NCMBCNHHF/action/replication_record"}},"created_at":"2026-05-18T03:10:35.617111+00:00","updated_at":"2026-05-18T03:10:35.617111+00:00"}