{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:C2JOCH5RIHFXYJSOXUV66ME2KR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"3aad31d6e51a5068197e31480a3277dad3a5fc92a3f204685b5a767c6dedb203","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T11:10:10Z","title_canon_sha256":"88db54ce0a348ce7ab34438574bfaf2c6d9388385930ae506b37f4d9534e1a0f"},"schema_version":"1.0","source":{"id":"1608.06462","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.06462","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.06462v1","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06462","created_at":"2026-05-18T01:08:13Z"},{"alias_kind":"pith_short_12","alias_value":"C2JOCH5RIHFX","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_16","alias_value":"C2JOCH5RIHFXYJSO","created_at":"2026-05-18T12:30:09Z"},{"alias_kind":"pith_short_8","alias_value":"C2JOCH5R","created_at":"2026-05-18T12:30:09Z"}],"graph_snapshots":[{"event_id":"sha256:1dd96bd79b73a1270082010736e617063da5e6f5278e7e9991679598f1db3c00","target":"graph","created_at":"2026-05-18T01:08:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"A flow graph $G=(V,E,s)$ is a directed graph with a distinguished start vertex $s$. The dominator tree $D$ of $G$ is a tree rooted at $s$, such that a vertex $v$ is an ancestor of a vertex $w$ if and only if all paths from $s$ to $w$ include $v$. The dominator tree is a central tool in program optimization and code generation and has many applications in other diverse areas including constraint programming, circuit testing, biology, and in algorithms for graph connectivity problems. A low-high order of $G$ is a preorder $\\delta$ of $D$ that certifies the correctness of $D$ and has further appl","authors_text":"Aikaterini Karanasiou, Giannis Konstantinos, Loukas Georgiadis, Luigi Laura","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T11:10:10Z","title":"On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06462","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dc48f1d0a3c3060176b7168214ebc9ce6e100a6d2abc5c352b0fb064b5a056dc","target":"record","created_at":"2026-05-18T01:08:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"3aad31d6e51a5068197e31480a3277dad3a5fc92a3f204685b5a767c6dedb203","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T11:10:10Z","title_canon_sha256":"88db54ce0a348ce7ab34438574bfaf2c6d9388385930ae506b37f4d9534e1a0f"},"schema_version":"1.0","source":{"id":"1608.06462","kind":"arxiv","version":1}},"canonical_sha256":"1692e11fb141cb7c264ebd2bef309a54440122e038b5d59d7c20d0957b273436","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1692e11fb141cb7c264ebd2bef309a54440122e038b5d59d7c20d0957b273436","first_computed_at":"2026-05-18T01:08:13.965783Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:13.965783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"I20Wtsy6p+9IQpEfyZ6IjtiR/Boo9k/AIiDFDaS5WO4yOwSNlGBl+oShtimjZ03vBCRJzQHzQjTd2m5SAJOhAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:13.966977Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.06462","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc48f1d0a3c3060176b7168214ebc9ce6e100a6d2abc5c352b0fb064b5a056dc","sha256:1dd96bd79b73a1270082010736e617063da5e6f5278e7e9991679598f1db3c00"],"state_sha256":"2ffc3c518aed3c499dd0a86e3a1ca403ba3298a9e4497e9034ef07b4c4707b1f"}