{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AEKEWLP7CQZ4TSLSCPTASBYO4Y","short_pith_number":"pith:AEKEWLP7","canonical_record":{"source":{"id":"1903.05048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-12T16:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"2cfaa9a4fa50c3395369302fd9c4faab70bc30b52b029586afeae7a8860402cb","abstract_canon_sha256":"617bfc02d91959e10ac0a9d11f5c72e2e6d64611776c2ee424051198d9e42fdb"},"schema_version":"1.0"},"canonical_sha256":"01144b2dff1433c9c97213e609070ee612b0134c58b110719033b71d3905835c","source":{"kind":"arxiv","id":"1903.05048","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05048","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05048v1","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05048","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"AEKEWLP7CQZ4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AEKEWLP7CQZ4TSLS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AEKEWLP7","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AEKEWLP7CQZ4TSLSCPTASBYO4Y","target":"record","payload":{"canonical_record":{"source":{"id":"1903.05048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-12T16:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"2cfaa9a4fa50c3395369302fd9c4faab70bc30b52b029586afeae7a8860402cb","abstract_canon_sha256":"617bfc02d91959e10ac0a9d11f5c72e2e6d64611776c2ee424051198d9e42fdb"},"schema_version":"1.0"},"canonical_sha256":"01144b2dff1433c9c97213e609070ee612b0134c58b110719033b71d3905835c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:26.446771Z","signature_b64":"PHhZm9RjwSsO28+U4FYZ3CRaUekVDKfhQwuyKPDkbvin3+XbyrmlJmzopyKbb/029QiEkSE50hcmeRer3dthCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01144b2dff1433c9c97213e609070ee612b0134c58b110719033b71d3905835c","last_reissued_at":"2026-05-17T23:51:26.446216Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:26.446216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.05048","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-17T23:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zKd+tkyROV+dXperSXjgcNkUHp/J0LBbV8mtzXkVFhUkT2+ezJkOiYk2KpjuL8VO4NHymSn4lVk+erv0SDEgAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:55:30.319071Z"},"content_sha256":"c1fc81ebc5620068ec6441376bf143e22363e91c146ba22315e178f4bc6d04f1","schema_version":"1.0","event_id":"sha256:c1fc81ebc5620068ec6441376bf143e22363e91c146ba22315e178f4bc6d04f1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AEKEWLP7CQZ4TSLSCPTASBYO4Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Algorithms for Ortho-Radial Graph Drawing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Benjamin Niedermann, Ignaz Rutter, Matthias Wolf","submitted_at":"2019-03-12T16:55:46Z","abstract_excerpt":"Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the existence of an orthogonal representation that allows to describe such drawings purely combinatorially by only listing the angles between the edges around each vertex and the directions of bends on the edges, but neglecting any kind of geometric information such as vertex coordinates or edge lengths. Barth et al. [2] have established the existence of an anal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05048","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-17T23:51:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"65eNJZyf+dq9bSofgi5kiSm5GyBZfQSADPh75p+XtUJe6fsw/y62ShkmZCpwL5iEBlz9NZjTdTvlD62JPKzdCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:55:30.319433Z"},"content_sha256":"4f979851f91e3e2e1e11cbd0f4f9af6fdd47e919e453283cf07a9e6dc912fa46","schema_version":"1.0","event_id":"sha256:4f979851f91e3e2e1e11cbd0f4f9af6fdd47e919e453283cf07a9e6dc912fa46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AEKEWLP7CQZ4TSLSCPTASBYO4Y/bundle.json","state_url":"https://pith.science/pith/AEKEWLP7CQZ4TSLSCPTASBYO4Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AEKEWLP7CQZ4TSLSCPTASBYO4Y/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-30T20:55:30Z","links":{"resolver":"https://pith.science/pith/AEKEWLP7CQZ4TSLSCPTASBYO4Y","bundle":"https://pith.science/pith/AEKEWLP7CQZ4TSLSCPTASBYO4Y/bundle.json","state":"https://pith.science/pith/AEKEWLP7CQZ4TSLSCPTASBYO4Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AEKEWLP7CQZ4TSLSCPTASBYO4Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AEKEWLP7CQZ4TSLSCPTASBYO4Y","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":"617bfc02d91959e10ac0a9d11f5c72e2e6d64611776c2ee424051198d9e42fdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-12T16:55:46Z","title_canon_sha256":"2cfaa9a4fa50c3395369302fd9c4faab70bc30b52b029586afeae7a8860402cb"},"schema_version":"1.0","source":{"id":"1903.05048","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.05048","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"arxiv_version","alias_value":"1903.05048v1","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05048","created_at":"2026-05-17T23:51:26Z"},{"alias_kind":"pith_short_12","alias_value":"AEKEWLP7CQZ4","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AEKEWLP7CQZ4TSLS","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AEKEWLP7","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:4f979851f91e3e2e1e11cbd0f4f9af6fdd47e919e453283cf07a9e6dc912fa46","target":"graph","created_at":"2026-05-17T23:51:26Z","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":"Orthogonal drawings, i.e., embeddings of graphs into grids, are a classic topic in Graph Drawing. Often the goal is to find a drawing that minimizes the number of bends on the edges. A key ingredient for bend minimization algorithms is the existence of an orthogonal representation that allows to describe such drawings purely combinatorially by only listing the angles between the edges around each vertex and the directions of bends on the edges, but neglecting any kind of geometric information such as vertex coordinates or edge lengths. Barth et al. [2] have established the existence of an anal","authors_text":"Benjamin Niedermann, Ignaz Rutter, Matthias Wolf","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-12T16:55:46Z","title":"Efficient Algorithms for Ortho-Radial Graph Drawing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05048","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:c1fc81ebc5620068ec6441376bf143e22363e91c146ba22315e178f4bc6d04f1","target":"record","created_at":"2026-05-17T23:51:26Z","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":"617bfc02d91959e10ac0a9d11f5c72e2e6d64611776c2ee424051198d9e42fdb","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2019-03-12T16:55:46Z","title_canon_sha256":"2cfaa9a4fa50c3395369302fd9c4faab70bc30b52b029586afeae7a8860402cb"},"schema_version":"1.0","source":{"id":"1903.05048","kind":"arxiv","version":1}},"canonical_sha256":"01144b2dff1433c9c97213e609070ee612b0134c58b110719033b71d3905835c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01144b2dff1433c9c97213e609070ee612b0134c58b110719033b71d3905835c","first_computed_at":"2026-05-17T23:51:26.446216Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:26.446216Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PHhZm9RjwSsO28+U4FYZ3CRaUekVDKfhQwuyKPDkbvin3+XbyrmlJmzopyKbb/029QiEkSE50hcmeRer3dthCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:26.446771Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.05048","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1fc81ebc5620068ec6441376bf143e22363e91c146ba22315e178f4bc6d04f1","sha256:4f979851f91e3e2e1e11cbd0f4f9af6fdd47e919e453283cf07a9e6dc912fa46"],"state_sha256":"ea82aa5321e15056607929eb75bfab0d69c666517a1508f7de9d65cdc11c7584"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aIFbJu+ARxy6I+oa/zNCZ51BABqqNdUrOyd5DWwgK1QGFTw70jt+kmWrpEamOCXsv3G65a9coRHSP5aTo63yBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:55:30.321424Z","bundle_sha256":"b69d2eed7ef834415f287f785ee79e9b325ddd85fec685b323b08bdc999a72be"}}