{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TNDKNIEP27EWLLYUG6AYGFIE3B","short_pith_number":"pith:TNDKNIEP","canonical_record":{"source":{"id":"1708.09167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T08:39:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"637c4551ce549c83587f022162a0d6c71e6baa307c933d4c2c75dac67a728ffa","abstract_canon_sha256":"6c90005ef5314b54f67917a44c8e15eb1d0e8269708ea0d7e51137c343222d1b"},"schema_version":"1.0"},"canonical_sha256":"9b46a6a08fd7c965af143781831504d8538615588451ee3d7ec62c417a84c0ef","source":{"kind":"arxiv","id":"1708.09167","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09167","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09167v1","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09167","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"TNDKNIEP27EW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNDKNIEP27EWLLYU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNDKNIEP","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TNDKNIEP27EWLLYUG6AYGFIE3B","target":"record","payload":{"canonical_record":{"source":{"id":"1708.09167","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T08:39:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"637c4551ce549c83587f022162a0d6c71e6baa307c933d4c2c75dac67a728ffa","abstract_canon_sha256":"6c90005ef5314b54f67917a44c8e15eb1d0e8269708ea0d7e51137c343222d1b"},"schema_version":"1.0"},"canonical_sha256":"9b46a6a08fd7c965af143781831504d8538615588451ee3d7ec62c417a84c0ef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:20.755170Z","signature_b64":"pp27W3pkbOPVP+vVLWEEfsog+TUyXTCiFO+5ZdWRh27ALFN1fEWnL+Yp2YxBoIm/x17rt25pfRGI0Tmd/KC0AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b46a6a08fd7c965af143781831504d8538615588451ee3d7ec62c417a84c0ef","last_reissued_at":"2026-05-18T00:36:20.754530Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:20.754530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.09167","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-18T00:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+g1eZPkqL5kpqwn5dY0YqwYz5F80hWjcboGgEwm+17vxBzAQvJmej4DXnMpYBtMmKs3sqHmpgm+XGOAWt8PeDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:55:02.368142Z"},"content_sha256":"7990a0e2acfa83fa992d61875343867cb7745e725ca8a48975d5a355c3aa0dc8","schema_version":"1.0","event_id":"sha256:7990a0e2acfa83fa992d61875343867cb7745e725ca8a48975d5a355c3aa0dc8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TNDKNIEP27EWLLYUG6AYGFIE3B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Colored Point-set Embeddings of Acyclic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CG","authors_text":"Alfredo Navarra, Emilio Di Giacomo, Giuseppe Liotta, Leszek Gasieniec","submitted_at":"2017-08-30T08:39:49Z","abstract_excerpt":"We show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $\\Omega(n^\\frac{2}{3})$ edges each having $\\Omega(n^\\frac{1}{3})$ bends in the worst case. The lower bound holds even when the function that maps vertices to points is not a bijection but it is defined by a 3-coloring. In contrast, a constant number of bends per edge can be obtained for 3-colored paths and for 3-colored caterpillars whose leaves all have the same color. Such results answer to a long standing open problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09167","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-18T00:36:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gsEUQLW0pWTrQeLO//GLQ1TY9EWkol8BEJqqye8IFvkbNZDCE53mITKkOeb6ZkS4W+t8vHxujbu84txXutXSDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T06:55:02.368875Z"},"content_sha256":"3b4a20623842ae2e59c0851e876ac20282b86e32ee73b3dc0697d6bc1150dc6d","schema_version":"1.0","event_id":"sha256:3b4a20623842ae2e59c0851e876ac20282b86e32ee73b3dc0697d6bc1150dc6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNDKNIEP27EWLLYUG6AYGFIE3B/bundle.json","state_url":"https://pith.science/pith/TNDKNIEP27EWLLYUG6AYGFIE3B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNDKNIEP27EWLLYUG6AYGFIE3B/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-09T06:55:02Z","links":{"resolver":"https://pith.science/pith/TNDKNIEP27EWLLYUG6AYGFIE3B","bundle":"https://pith.science/pith/TNDKNIEP27EWLLYUG6AYGFIE3B/bundle.json","state":"https://pith.science/pith/TNDKNIEP27EWLLYUG6AYGFIE3B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNDKNIEP27EWLLYUG6AYGFIE3B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TNDKNIEP27EWLLYUG6AYGFIE3B","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":"6c90005ef5314b54f67917a44c8e15eb1d0e8269708ea0d7e51137c343222d1b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T08:39:49Z","title_canon_sha256":"637c4551ce549c83587f022162a0d6c71e6baa307c933d4c2c75dac67a728ffa"},"schema_version":"1.0","source":{"id":"1708.09167","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09167","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09167v1","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09167","created_at":"2026-05-18T00:36:20Z"},{"alias_kind":"pith_short_12","alias_value":"TNDKNIEP27EW","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TNDKNIEP27EWLLYU","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TNDKNIEP","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:3b4a20623842ae2e59c0851e876ac20282b86e32ee73b3dc0697d6bc1150dc6d","target":"graph","created_at":"2026-05-18T00:36:20Z","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 show that any planar drawing of a forest of three stars whose vertices are constrained to be at fixed vertex locations may require $\\Omega(n^\\frac{2}{3})$ edges each having $\\Omega(n^\\frac{1}{3})$ bends in the worst case. The lower bound holds even when the function that maps vertices to points is not a bijection but it is defined by a 3-coloring. In contrast, a constant number of bends per edge can be obtained for 3-colored paths and for 3-colored caterpillars whose leaves all have the same color. Such results answer to a long standing open problem.","authors_text":"Alfredo Navarra, Emilio Di Giacomo, Giuseppe Liotta, Leszek Gasieniec","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T08:39:49Z","title":"Colored Point-set Embeddings of Acyclic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09167","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:7990a0e2acfa83fa992d61875343867cb7745e725ca8a48975d5a355c3aa0dc8","target":"record","created_at":"2026-05-18T00:36:20Z","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":"6c90005ef5314b54f67917a44c8e15eb1d0e8269708ea0d7e51137c343222d1b","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-30T08:39:49Z","title_canon_sha256":"637c4551ce549c83587f022162a0d6c71e6baa307c933d4c2c75dac67a728ffa"},"schema_version":"1.0","source":{"id":"1708.09167","kind":"arxiv","version":1}},"canonical_sha256":"9b46a6a08fd7c965af143781831504d8538615588451ee3d7ec62c417a84c0ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b46a6a08fd7c965af143781831504d8538615588451ee3d7ec62c417a84c0ef","first_computed_at":"2026-05-18T00:36:20.754530Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:20.754530Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pp27W3pkbOPVP+vVLWEEfsog+TUyXTCiFO+5ZdWRh27ALFN1fEWnL+Yp2YxBoIm/x17rt25pfRGI0Tmd/KC0AA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:20.755170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09167","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7990a0e2acfa83fa992d61875343867cb7745e725ca8a48975d5a355c3aa0dc8","sha256:3b4a20623842ae2e59c0851e876ac20282b86e32ee73b3dc0697d6bc1150dc6d"],"state_sha256":"51b8cffece599d277410596a9518b6c82b57f6590798cc0f6d14739b46ac4a39"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hj+G8ZHRGCuejXSMK5TyEkVW/6p5wsVSeJpCIf4ghPbXNpuGqMRrOsZOt2V+BIc/ITVwua8+nEzSe8uMiC0GBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T06:55:02.372744Z","bundle_sha256":"aeb466d37a6f4ef2583f95b07cfd68fffa89cd234b94658dcd5c9fcdc0d6769a"}}