{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QJEDQ5SRK5ZQ2MNOTTEDEDGLXN","short_pith_number":"pith:QJEDQ5SR","schema_version":"1.0","canonical_sha256":"824838765157730d31ae9cc8320ccbbb5fa795e354dddfd0a77d9bd8353b69f4","source":{"kind":"arxiv","id":"2205.06780","version":1},"attestation_state":"computed","paper":{"title":"Automatic Root Cause Quantification for Missing Edges in JavaScript Call Graphs (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Behnaz Hassanshahi, Madhurima Chakraborty, Manu Sridharan, Renzo Olivares","submitted_at":"2022-05-13T17:06:43Z","abstract_excerpt":"Building sound and precise static call graphs for real-world JavaScript applications poses an enormous challenge, due to many hard-to-analyze language features. Further, the relative importance of these features may vary depending on the call graph algorithm being used and the class of applications being analyzed. In this paper, we present a technique to automatically quantify the relative importance of different root causes of call graph unsoundness for a set of target applications. The technique works by identifying the dynamic function data flows relevant to each call edge missed by the sta"},"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.06780","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.PL","submitted_at":"2022-05-13T17:06:43Z","cross_cats_sorted":["cs.SE"],"title_canon_sha256":"bdcf7dcbbef5fa74b58c380e0bb8da023abbd1dce2801e93c22eb8a4ba4d2430","abstract_canon_sha256":"5b5afe18476471db1cffe11bf5c49d6933074e961641c555d44a6a705b79a880"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:23:02.057586Z","signature_b64":"SkIGN8BkxyPnnCIoS6rMtVpdfXZeSTR3An9ui9dHUeA4jpg1I6LeaY/DOb0FjNWiZvLRKlrO3qQmZJaKpYZ0CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"824838765157730d31ae9cc8320ccbbb5fa795e354dddfd0a77d9bd8353b69f4","last_reissued_at":"2026-07-05T04:23:02.057162Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:23:02.057162Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Root Cause Quantification for Missing Edges in JavaScript Call Graphs (Extended Version)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SE"],"primary_cat":"cs.PL","authors_text":"Behnaz Hassanshahi, Madhurima Chakraborty, Manu Sridharan, Renzo Olivares","submitted_at":"2022-05-13T17:06:43Z","abstract_excerpt":"Building sound and precise static call graphs for real-world JavaScript applications poses an enormous challenge, due to many hard-to-analyze language features. Further, the relative importance of these features may vary depending on the call graph algorithm being used and the class of applications being analyzed. In this paper, we present a technique to automatically quantify the relative importance of different root causes of call graph unsoundness for a set of target applications. The technique works by identifying the dynamic function data flows relevant to each call edge missed by the sta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2205.06780","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2205.06780/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.06780","created_at":"2026-07-05T04:23:02.057222+00:00"},{"alias_kind":"arxiv_version","alias_value":"2205.06780v1","created_at":"2026-07-05T04:23:02.057222+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2205.06780","created_at":"2026-07-05T04:23:02.057222+00:00"},{"alias_kind":"pith_short_12","alias_value":"QJEDQ5SRK5ZQ","created_at":"2026-07-05T04:23:02.057222+00:00"},{"alias_kind":"pith_short_16","alias_value":"QJEDQ5SRK5ZQ2MNO","created_at":"2026-07-05T04:23:02.057222+00:00"},{"alias_kind":"pith_short_8","alias_value":"QJEDQ5SR","created_at":"2026-07-05T04:23:02.057222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.18191","citing_title":"Call Me Maybe: Enhancing JavaScript Call Graph Construction using Graph Neural Networks","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN","json":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN.json","graph_json":"https://pith.science/api/pith-number/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/graph.json","events_json":"https://pith.science/api/pith-number/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/events.json","paper":"https://pith.science/paper/QJEDQ5SR"},"agent_actions":{"view_html":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN","download_json":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN.json","view_paper":"https://pith.science/paper/QJEDQ5SR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2205.06780&json=true","fetch_graph":"https://pith.science/api/pith-number/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/graph.json","fetch_events":"https://pith.science/api/pith-number/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/action/storage_attestation","attest_author":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/action/author_attestation","sign_citation":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/action/citation_signature","submit_replication":"https://pith.science/pith/QJEDQ5SRK5ZQ2MNOTTEDEDGLXN/action/replication_record"}},"created_at":"2026-07-05T04:23:02.057222+00:00","updated_at":"2026-07-05T04:23:02.057222+00:00"}