{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:TOPME3PEN2IK5I3E4IT6UW4Q3I","short_pith_number":"pith:TOPME3PE","schema_version":"1.0","canonical_sha256":"9b9ec26de46e90aea364e227ea5b90da17f4a75317ddd47ad8e7fcbe0cc8a9f7","source":{"kind":"arxiv","id":"2001.11070","version":2},"attestation_state":"computed","paper":{"title":"Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SE"],"primary_cat":"cs.DS","authors_text":"Amir Kafshdar Goharshady, Andreas Pavlogiannis, Krishnendu Chatterjee, Rasmus Ibsen-Jensen","submitted_at":"2020-01-29T19:54:52Z","abstract_excerpt":"Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summar"},"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":"2001.11070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-01-29T19:54:52Z","cross_cats_sorted":["cs.DM","cs.SE"],"title_canon_sha256":"9c5a7887ee85b0aeeef3b4e59ac960de5efbb8348796db5054df56772014d18a","abstract_canon_sha256":"9c9bee09e1422bf5ef5c51f84fa47e7b8a5ad23b9186487d6e81ad7a15bcaca8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:55:19.931407Z","signature_b64":"qzEZ5fFAEKcrV2jdCgWUYAsfj+70xRV84py0qHs8gxCE9upr67IaqmA0xvVvnmOHTSF3fAJKz+yn1QF4bsZDDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b9ec26de46e90aea364e227ea5b90da17f4a75317ddd47ad8e7fcbe0cc8a9f7","last_reissued_at":"2026-07-05T00:55:19.931056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:55:19.931056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal and Perfectly Parallel Algorithms for On-demand Data-flow Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SE"],"primary_cat":"cs.DS","authors_text":"Amir Kafshdar Goharshady, Andreas Pavlogiannis, Krishnendu Chatterjee, Rasmus Ibsen-Jensen","submitted_at":"2020-01-29T19:54:52Z","abstract_excerpt":"Interprocedural data-flow analyses form an expressive and useful paradigm of numerous static analysis applications, such as live variables analysis, alias analysis and null pointers analysis. The most widely-used framework for interprocedural data-flow analysis is IFDS, which encompasses distributive data-flow functions over a finite domain. On-demand data-flow analyses restrict the focus of the analysis on specific program locations and data facts. This setting provides a natural split between (i) an offline (or preprocessing) phase, where the program is partially analyzed and analysis summar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.11070","kind":"arxiv","version":2},"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/2001.11070/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":"2001.11070","created_at":"2026-07-05T00:55:19.931109+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.11070v2","created_at":"2026-07-05T00:55:19.931109+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.11070","created_at":"2026-07-05T00:55:19.931109+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOPME3PEN2IK","created_at":"2026-07-05T00:55:19.931109+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOPME3PEN2IK5I3E","created_at":"2026-07-05T00:55:19.931109+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOPME3PE","created_at":"2026-07-05T00:55:19.931109+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/TOPME3PEN2IK5I3E4IT6UW4Q3I","json":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I.json","graph_json":"https://pith.science/api/pith-number/TOPME3PEN2IK5I3E4IT6UW4Q3I/graph.json","events_json":"https://pith.science/api/pith-number/TOPME3PEN2IK5I3E4IT6UW4Q3I/events.json","paper":"https://pith.science/paper/TOPME3PE"},"agent_actions":{"view_html":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I","download_json":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I.json","view_paper":"https://pith.science/paper/TOPME3PE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.11070&json=true","fetch_graph":"https://pith.science/api/pith-number/TOPME3PEN2IK5I3E4IT6UW4Q3I/graph.json","fetch_events":"https://pith.science/api/pith-number/TOPME3PEN2IK5I3E4IT6UW4Q3I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I/action/storage_attestation","attest_author":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I/action/author_attestation","sign_citation":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I/action/citation_signature","submit_replication":"https://pith.science/pith/TOPME3PEN2IK5I3E4IT6UW4Q3I/action/replication_record"}},"created_at":"2026-07-05T00:55:19.931109+00:00","updated_at":"2026-07-05T00:55:19.931109+00:00"}