{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2001:GMCVAH3QFOPB3CL6E7CIKCPSXQ","short_pith_number":"pith:GMCVAH3Q","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"},"canonical_sha256":"3305501f702b9e1d897e27c48509f2bc287bb34705664d2946455698c106c2fc","source":{"kind":"arxiv","id":"cs/0102006","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0102006","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0102006v3","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0102006","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"GMCVAH3QFOPB","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GMCVAH3QFOPB3CL6","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GMCVAH3Q","created_at":"2026-05-18T12:25:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2001:GMCVAH3QFOPB3CL6E7CIKCPSXQ","target":"record","payload":{"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"},"canonical_sha256":"3305501f702b9e1d897e27c48509f2bc287bb34705664d2946455698c106c2fc","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"},"source_kind":"arxiv","source_id":"cs/0102006","source_version":3,"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-18T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WEERTd1vFcsbNuz99gW+i1rzqZKBeeQkk5JtNGTMcZlD0ZFMIGANozv1c+AXj+g4BC90ySSrgB+78SA2EaS2DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:25:06.775176Z"},"content_sha256":"e258c9c746aba23a59d775a9a75e298597ac68a0ac87c53e8fd3ac0a399d3f5e","schema_version":"1.0","event_id":"sha256:e258c9c746aba23a59d775a9a75e298597ac68a0ac87c53e8fd3ac0a399d3f5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2001:GMCVAH3QFOPB3CL6E7CIKCPSXQ","target":"graph","payload":{"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"},"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-18T02:27:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+NNEHdc7oIKFPpoAyqrnbOlusZxUO0YEz09TC119y2PdZ+saRZsm0ihaHyloc6UvDuXzN8GXNi+sPUYGr0uvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T10:25:06.775552Z"},"content_sha256":"600e83365710da6a5c3bfa539618e13aac3491a963de357f426df6f1e703ca77","schema_version":"1.0","event_id":"sha256:600e83365710da6a5c3bfa539618e13aac3491a963de357f426df6f1e703ca77"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/bundle.json","state_url":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/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-07-03T10:25:06Z","links":{"resolver":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ","bundle":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/bundle.json","state":"https://pith.science/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GMCVAH3QFOPB3CL6E7CIKCPSXQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2001:GMCVAH3QFOPB3CL6E7CIKCPSXQ","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":"e85cc5df31292dc5bddf1ab110ed7edb9abdbdd54e943563561f631f5d5cf760","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2001-02-07T15:44:49Z","title_canon_sha256":"a379232f17029ba6e3394379da06c6e6e7a4afbb5988cdd9e8fffc3e0814ab27"},"schema_version":"1.0","source":{"id":"cs/0102006","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0102006","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0102006v3","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0102006","created_at":"2026-05-18T02:27:51Z"},{"alias_kind":"pith_short_12","alias_value":"GMCVAH3QFOPB","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_16","alias_value":"GMCVAH3QFOPB3CL6","created_at":"2026-05-18T12:25:50Z"},{"alias_kind":"pith_short_8","alias_value":"GMCVAH3Q","created_at":"2026-05-18T12:25:50Z"}],"graph_snapshots":[{"event_id":"sha256:600e83365710da6a5c3bfa539618e13aac3491a963de357f426df6f1e703ca77","target":"graph","created_at":"2026-05-18T02:27:51Z","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":"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","authors_text":"Ching-Chi Lin, Hsueh-I Lu, Yi-Ting Chiang","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2001-02-07T15:44:49Z","title":"Orderly Spanning Trees with Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0102006","kind":"arxiv","version":3},"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:e258c9c746aba23a59d775a9a75e298597ac68a0ac87c53e8fd3ac0a399d3f5e","target":"record","created_at":"2026-05-18T02:27:51Z","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":"e85cc5df31292dc5bddf1ab110ed7edb9abdbdd54e943563561f631f5d5cf760","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2001-02-07T15:44:49Z","title_canon_sha256":"a379232f17029ba6e3394379da06c6e6e7a4afbb5988cdd9e8fffc3e0814ab27"},"schema_version":"1.0","source":{"id":"cs/0102006","kind":"arxiv","version":3}},"canonical_sha256":"3305501f702b9e1d897e27c48509f2bc287bb34705664d2946455698c106c2fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3305501f702b9e1d897e27c48509f2bc287bb34705664d2946455698c106c2fc","first_computed_at":"2026-05-18T02:27:51.456616Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:51.456616Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"plY19KaE3BZBHS8rd42BaPGzuyLOgiiZxoQepZ3gicFH5Vd+Quyee2eh3IGurduX3m5RCdHZnVYxex83pmE2Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:51.457061Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0102006","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e258c9c746aba23a59d775a9a75e298597ac68a0ac87c53e8fd3ac0a399d3f5e","sha256:600e83365710da6a5c3bfa539618e13aac3491a963de357f426df6f1e703ca77"],"state_sha256":"eb90a59c96dd274819c27fca6c4af8c0f971a10c9951b2a529cd5ebd7ce158ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oWte+H68D9YRuECGGc4gJ045l7BtmgUO9q87h68gqipTlIryjFYpC8cqY6LOQrxmFIEO1E/3S5s3YoxC79ORDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T10:25:06.777500Z","bundle_sha256":"05b80f26720b82a1acd62081ee79911bddf9c3acdf9fd5976998911976ab7d30"}}