{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CQJN7OIAY7XUNHB5UJKEF3LCY5","short_pith_number":"pith:CQJN7OIA","schema_version":"1.0","canonical_sha256":"1412dfb900c7ef469c3da25442ed62c75bf5634d430a4a4c971d7091b7605796","source":{"kind":"arxiv","id":"1310.2118","version":1},"attestation_state":"computed","paper":{"title":"Finding Dominators via Disjoint Set Union","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Miller, Loukas Georgiadis, Robert E. Tarjan, Wojciech Fraczak","submitted_at":"2013-10-08T12:53:57Z","abstract_excerpt":"The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a \"static tree\" disjoint set data structure in addition to simple lists and maps. The algorithm runs in near-linear or linear time, depending on the implementation of the disjoint set data structure. We give several versions of the algorithm, including one that computes loop nesting information (needed in "},"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.2118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-10-08T12:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"1b162113e52168941f4970adaf9da25186b59443991ea9546207db1179c6892e","abstract_canon_sha256":"075d76ba0916d4ff8ae4594d5a538233e63ce14c435c26983d61c660d83f1855"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:59.286423Z","signature_b64":"vFf1l8doZo9Lca/Bi9+thTL2ckqfgCSQo/YfcxCe/03uIZEUnkKRy+kuG4/qnxAMmdiCkUMSEqW0DZYWs7geAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1412dfb900c7ef469c3da25442ed62c75bf5634d430a4a4c971d7091b7605796","last_reissued_at":"2026-05-18T03:10:59.285587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:59.285587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Dominators via Disjoint Set Union","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew Miller, Loukas Georgiadis, Robert E. Tarjan, Wojciech Fraczak","submitted_at":"2013-10-08T12:53:57Z","abstract_excerpt":"The problem of finding dominators in a directed graph has many important applications, notably in global optimization of computer code. Although linear and near-linear-time algorithms exist, they use sophisticated data structures. We develop an algorithm for finding dominators that uses only a \"static tree\" disjoint set data structure in addition to simple lists and maps. The algorithm runs in near-linear or linear time, depending on the implementation of the disjoint set data structure. We give several versions of the algorithm, including one that computes loop nesting information (needed in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2118","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.2118","created_at":"2026-05-18T03:10:59.285726+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2118v1","created_at":"2026-05-18T03:10:59.285726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2118","created_at":"2026-05-18T03:10:59.285726+00:00"},{"alias_kind":"pith_short_12","alias_value":"CQJN7OIAY7XU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CQJN7OIAY7XUNHB5","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CQJN7OIA","created_at":"2026-05-18T12:27:40.988391+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/CQJN7OIAY7XUNHB5UJKEF3LCY5","json":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5.json","graph_json":"https://pith.science/api/pith-number/CQJN7OIAY7XUNHB5UJKEF3LCY5/graph.json","events_json":"https://pith.science/api/pith-number/CQJN7OIAY7XUNHB5UJKEF3LCY5/events.json","paper":"https://pith.science/paper/CQJN7OIA"},"agent_actions":{"view_html":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5","download_json":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5.json","view_paper":"https://pith.science/paper/CQJN7OIA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2118&json=true","fetch_graph":"https://pith.science/api/pith-number/CQJN7OIAY7XUNHB5UJKEF3LCY5/graph.json","fetch_events":"https://pith.science/api/pith-number/CQJN7OIAY7XUNHB5UJKEF3LCY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5/action/storage_attestation","attest_author":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5/action/author_attestation","sign_citation":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5/action/citation_signature","submit_replication":"https://pith.science/pith/CQJN7OIAY7XUNHB5UJKEF3LCY5/action/replication_record"}},"created_at":"2026-05-18T03:10:59.285726+00:00","updated_at":"2026-05-18T03:10:59.285726+00:00"}