{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SX6NPML3DFC4FJAQTICZ2PHXHA","short_pith_number":"pith:SX6NPML3","schema_version":"1.0","canonical_sha256":"95fcd7b17b1945c2a4109a059d3cf7383f3245b0161aa2047f8588295e494a5a","source":{"kind":"arxiv","id":"1604.02711","version":1},"attestation_state":"computed","paper":{"title":"An Experimental Study of Dynamic Dominators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Federico Santaroni, Giuseppe F. Italiano, Loukas Georgiadis, Luigi Laura","submitted_at":"2016-04-10T15:56:43Z","abstract_excerpt":"Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and deletions of edges. Our main theoretical contribution is a simple incremental algorithm that maintains the dominator tree of a flow graph with $n$ vertices through a sequence of $k$ edge insertions in $O(m\\min\\{n,k\\}+kn)$ time, where $m$ is the total number of edges after all insertions. Moreover, we can test in constant time if a vertex $u$ dominates a vertex $v$, for any pair of query vertices $u$ and $v$. Next, we p"},"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":"1604.02711","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-10T15:56:43Z","cross_cats_sorted":[],"title_canon_sha256":"f3eb525d7d68ca1c766e638ff0bd12522d43b9e07b5d19826b8e86b87a4de174","abstract_canon_sha256":"c4e19b75ada4cce71e13ca6eba5ff0ee83f3d3148c8e4e8b59cfb35eb6084100"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:22.364965Z","signature_b64":"YDLxSxI6BUJDOhmwcOuWxsn2NHBFb+UqIs2SZyVEdpJwB5NDcP8BW/qFwulmtC/g8NRUR81Ym4XjIhpOo2HnDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95fcd7b17b1945c2a4109a059d3cf7383f3245b0161aa2047f8588295e494a5a","last_reissued_at":"2026-05-18T01:17:22.364510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:22.364510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Experimental Study of Dynamic Dominators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Federico Santaroni, Giuseppe F. Italiano, Loukas Georgiadis, Luigi Laura","submitted_at":"2016-04-10T15:56:43Z","abstract_excerpt":"Motivated by recent applications of dominator computations, we consider the problem of dynamically maintaining the dominators of flow graphs through a sequence of insertions and deletions of edges. Our main theoretical contribution is a simple incremental algorithm that maintains the dominator tree of a flow graph with $n$ vertices through a sequence of $k$ edge insertions in $O(m\\min\\{n,k\\}+kn)$ time, where $m$ is the total number of edges after all insertions. Moreover, we can test in constant time if a vertex $u$ dominates a vertex $v$, for any pair of query vertices $u$ and $v$. Next, we p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02711","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":"1604.02711","created_at":"2026-05-18T01:17:22.364580+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.02711v1","created_at":"2026-05-18T01:17:22.364580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02711","created_at":"2026-05-18T01:17:22.364580+00:00"},{"alias_kind":"pith_short_12","alias_value":"SX6NPML3DFC4","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SX6NPML3DFC4FJAQ","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SX6NPML3","created_at":"2026-05-18T12:30:44.179134+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/SX6NPML3DFC4FJAQTICZ2PHXHA","json":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA.json","graph_json":"https://pith.science/api/pith-number/SX6NPML3DFC4FJAQTICZ2PHXHA/graph.json","events_json":"https://pith.science/api/pith-number/SX6NPML3DFC4FJAQTICZ2PHXHA/events.json","paper":"https://pith.science/paper/SX6NPML3"},"agent_actions":{"view_html":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA","download_json":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA.json","view_paper":"https://pith.science/paper/SX6NPML3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.02711&json=true","fetch_graph":"https://pith.science/api/pith-number/SX6NPML3DFC4FJAQTICZ2PHXHA/graph.json","fetch_events":"https://pith.science/api/pith-number/SX6NPML3DFC4FJAQTICZ2PHXHA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA/action/storage_attestation","attest_author":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA/action/author_attestation","sign_citation":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA/action/citation_signature","submit_replication":"https://pith.science/pith/SX6NPML3DFC4FJAQTICZ2PHXHA/action/replication_record"}},"created_at":"2026-05-18T01:17:22.364580+00:00","updated_at":"2026-05-18T01:17:22.364580+00:00"}