{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:WSG4ZMUVTGPDSNF4ILFRYZVPR7","short_pith_number":"pith:WSG4ZMUV","canonical_record":{"source":{"id":"1609.01755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-29T22:09:37Z","cross_cats_sorted":[],"title_canon_sha256":"c2da423fec0c2d211664d3b5425c64e1e180ce183bb365ac38527d0abb995abf","abstract_canon_sha256":"45200896298e52ff0118cc8abe2b5986e174332f88d5635ce8e10a442fc555b2"},"schema_version":"1.0"},"canonical_sha256":"b48dccb295999e3934bc42cb1c66af8ff227e3f5eef199e8707bc9491907ded0","source":{"kind":"arxiv","id":"1609.01755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01755","created_at":"2026-05-18T01:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01755v1","created_at":"2026-05-18T01:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01755","created_at":"2026-05-18T01:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"WSG4ZMUVTGPD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WSG4ZMUVTGPDSNF4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WSG4ZMUV","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:WSG4ZMUVTGPDSNF4ILFRYZVPR7","target":"record","payload":{"canonical_record":{"source":{"id":"1609.01755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-29T22:09:37Z","cross_cats_sorted":[],"title_canon_sha256":"c2da423fec0c2d211664d3b5425c64e1e180ce183bb365ac38527d0abb995abf","abstract_canon_sha256":"45200896298e52ff0118cc8abe2b5986e174332f88d5635ce8e10a442fc555b2"},"schema_version":"1.0"},"canonical_sha256":"b48dccb295999e3934bc42cb1c66af8ff227e3f5eef199e8707bc9491907ded0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:10.149936Z","signature_b64":"D0tMj9M0dGWvmlk16tAL7+DCAN85x97Z06udLiaEwM6yYc8WI9wYlEXtqLGFQF/B6/eaHP+5dtfhcMkgRDvrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b48dccb295999e3934bc42cb1c66af8ff227e3f5eef199e8707bc9491907ded0","last_reissued_at":"2026-05-18T01:05:10.149247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:10.149247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.01755","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-18T01:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/g/uONxw0wGbEMx2SGj6TzLqF7WxC2+1Mr8r+CyG6RQeVLs20dIscSl9tmO6TOhosmKv2kuOMc3e+RezWEEQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:14:09.825935Z"},"content_sha256":"d8ef83cd32ffa52057346fcbf79009a4bc2f38b5a7eed28d309b699fd27053f2","schema_version":"1.0","event_id":"sha256:d8ef83cd32ffa52057346fcbf79009a4bc2f38b5a7eed28d309b699fd27053f2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:WSG4ZMUVTGPDSNF4ILFRYZVPR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compact Layered Drawings of General Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adalat Jabrayilov, Petra Mutzel, Reinhard von Hanxleden, Sven Mallach, Ulf R\\\"uegg","submitted_at":"2016-08-29T22:09:37Z","abstract_excerpt":"We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number of reversed arcs, the arc lengths, and the width of the drawing. We call this the Compact Generalized Layering Problem (CGLP). Here, the width of a drawing is defined as the maximum sum of the number of vertices placed on a layer and the number of dummy vertices caused by arcs traversing the layer. The CGLP is NP-hard. We present two MIP models for this prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01755","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-18T01:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QBqgKbpF0vQ/eyQG3LH7BNYx4Bt0UCfQ2dBvDzraps+oCNW2hkS7WLM89Ch8RcphjUX7OTxk4bKOh2a0LUGfCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:14:09.826611Z"},"content_sha256":"9a88a774a9cf7cb9dfa971b9b822924bfa14ba19c7e7743cf16363fd4dbce97c","schema_version":"1.0","event_id":"sha256:9a88a774a9cf7cb9dfa971b9b822924bfa14ba19c7e7743cf16363fd4dbce97c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WSG4ZMUVTGPDSNF4ILFRYZVPR7/bundle.json","state_url":"https://pith.science/pith/WSG4ZMUVTGPDSNF4ILFRYZVPR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WSG4ZMUVTGPDSNF4ILFRYZVPR7/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-31T18:14:09Z","links":{"resolver":"https://pith.science/pith/WSG4ZMUVTGPDSNF4ILFRYZVPR7","bundle":"https://pith.science/pith/WSG4ZMUVTGPDSNF4ILFRYZVPR7/bundle.json","state":"https://pith.science/pith/WSG4ZMUVTGPDSNF4ILFRYZVPR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WSG4ZMUVTGPDSNF4ILFRYZVPR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:WSG4ZMUVTGPDSNF4ILFRYZVPR7","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":"45200896298e52ff0118cc8abe2b5986e174332f88d5635ce8e10a442fc555b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-29T22:09:37Z","title_canon_sha256":"c2da423fec0c2d211664d3b5425c64e1e180ce183bb365ac38527d0abb995abf"},"schema_version":"1.0","source":{"id":"1609.01755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.01755","created_at":"2026-05-18T01:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"1609.01755v1","created_at":"2026-05-18T01:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.01755","created_at":"2026-05-18T01:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"WSG4ZMUVTGPD","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"WSG4ZMUVTGPDSNF4","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"WSG4ZMUV","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:9a88a774a9cf7cb9dfa971b9b822924bfa14ba19c7e7743cf16363fd4dbce97c","target":"graph","created_at":"2026-05-18T01:05:10Z","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 consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a layering approach that minimizes a weighted sum of the number of reversed arcs, the arc lengths, and the width of the drawing. We call this the Compact Generalized Layering Problem (CGLP). Here, the width of a drawing is defined as the maximum sum of the number of vertices placed on a layer and the number of dummy vertices caused by arcs traversing the layer. The CGLP is NP-hard. We present two MIP models for this prob","authors_text":"Adalat Jabrayilov, Petra Mutzel, Reinhard von Hanxleden, Sven Mallach, Ulf R\\\"uegg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-29T22:09:37Z","title":"Compact Layered Drawings of General Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.01755","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:d8ef83cd32ffa52057346fcbf79009a4bc2f38b5a7eed28d309b699fd27053f2","target":"record","created_at":"2026-05-18T01:05:10Z","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":"45200896298e52ff0118cc8abe2b5986e174332f88d5635ce8e10a442fc555b2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-08-29T22:09:37Z","title_canon_sha256":"c2da423fec0c2d211664d3b5425c64e1e180ce183bb365ac38527d0abb995abf"},"schema_version":"1.0","source":{"id":"1609.01755","kind":"arxiv","version":1}},"canonical_sha256":"b48dccb295999e3934bc42cb1c66af8ff227e3f5eef199e8707bc9491907ded0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b48dccb295999e3934bc42cb1c66af8ff227e3f5eef199e8707bc9491907ded0","first_computed_at":"2026-05-18T01:05:10.149247Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:10.149247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D0tMj9M0dGWvmlk16tAL7+DCAN85x97Z06udLiaEwM6yYc8WI9wYlEXtqLGFQF/B6/eaHP+5dtfhcMkgRDvrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:10.149936Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.01755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8ef83cd32ffa52057346fcbf79009a4bc2f38b5a7eed28d309b699fd27053f2","sha256:9a88a774a9cf7cb9dfa971b9b822924bfa14ba19c7e7743cf16363fd4dbce97c"],"state_sha256":"7cad456d05fd6c4a9b3db565714710d556dedfd7ddcb7e80558a7558248fee7e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pQxp7U8LQTuQL0eEhCN4RpIUafTJaImMdE9GUmVqHvHPj/NNDBt2CnjuEgEJCZBLtTKGdpahiK2UUp0TDBwkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:14:09.829287Z","bundle_sha256":"373a04034a3f58797490b5793d4676e691f7053130e0fa8b1ba3ac1b4961065a"}}