{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CMQJM3W7U4SEUYVMSQVDMX7LNR","short_pith_number":"pith:CMQJM3W7","schema_version":"1.0","canonical_sha256":"1320966edfa7244a62ac942a365feb6c4206695d8d7d0b5ca1098f22717914ca","source":{"kind":"arxiv","id":"1607.02238","version":1},"attestation_state":"computed","paper":{"title":"Incremental Quantitative Analysis on Dynamic Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Duc-Hiep Chu, Joxan Jaffar, Vijayaraghavan Murali","submitted_at":"2016-07-08T05:48:14Z","abstract_excerpt":"In quantitative program analysis, values are assigned to execution traces to represent a quality measure. Such analyses cover important applications, e.g. resource usage. Examining all traces is well known to be intractable and therefore traditional algorithms reason over an over-approximated set. Typically, inaccuracy arises due to inclusion of infeasible paths in this set. Thus path-sensitivity is one cure. However, there is another reason for the inaccuracy: that the cost model, i.e., the way in which the analysis of each trace is quantified, is dynamic. That is, the cost of a trace is depe"},"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":"1607.02238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2016-07-08T05:48:14Z","cross_cats_sorted":[],"title_canon_sha256":"3ebbe3bb0a2ac0023ee5e6826d526c1bd9aae0e4740f1ca39fce8889fdbe17fd","abstract_canon_sha256":"a45c927c01f2b01a940b1909b694853d3f1c0d44fe660522c20a128a1cb4cdd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:20.896328Z","signature_b64":"lQTfSoF5c9CjBxIwv5A1Cllyev76uTeTcp8nsrKRWMLqY2sQSBviLdNwhMQiLQcqYizfY1l3KEXy365WsbquCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1320966edfa7244a62ac942a365feb6c4206695d8d7d0b5ca1098f22717914ca","last_reissued_at":"2026-05-18T01:11:20.895888Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:20.895888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Quantitative Analysis on Dynamic Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Duc-Hiep Chu, Joxan Jaffar, Vijayaraghavan Murali","submitted_at":"2016-07-08T05:48:14Z","abstract_excerpt":"In quantitative program analysis, values are assigned to execution traces to represent a quality measure. Such analyses cover important applications, e.g. resource usage. Examining all traces is well known to be intractable and therefore traditional algorithms reason over an over-approximated set. Typically, inaccuracy arises due to inclusion of infeasible paths in this set. Thus path-sensitivity is one cure. However, there is another reason for the inaccuracy: that the cost model, i.e., the way in which the analysis of each trace is quantified, is dynamic. That is, the cost of a trace is depe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02238","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":"1607.02238","created_at":"2026-05-18T01:11:20.895952+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.02238v1","created_at":"2026-05-18T01:11:20.895952+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02238","created_at":"2026-05-18T01:11:20.895952+00:00"},{"alias_kind":"pith_short_12","alias_value":"CMQJM3W7U4SE","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CMQJM3W7U4SEUYVM","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CMQJM3W7","created_at":"2026-05-18T12:30:09.641336+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/CMQJM3W7U4SEUYVMSQVDMX7LNR","json":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR.json","graph_json":"https://pith.science/api/pith-number/CMQJM3W7U4SEUYVMSQVDMX7LNR/graph.json","events_json":"https://pith.science/api/pith-number/CMQJM3W7U4SEUYVMSQVDMX7LNR/events.json","paper":"https://pith.science/paper/CMQJM3W7"},"agent_actions":{"view_html":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR","download_json":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR.json","view_paper":"https://pith.science/paper/CMQJM3W7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.02238&json=true","fetch_graph":"https://pith.science/api/pith-number/CMQJM3W7U4SEUYVMSQVDMX7LNR/graph.json","fetch_events":"https://pith.science/api/pith-number/CMQJM3W7U4SEUYVMSQVDMX7LNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR/action/storage_attestation","attest_author":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR/action/author_attestation","sign_citation":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR/action/citation_signature","submit_replication":"https://pith.science/pith/CMQJM3W7U4SEUYVMSQVDMX7LNR/action/replication_record"}},"created_at":"2026-05-18T01:11:20.895952+00:00","updated_at":"2026-05-18T01:11:20.895952+00:00"}