{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4UY2OK6MFERJUYLSYIHDX6K6FZ","short_pith_number":"pith:4UY2OK6M","canonical_record":{"source":{"id":"1204.4997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T08:25:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"89b85f9cd97ca13774c6ec6fd0b3955b7aee2718798290712e0e488f0eb6551d","abstract_canon_sha256":"82b4dd2c138e705e4b013edd757100982688f96d54aa780eca33bdfa91da0c84"},"schema_version":"1.0"},"canonical_sha256":"e531a72bcc29229a6172c20e3bf95e2e50f5a46ac6a2a879fca370d76f12f36b","source":{"kind":"arxiv","id":"1204.4997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4997","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4997v1","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4997","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"4UY2OK6MFERJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4UY2OK6MFERJUYLS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4UY2OK6M","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4UY2OK6MFERJUYLSYIHDX6K6FZ","target":"record","payload":{"canonical_record":{"source":{"id":"1204.4997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T08:25:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"89b85f9cd97ca13774c6ec6fd0b3955b7aee2718798290712e0e488f0eb6551d","abstract_canon_sha256":"82b4dd2c138e705e4b013edd757100982688f96d54aa780eca33bdfa91da0c84"},"schema_version":"1.0"},"canonical_sha256":"e531a72bcc29229a6172c20e3bf95e2e50f5a46ac6a2a879fca370d76f12f36b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:14.957387Z","signature_b64":"xNjlbha3Few49EzgaPfMG+UJ+l9T72fWfhHuB65QwHMzcWwmI4pggiqsrdoIonnPLYtkZV05KYJChoretr5rAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e531a72bcc29229a6172c20e3bf95e2e50f5a46ac6a2a879fca370d76f12f36b","last_reissued_at":"2026-05-18T03:57:14.956845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:14.956845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.4997","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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y0Sv/mV14/q/yIHrWGkIJZeqycwKndDIwgKlZ4KnC3Swmgh9s0OweYBrRW5EimhfMjeH2AhOlJv7dUWOOQU+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:13:24.708335Z"},"content_sha256":"1174060bbce0d87cf56d36df27e141034b954b7a8486512e753a1bc2d05c92ac","schema_version":"1.0","event_id":"sha256:1174060bbce0d87cf56d36df27e141034b954b7a8486512e753a1bc2d05c92ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4UY2OK6MFERJUYLSYIHDX6K6FZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Orthogonal Graph Drawing with Convex Bend Costs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Dorothea Wagner, Ignaz Rutter, Thomas Bl\\\"asius","submitted_at":"2012-04-23T08:25:37Z","abstract_excerpt":"Traditionally, the quality of orthogonal planar drawings is quantified by either the total number of bends, or the maximum number of bends per edge. However, this neglects that in typical applications, edges have varying importance. Moreover, as bend minimization over all planar embeddings is NP-hard, most approaches focus on a fixed planar embedding.\n  We consider the problem OptimalFlexDraw that is defined as follows. Given a planar graph G on n vertices with maximum degree 4 and for each edge e a cost function cost_e : N_0 --> R defining costs depending on the number of bends on e, compute "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4997","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-18T03:57:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QVWLgcMk3vmhnfOMul/qkl4GoTaxmaaCLxvaJUfNIeTCNQoLXVs1vK6Dm1tNIzwNkKxSFBBpkGEp/M0KdKKJAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T14:13:24.708781Z"},"content_sha256":"78f5b1607db81b9dcecb4f134dc522a91da782348eb28b722adbd639bf6c1861","schema_version":"1.0","event_id":"sha256:78f5b1607db81b9dcecb4f134dc522a91da782348eb28b722adbd639bf6c1861"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UY2OK6MFERJUYLSYIHDX6K6FZ/bundle.json","state_url":"https://pith.science/pith/4UY2OK6MFERJUYLSYIHDX6K6FZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UY2OK6MFERJUYLSYIHDX6K6FZ/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-05-26T14:13:24Z","links":{"resolver":"https://pith.science/pith/4UY2OK6MFERJUYLSYIHDX6K6FZ","bundle":"https://pith.science/pith/4UY2OK6MFERJUYLSYIHDX6K6FZ/bundle.json","state":"https://pith.science/pith/4UY2OK6MFERJUYLSYIHDX6K6FZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UY2OK6MFERJUYLSYIHDX6K6FZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4UY2OK6MFERJUYLSYIHDX6K6FZ","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":"82b4dd2c138e705e4b013edd757100982688f96d54aa780eca33bdfa91da0c84","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T08:25:37Z","title_canon_sha256":"89b85f9cd97ca13774c6ec6fd0b3955b7aee2718798290712e0e488f0eb6551d"},"schema_version":"1.0","source":{"id":"1204.4997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.4997","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"arxiv_version","alias_value":"1204.4997v1","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.4997","created_at":"2026-05-18T03:57:14Z"},{"alias_kind":"pith_short_12","alias_value":"4UY2OK6MFERJ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4UY2OK6MFERJUYLS","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4UY2OK6M","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:78f5b1607db81b9dcecb4f134dc522a91da782348eb28b722adbd639bf6c1861","target":"graph","created_at":"2026-05-18T03:57:14Z","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":"Traditionally, the quality of orthogonal planar drawings is quantified by either the total number of bends, or the maximum number of bends per edge. However, this neglects that in typical applications, edges have varying importance. Moreover, as bend minimization over all planar embeddings is NP-hard, most approaches focus on a fixed planar embedding.\n  We consider the problem OptimalFlexDraw that is defined as follows. Given a planar graph G on n vertices with maximum degree 4 and for each edge e a cost function cost_e : N_0 --> R defining costs depending on the number of bends on e, compute ","authors_text":"Dorothea Wagner, Ignaz Rutter, Thomas Bl\\\"asius","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T08:25:37Z","title":"Optimal Orthogonal Graph Drawing with Convex Bend Costs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.4997","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:1174060bbce0d87cf56d36df27e141034b954b7a8486512e753a1bc2d05c92ac","target":"record","created_at":"2026-05-18T03:57:14Z","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":"82b4dd2c138e705e4b013edd757100982688f96d54aa780eca33bdfa91da0c84","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-04-23T08:25:37Z","title_canon_sha256":"89b85f9cd97ca13774c6ec6fd0b3955b7aee2718798290712e0e488f0eb6551d"},"schema_version":"1.0","source":{"id":"1204.4997","kind":"arxiv","version":1}},"canonical_sha256":"e531a72bcc29229a6172c20e3bf95e2e50f5a46ac6a2a879fca370d76f12f36b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e531a72bcc29229a6172c20e3bf95e2e50f5a46ac6a2a879fca370d76f12f36b","first_computed_at":"2026-05-18T03:57:14.956845Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:14.956845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xNjlbha3Few49EzgaPfMG+UJ+l9T72fWfhHuB65QwHMzcWwmI4pggiqsrdoIonnPLYtkZV05KYJChoretr5rAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:14.957387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.4997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1174060bbce0d87cf56d36df27e141034b954b7a8486512e753a1bc2d05c92ac","sha256:78f5b1607db81b9dcecb4f134dc522a91da782348eb28b722adbd639bf6c1861"],"state_sha256":"4dcdd74a397a63b700c1f3ff0631925c180b2a01f6f67bc7c480421a67e68425"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6sdozOwz/IYY7WxgKfxeVR7SDOSN6y2L7lNdTV3DgsTV2N5j7y9DJgfKX/gGGOkQKPQWQX4yr+8wrbCe/4mcCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T14:13:24.711820Z","bundle_sha256":"7ac48558105ce160caeb1cbc7f4373a91bd2cb165aaed2f4b03dd54852cff620"}}