{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NSSJNWRWBZOB2NSVRVAA352XEE","short_pith_number":"pith:NSSJNWRW","schema_version":"1.0","canonical_sha256":"6ca496da360e5c1d36558d400df7572109cb0049cfe8b538afb822aa1ac3655d","source":{"kind":"arxiv","id":"1608.08578","version":1},"attestation_state":"computed","paper":{"title":"Bitonic st-orderings for Upward Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Gronemann","submitted_at":"2016-08-30T17:56:03Z","abstract_excerpt":"Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While $st$-orderings do extend to directed graphs, especially planar $st$-graphs, they do not offer the same properties as canonical orderings. In this work we extend the so called bitonic $st$-orderings to directed graphs. We fully characterize planar $st$-graphs that admit such an ordering and provide a linear-time algorithm for recognition and ordering. If for a graph no bitonic $st$-ordering exists, we show how to f"},"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.08578","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T17:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"d93aa7f2e1c2cf9fac50587ca0646b9e9f79afa69190f5017c75efc506f0540b","abstract_canon_sha256":"006301a100ced07298dfc7ecf6543f7c6c03d6fda5f888ef27a766582ec14e44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:07:17.742366Z","signature_b64":"rhKpHxKkULx+TAoTOG4MYecyrO+g3Gbyynz8tmaqKyQlx0nwUqBPxi/UtaVFdPmF1AcWhhkr+mqPcLITbGREAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6ca496da360e5c1d36558d400df7572109cb0049cfe8b538afb822aa1ac3655d","last_reissued_at":"2026-05-18T01:07:17.741684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:07:17.741684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bitonic st-orderings for Upward Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Martin Gronemann","submitted_at":"2016-08-30T17:56:03Z","abstract_excerpt":"Canonical orderings serve as the basis for many incremental planar drawing algorithms. All these techniques, however, have in common that they are limited to undirected graphs. While $st$-orderings do extend to directed graphs, especially planar $st$-graphs, they do not offer the same properties as canonical orderings. In this work we extend the so called bitonic $st$-orderings to directed graphs. We fully characterize planar $st$-graphs that admit such an ordering and provide a linear-time algorithm for recognition and ordering. If for a graph no bitonic $st$-ordering exists, we show how to f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08578","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.08578","created_at":"2026-05-18T01:07:17.741794+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08578v1","created_at":"2026-05-18T01:07:17.741794+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08578","created_at":"2026-05-18T01:07:17.741794+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSSJNWRWBZOB","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSSJNWRWBZOB2NSV","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSSJNWRW","created_at":"2026-05-18T12:30:36.002864+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/NSSJNWRWBZOB2NSVRVAA352XEE","json":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE.json","graph_json":"https://pith.science/api/pith-number/NSSJNWRWBZOB2NSVRVAA352XEE/graph.json","events_json":"https://pith.science/api/pith-number/NSSJNWRWBZOB2NSVRVAA352XEE/events.json","paper":"https://pith.science/paper/NSSJNWRW"},"agent_actions":{"view_html":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE","download_json":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE.json","view_paper":"https://pith.science/paper/NSSJNWRW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08578&json=true","fetch_graph":"https://pith.science/api/pith-number/NSSJNWRWBZOB2NSVRVAA352XEE/graph.json","fetch_events":"https://pith.science/api/pith-number/NSSJNWRWBZOB2NSVRVAA352XEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/action/storage_attestation","attest_author":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/action/author_attestation","sign_citation":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/action/citation_signature","submit_replication":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/action/replication_record"}},"created_at":"2026-05-18T01:07:17.741794+00:00","updated_at":"2026-05-18T01:07:17.741794+00:00"}