{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NSSJNWRWBZOB2NSVRVAA352XEE","short_pith_number":"pith:NSSJNWRW","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"},"canonical_sha256":"6ca496da360e5c1d36558d400df7572109cb0049cfe8b538afb822aa1ac3655d","source":{"kind":"arxiv","id":"1608.08578","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08578","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08578v1","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08578","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"NSSJNWRWBZOB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NSSJNWRWBZOB2NSV","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NSSJNWRW","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NSSJNWRWBZOB2NSVRVAA352XEE","target":"record","payload":{"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"},"canonical_sha256":"6ca496da360e5c1d36558d400df7572109cb0049cfe8b538afb822aa1ac3655d","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"},"source_kind":"arxiv","source_id":"1608.08578","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jln6yHURLe4Bw+nuON4uKE/kSjG5z7JjHk1EbR/elfxA9WDu+It9DqsQYZcXqzFIzlv5JvhpoBTzH0l6orTSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:10:53.898995Z"},"content_sha256":"4a88da9c34924da373974662c85df11584fe3365dc3c831f19dbf6b108b16b56","schema_version":"1.0","event_id":"sha256:4a88da9c34924da373974662c85df11584fe3365dc3c831f19dbf6b108b16b56"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NSSJNWRWBZOB2NSVRVAA352XEE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:07:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RO9FzaVEtY+RZOToJWxtvmjIfl/U9q457R8HvJq8vVIFylFIVnWbj9LjTjXt2n0IqtYsHkyFgb9t3ZOBYDfMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T02:10:53.899367Z"},"content_sha256":"4c00bff8a6a4874c9c7d7b07a90930e49525e0d269604cb252acf6c3e0a9fdd3","schema_version":"1.0","event_id":"sha256:4c00bff8a6a4874c9c7d7b07a90930e49525e0d269604cb252acf6c3e0a9fdd3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/bundle.json","state_url":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSSJNWRWBZOB2NSVRVAA352XEE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-26T02:10:53Z","links":{"resolver":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE","bundle":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/bundle.json","state":"https://pith.science/pith/NSSJNWRWBZOB2NSVRVAA352XEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSSJNWRWBZOB2NSVRVAA352XEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NSSJNWRWBZOB2NSVRVAA352XEE","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":"006301a100ced07298dfc7ecf6543f7c6c03d6fda5f888ef27a766582ec14e44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T17:56:03Z","title_canon_sha256":"d93aa7f2e1c2cf9fac50587ca0646b9e9f79afa69190f5017c75efc506f0540b"},"schema_version":"1.0","source":{"id":"1608.08578","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.08578","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"arxiv_version","alias_value":"1608.08578v1","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08578","created_at":"2026-05-18T01:07:17Z"},{"alias_kind":"pith_short_12","alias_value":"NSSJNWRWBZOB","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NSSJNWRWBZOB2NSV","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NSSJNWRW","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:4c00bff8a6a4874c9c7d7b07a90930e49525e0d269604cb252acf6c3e0a9fdd3","target":"graph","created_at":"2026-05-18T01:07:17Z","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":"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","authors_text":"Martin Gronemann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T17:56:03Z","title":"Bitonic st-orderings for Upward Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08578","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:4a88da9c34924da373974662c85df11584fe3365dc3c831f19dbf6b108b16b56","target":"record","created_at":"2026-05-18T01:07:17Z","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":"006301a100ced07298dfc7ecf6543f7c6c03d6fda5f888ef27a766582ec14e44","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-30T17:56:03Z","title_canon_sha256":"d93aa7f2e1c2cf9fac50587ca0646b9e9f79afa69190f5017c75efc506f0540b"},"schema_version":"1.0","source":{"id":"1608.08578","kind":"arxiv","version":1}},"canonical_sha256":"6ca496da360e5c1d36558d400df7572109cb0049cfe8b538afb822aa1ac3655d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6ca496da360e5c1d36558d400df7572109cb0049cfe8b538afb822aa1ac3655d","first_computed_at":"2026-05-18T01:07:17.741684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:07:17.741684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rhKpHxKkULx+TAoTOG4MYecyrO+g3Gbyynz8tmaqKyQlx0nwUqBPxi/UtaVFdPmF1AcWhhkr+mqPcLITbGREAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:07:17.742366Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.08578","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a88da9c34924da373974662c85df11584fe3365dc3c831f19dbf6b108b16b56","sha256:4c00bff8a6a4874c9c7d7b07a90930e49525e0d269604cb252acf6c3e0a9fdd3"],"state_sha256":"202fbac0492b54b60add3ed1ed1289fd10466c2fcc18b24edf82e64e8b8a5f5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Y2vUkrGXOMqW3/UqbuROYj3mEb8pgZyNBwHkqm533yDQnO8OygYln+Sunoi4c3BVn3rQ0B5ij165yA7Mf51CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T02:10:53.901370Z","bundle_sha256":"aa284bf57680f24f526a5ce431b297a74ebc30132245f927e240a8dd47d997f4"}}