{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:TTYMGY3D66OPH2426ZNVRHQMQO","short_pith_number":"pith:TTYMGY3D","schema_version":"1.0","canonical_sha256":"9cf0c36363f79cf3eb9af65b589e0c83818d5993fe0fbe7a39959286a9c4ac59","source":{"kind":"arxiv","id":"1910.00241","version":1},"attestation_state":"computed","paper":{"title":"Optimal Dyck Reachability for Data-Dependence and Alias Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andreas Pavlogiannis, Bhavya Choudhary, Krishnendu Chatterjee","submitted_at":"2019-10-01T08:08:58Z","abstract_excerpt":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows.\n  First, we consider Dyck reachability on bidirected g"},"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":"1910.00241","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-10-01T08:08:58Z","cross_cats_sorted":[],"title_canon_sha256":"27a05d56a8ef7c1efa06e12b0cba0cd2ce18de6c9e9cdddd944cd183c065cf4a","abstract_canon_sha256":"f0aeb3b13cf4dbd0003071e98b730af37a7bbac8709c2bcfffab5c3eb42f776d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:08:43.961393Z","signature_b64":"rUgC76z+1nMp1gmBCdPtjJDgT9/LAGLZshxGJ2khtDahnIfGI53pbsVpurjEpjdOmciY0seRe+/uqARDG3/MCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cf0c36363f79cf3eb9af65b589e0c83818d5993fe0fbe7a39959286a9c4ac59","last_reissued_at":"2026-07-05T00:08:43.960958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:08:43.960958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Dyck Reachability for Data-Dependence and Alias Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Andreas Pavlogiannis, Bhavya Choudhary, Krishnendu Chatterjee","submitted_at":"2019-10-01T08:08:58Z","abstract_excerpt":"A fundamental algorithmic problem at the heart of static analysis is Dyck reachability. The input is a graph where the edges are labeled with different types of opening and closing parentheses, and the reachability information is computed via paths whose parentheses are properly matched. We present new results for Dyck reachability problems with applications to alias analysis and data-dependence analysis. Our main contributions, that include improved upper bounds as well as lower bounds that establish optimality guarantees, are as follows.\n  First, we consider Dyck reachability on bidirected g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1910.00241","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/1910.00241/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":"1910.00241","created_at":"2026-07-05T00:08:43.961027+00:00"},{"alias_kind":"arxiv_version","alias_value":"1910.00241v1","created_at":"2026-07-05T00:08:43.961027+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1910.00241","created_at":"2026-07-05T00:08:43.961027+00:00"},{"alias_kind":"pith_short_12","alias_value":"TTYMGY3D66OP","created_at":"2026-07-05T00:08:43.961027+00:00"},{"alias_kind":"pith_short_16","alias_value":"TTYMGY3D66OPH242","created_at":"2026-07-05T00:08:43.961027+00:00"},{"alias_kind":"pith_short_8","alias_value":"TTYMGY3D","created_at":"2026-07-05T00:08:43.961027+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/TTYMGY3D66OPH2426ZNVRHQMQO","json":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO.json","graph_json":"https://pith.science/api/pith-number/TTYMGY3D66OPH2426ZNVRHQMQO/graph.json","events_json":"https://pith.science/api/pith-number/TTYMGY3D66OPH2426ZNVRHQMQO/events.json","paper":"https://pith.science/paper/TTYMGY3D"},"agent_actions":{"view_html":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO","download_json":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO.json","view_paper":"https://pith.science/paper/TTYMGY3D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1910.00241&json=true","fetch_graph":"https://pith.science/api/pith-number/TTYMGY3D66OPH2426ZNVRHQMQO/graph.json","fetch_events":"https://pith.science/api/pith-number/TTYMGY3D66OPH2426ZNVRHQMQO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO/action/storage_attestation","attest_author":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO/action/author_attestation","sign_citation":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO/action/citation_signature","submit_replication":"https://pith.science/pith/TTYMGY3D66OPH2426ZNVRHQMQO/action/replication_record"}},"created_at":"2026-07-05T00:08:43.961027+00:00","updated_at":"2026-07-05T00:08:43.961027+00:00"}