{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PDPBZLCHATNND5LJKBN5EIMTIH","short_pith_number":"pith:PDPBZLCH","canonical_record":{"source":{"id":"1301.3471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-15T20:06:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8bc106e448fbb54eda3bf7e33f83464560e8edd60f2c12f73e2b69a6ef1174fa","abstract_canon_sha256":"3ee0808da5d221b97d884d3e79b481ee162bca7b64176f0762d010d25a87168d"},"schema_version":"1.0"},"canonical_sha256":"78de1cac4704dad1f569505bd2219341c85b8877a675205635ef03e42e37843c","source":{"kind":"arxiv","id":"1301.3471","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3471","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3471v2","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3471","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"PDPBZLCHATNN","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PDPBZLCHATNND5LJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PDPBZLCH","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PDPBZLCHATNND5LJKBN5EIMTIH","target":"record","payload":{"canonical_record":{"source":{"id":"1301.3471","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-15T20:06:36Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8bc106e448fbb54eda3bf7e33f83464560e8edd60f2c12f73e2b69a6ef1174fa","abstract_canon_sha256":"3ee0808da5d221b97d884d3e79b481ee162bca7b64176f0762d010d25a87168d"},"schema_version":"1.0"},"canonical_sha256":"78de1cac4704dad1f569505bd2219341c85b8877a675205635ef03e42e37843c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:50.245746Z","signature_b64":"Fhn5FBw71ErRyY4nW2pNPDqYWC7q4vLv3RwGRzltSFGAzuii8BjeDV2yXniydMVOK/l2T9nb+L3wlyllg3ZPDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78de1cac4704dad1f569505bd2219341c85b8877a675205635ef03e42e37843c","last_reissued_at":"2026-05-18T03:09:50.244775Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:50.244775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.3471","source_version":2,"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-18T03:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ELDvHppE/+xcF6NS3Erld5ldIaahIFiW59YAgff5lAodL4H6TZ4qq7yyqpVUNm3Kl/lX/GyBTfFk77aPt7r4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:37:26.917172Z"},"content_sha256":"0ee9ec0055fe8bb888970b429bcc3ef9a61598d9e083fcf6ae9878864828ad81","schema_version":"1.0","event_id":"sha256:0ee9ec0055fe8bb888970b429bcc3ef9a61598d9e083fcf6ae9878864828ad81"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PDPBZLCHATNND5LJKBN5EIMTIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Embedding a balanced binary tree on a bounded point set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Alireza Bagheri, Fatemeh Rajabi-Alni","submitted_at":"2013-01-15T20:06:36Z","abstract_excerpt":"Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P, a point-set embedding of G on S is a planar drawing of G such that each vertex is mapped to a distinct point of S and the edges are polygonal chains surrounded by P. A special case of the embedding problem is that in which G is a balanced binary tree. In this paper, we present a new algorithm for embedding an n-vertex balanced binary tree BBT on a set S of n points bounded by a simple m-gon P in O(m^2 + n(log n)^2 + mn) time with at most O(m) bends per edge."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3471","kind":"arxiv","version":2},"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-18T03:09:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7HRRPURtyrJZO4pjTjG5EkOWCGeHVypZxrAg1LHtigT4LcgvUmMUniWCJbLuh/A3sYScTFzbhr5AFoKW94gDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T11:37:26.917528Z"},"content_sha256":"3827c6f38513d921b00fc6a2803ee460e673d6756d1b6ee6d29742b321cf1f13","schema_version":"1.0","event_id":"sha256:3827c6f38513d921b00fc6a2803ee460e673d6756d1b6ee6d29742b321cf1f13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PDPBZLCHATNND5LJKBN5EIMTIH/bundle.json","state_url":"https://pith.science/pith/PDPBZLCHATNND5LJKBN5EIMTIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PDPBZLCHATNND5LJKBN5EIMTIH/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-20T11:37:26Z","links":{"resolver":"https://pith.science/pith/PDPBZLCHATNND5LJKBN5EIMTIH","bundle":"https://pith.science/pith/PDPBZLCHATNND5LJKBN5EIMTIH/bundle.json","state":"https://pith.science/pith/PDPBZLCHATNND5LJKBN5EIMTIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PDPBZLCHATNND5LJKBN5EIMTIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PDPBZLCHATNND5LJKBN5EIMTIH","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":"3ee0808da5d221b97d884d3e79b481ee162bca7b64176f0762d010d25a87168d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-15T20:06:36Z","title_canon_sha256":"8bc106e448fbb54eda3bf7e33f83464560e8edd60f2c12f73e2b69a6ef1174fa"},"schema_version":"1.0","source":{"id":"1301.3471","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.3471","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"arxiv_version","alias_value":"1301.3471v2","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.3471","created_at":"2026-05-18T03:09:50Z"},{"alias_kind":"pith_short_12","alias_value":"PDPBZLCHATNN","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PDPBZLCHATNND5LJ","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PDPBZLCH","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:3827c6f38513d921b00fc6a2803ee460e673d6756d1b6ee6d29742b321cf1f13","target":"graph","created_at":"2026-05-18T03:09:50Z","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":"Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P, a point-set embedding of G on S is a planar drawing of G such that each vertex is mapped to a distinct point of S and the edges are polygonal chains surrounded by P. A special case of the embedding problem is that in which G is a balanced binary tree. In this paper, we present a new algorithm for embedding an n-vertex balanced binary tree BBT on a set S of n points bounded by a simple m-gon P in O(m^2 + n(log n)^2 + mn) time with at most O(m) bends per edge.","authors_text":"Alireza Bagheri, Fatemeh Rajabi-Alni","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-15T20:06:36Z","title":"Embedding a balanced binary tree on a bounded point set"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.3471","kind":"arxiv","version":2},"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:0ee9ec0055fe8bb888970b429bcc3ef9a61598d9e083fcf6ae9878864828ad81","target":"record","created_at":"2026-05-18T03:09:50Z","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":"3ee0808da5d221b97d884d3e79b481ee162bca7b64176f0762d010d25a87168d","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-01-15T20:06:36Z","title_canon_sha256":"8bc106e448fbb54eda3bf7e33f83464560e8edd60f2c12f73e2b69a6ef1174fa"},"schema_version":"1.0","source":{"id":"1301.3471","kind":"arxiv","version":2}},"canonical_sha256":"78de1cac4704dad1f569505bd2219341c85b8877a675205635ef03e42e37843c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78de1cac4704dad1f569505bd2219341c85b8877a675205635ef03e42e37843c","first_computed_at":"2026-05-18T03:09:50.244775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:50.244775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fhn5FBw71ErRyY4nW2pNPDqYWC7q4vLv3RwGRzltSFGAzuii8BjeDV2yXniydMVOK/l2T9nb+L3wlyllg3ZPDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:50.245746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.3471","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee9ec0055fe8bb888970b429bcc3ef9a61598d9e083fcf6ae9878864828ad81","sha256:3827c6f38513d921b00fc6a2803ee460e673d6756d1b6ee6d29742b321cf1f13"],"state_sha256":"e108b788067e9732d9b8666c9fc77aac5f9081d645a76a913ea219a298bd2b60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CBFWt+ymNJduWyBbD0qisJZfDF9c0jJbCWFZOFNp6ndGGdJZaUiG0GbuovQHm6dNsMxBXZRKUzFXrD7azJQFAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T11:37:26.919428Z","bundle_sha256":"98d189836b5a8af37e68066a4e95d58a2da16fbf568c9d665b6b93c2cf52af4d"}}