{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2001:GMCVAH3QFOPB3CL6E7CIKCPSXQ","short_pith_number":"pith:GMCVAH3Q","schema_version":"1.0","canonical_sha256":"3305501f702b9e1d897e27c48509f2bc287bb34705664d2946455698c106c2fc","source":{"kind":"arxiv","id":"cs/0102006","version":3},"attestation_state":"computed","paper":{"title":"Orderly Spanning Trees with Applications","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ching-Chi Lin, Hsueh-I Lu, Yi-Ting Chiang","submitted_at":"2001-02-07T15:44:49Z","abstract_excerpt":"We introduce and study the {\\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an {\\em orderly pair} for any connected planar graph $G$, consisting of a plane graph $H$ of $G$, and an orderly spanning tree of $H$. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem, (2) the first area-optimal 2-visibility drawing of $G$, an"},"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":"cs/0102006","kind":"arxiv","version":3},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2001-02-07T15:44:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a379232f17029ba6e3394379da06c6e6e7a4afbb5988cdd9e8fffc3e0814ab27","abstract_canon_sha256":"e85cc5df31292dc5bddf1ab110ed7edb9abdbdd54e943563561f631f5d5cf760"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:51.457061Z","signature_b64":"plY19KaE3BZBHS8rd42BaPGzuyLOgiiZxoQepZ3gicFH5Vd+Quyee2eh3IGurduX3m5RCdHZnVYxex83pmE2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3305501f702b9e1d897e27c48509f2bc287bb34705664d2946455698c106c2fc","last_reissued_at":"2026-05-18T02:27:51.456616Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:51.456616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orderly Spanning Trees with Applications","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ching-Chi Lin, Hsueh-I Lu, Yi-Ting Chiang","submitted_at":"2001-02-07T15:44:49Z","abstract_excerpt":"We introduce and study the {\\em orderly spanning trees} of plane graphs. This algorithmic tool generalizes {\\em canonical orderings}, which exist only for triconnected plane graphs. Although not every plane graph admits an orderly spanning tree, we provide an algorithm to compute an {\\em orderly pair} for any connected planar graph $G$, consisting of a plane graph $H$ of $G$, and an orderly spanning tree of $H$. We also present several applications of orderly spanning trees: (1) a new constructive proof for Schnyder's Realizer Theorem, (2) the first area-optimal 2-visibility drawing of $G$, an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0102006","kind":"arxiv","version":3},"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":"cs/0102006","created_at":"2026-05-18T02:27:51.456685+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0102006v3","created_at":"2026-05-18T02:27:51.456685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0102006","created_at":"2026-05-18T02:27:51.456685+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMCVAH3QFOPB","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMCVAH3QFOPB3CL6","created_at":"2026-05-18T12:25:50.254431+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMCVAH3Q","created_at":"2026-05-18T12:25:50.254431+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/GMCVAH3QFOPB3CL6E7CIKCPSXQ","json":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ.json","graph_json":"https://pith.science/api/pith-number/GMCVAH3QFOPB3CL6E7CIKCPSXQ/graph.json","events_json":"https://pith.science/api/pith-number/GMCVAH3QFOPB3CL6E7CIKCPSXQ/events.json","paper":"https://pith.science/paper/GMCVAH3Q"},"agent_actions":{"view_html":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ","download_json":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ.json","view_paper":"https://pith.science/paper/GMCVAH3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0102006&json=true","fetch_graph":"https://pith.science/api/pith-number/GMCVAH3QFOPB3CL6E7CIKCPSXQ/graph.json","fetch_events":"https://pith.science/api/pith-number/GMCVAH3QFOPB3CL6E7CIKCPSXQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/action/storage_attestation","attest_author":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/action/author_attestation","sign_citation":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/action/citation_signature","submit_replication":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/action/replication_record"}},"created_at":"2026-05-18T02:27:51.456685+00:00","updated_at":"2026-05-18T02:27:51.456685+00:00"}