{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:C2JOCH5RIHFXYJSOXUV66ME2KR","short_pith_number":"pith:C2JOCH5R","schema_version":"1.0","canonical_sha256":"1692e11fb141cb7c264ebd2bef309a54440122e038b5d59d7c20d0957b273436","source":{"kind":"arxiv","id":"1608.06462","version":1},"attestation_state":"computed","paper":{"title":"On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aikaterini Karanasiou, Giannis Konstantinos, Loukas Georgiadis, Luigi Laura","submitted_at":"2016-08-23T11:10:10Z","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"},"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":"1608.06462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-23T11:10:10Z","cross_cats_sorted":[],"title_canon_sha256":"88db54ce0a348ce7ab34438574bfaf2c6d9388385930ae506b37f4d9534e1a0f","abstract_canon_sha256":"3aad31d6e51a5068197e31480a3277dad3a5fc92a3f204685b5a767c6dedb203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:13.966977Z","signature_b64":"I20Wtsy6p+9IQpEfyZ6IjtiR/Boo9k/AIiDFDaS5WO4yOwSNlGBl+oShtimjZ03vBCRJzQHzQjTd2m5SAJOhAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1692e11fb141cb7c264ebd2bef309a54440122e038b5d59d7c20d0957b273436","last_reissued_at":"2026-05-18T01:08:13.965783Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:13.965783Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Low-High Orders of Directed Graphs: Incremental Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Aikaterini Karanasiou, Giannis Konstantinos, Loukas Georgiadis, Luigi Laura","submitted_at":"2016-08-23T11:10:10Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.06462","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":"1608.06462","created_at":"2026-05-18T01:08:13.966129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.06462v1","created_at":"2026-05-18T01:08:13.966129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.06462","created_at":"2026-05-18T01:08:13.966129+00:00"},{"alias_kind":"pith_short_12","alias_value":"C2JOCH5RIHFX","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"C2JOCH5RIHFXYJSO","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"C2JOCH5R","created_at":"2026-05-18T12:30:09.641336+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/C2JOCH5RIHFXYJSOXUV66ME2KR","json":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR.json","graph_json":"https://pith.science/api/pith-number/C2JOCH5RIHFXYJSOXUV66ME2KR/graph.json","events_json":"https://pith.science/api/pith-number/C2JOCH5RIHFXYJSOXUV66ME2KR/events.json","paper":"https://pith.science/paper/C2JOCH5R"},"agent_actions":{"view_html":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR","download_json":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR.json","view_paper":"https://pith.science/paper/C2JOCH5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.06462&json=true","fetch_graph":"https://pith.science/api/pith-number/C2JOCH5RIHFXYJSOXUV66ME2KR/graph.json","fetch_events":"https://pith.science/api/pith-number/C2JOCH5RIHFXYJSOXUV66ME2KR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR/action/storage_attestation","attest_author":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR/action/author_attestation","sign_citation":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR/action/citation_signature","submit_replication":"https://pith.science/pith/C2JOCH5RIHFXYJSOXUV66ME2KR/action/replication_record"}},"created_at":"2026-05-18T01:08:13.966129+00:00","updated_at":"2026-05-18T01:08:13.966129+00:00"}