{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XEPTOHPXRVWPFRJ4EEGEXR6AUK","short_pith_number":"pith:XEPTOHPX","canonical_record":{"source":{"id":"1505.00164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-01T11:54:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"494d0b5bea2a5b8f3b33de46794bddc1d76777a54563770194ee294efd92fb02","abstract_canon_sha256":"14d476470bab092174da8dcd21f972d90e652b1596b0cbfb49c071081759c537"},"schema_version":"1.0"},"canonical_sha256":"b91f371df78d6cf2c53c210c4bc7c0a2bef3de4e7b52f618e5234fd1f910f13f","source":{"kind":"arxiv","id":"1505.00164","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00164","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00164v2","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00164","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"XEPTOHPXRVWP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XEPTOHPXRVWPFRJ4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XEPTOHPX","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XEPTOHPXRVWPFRJ4EEGEXR6AUK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.00164","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-01T11:54:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"494d0b5bea2a5b8f3b33de46794bddc1d76777a54563770194ee294efd92fb02","abstract_canon_sha256":"14d476470bab092174da8dcd21f972d90e652b1596b0cbfb49c071081759c537"},"schema_version":"1.0"},"canonical_sha256":"b91f371df78d6cf2c53c210c4bc7c0a2bef3de4e7b52f618e5234fd1f910f13f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:38.301597Z","signature_b64":"w0GEdYywzQdcfZw6j767t/AtfgbM0hogamoYBiyFHAY4OexYcdTORmx1JdmvQnACHbD2jhIHtFFjUsRYS3V9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b91f371df78d6cf2c53c210c4bc7c0a2bef3de4e7b52f618e5234fd1f910f13f","last_reissued_at":"2026-05-18T01:23:38.300939Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:38.300939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.00164","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-18T01:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ff79HpjQdMy7TUyoTFocyQc67yCxpmIzUeluAqKX1gvOLRzy0HUCMiiBlFAEnH/NbGLRsy7NCLGACasQ7tivBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:54:24.299470Z"},"content_sha256":"2af74c6a55bef44fadec3fe5b05dd132e8dfd136b956084ae64a7f96175fc9c7","schema_version":"1.0","event_id":"sha256:2af74c6a55bef44fadec3fe5b05dd132e8dfd136b956084ae64a7f96175fc9c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XEPTOHPXRVWPFRJ4EEGEXR6AUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Algorithmic Framework for Labeling Network Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CG","authors_text":"Benjamin Niedermann, Jan-Henrik Haunert","submitted_at":"2015-05-01T11:54:40Z","abstract_excerpt":"Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of metro maps. We present a flexible and versatile labeling model. Despite its simplicity, we prove that it is NP-complete to label a single line of the network. For a restricted variant of that model, we then introduce an efficient algorithm that optimally labels a single line with respect to a given weighting function. Based on that algorithm, we present a g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00164","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-18T01:23:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZK4ZkxVNTUGl4+2Sxd4TQH1ilnuFw0Zym7oBYi99s13xSvP89k3qpjg8Rj9tPWa4+ybGc45HYrBSw5R9DmhOCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:54:24.300226Z"},"content_sha256":"8f001a654140f3ab3a33b308d0233d5d9b5d71486cc14c3b3cd5ed7a2032254b","schema_version":"1.0","event_id":"sha256:8f001a654140f3ab3a33b308d0233d5d9b5d71486cc14c3b3cd5ed7a2032254b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XEPTOHPXRVWPFRJ4EEGEXR6AUK/bundle.json","state_url":"https://pith.science/pith/XEPTOHPXRVWPFRJ4EEGEXR6AUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XEPTOHPXRVWPFRJ4EEGEXR6AUK/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:54:24Z","links":{"resolver":"https://pith.science/pith/XEPTOHPXRVWPFRJ4EEGEXR6AUK","bundle":"https://pith.science/pith/XEPTOHPXRVWPFRJ4EEGEXR6AUK/bundle.json","state":"https://pith.science/pith/XEPTOHPXRVWPFRJ4EEGEXR6AUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XEPTOHPXRVWPFRJ4EEGEXR6AUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XEPTOHPXRVWPFRJ4EEGEXR6AUK","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":"14d476470bab092174da8dcd21f972d90e652b1596b0cbfb49c071081759c537","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-01T11:54:40Z","title_canon_sha256":"494d0b5bea2a5b8f3b33de46794bddc1d76777a54563770194ee294efd92fb02"},"schema_version":"1.0","source":{"id":"1505.00164","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.00164","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.00164v2","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.00164","created_at":"2026-05-18T01:23:38Z"},{"alias_kind":"pith_short_12","alias_value":"XEPTOHPXRVWP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XEPTOHPXRVWPFRJ4","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XEPTOHPX","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:8f001a654140f3ab3a33b308d0233d5d9b5d71486cc14c3b3cd5ed7a2032254b","target":"graph","created_at":"2026-05-18T01:23:38Z","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":"Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of metro maps. We present a flexible and versatile labeling model. Despite its simplicity, we prove that it is NP-complete to label a single line of the network. For a restricted variant of that model, we then introduce an efficient algorithm that optimally labels a single line with respect to a given weighting function. Based on that algorithm, we present a g","authors_text":"Benjamin Niedermann, Jan-Henrik Haunert","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-01T11:54:40Z","title":"An Algorithmic Framework for Labeling Network Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.00164","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:2af74c6a55bef44fadec3fe5b05dd132e8dfd136b956084ae64a7f96175fc9c7","target":"record","created_at":"2026-05-18T01:23:38Z","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":"14d476470bab092174da8dcd21f972d90e652b1596b0cbfb49c071081759c537","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2015-05-01T11:54:40Z","title_canon_sha256":"494d0b5bea2a5b8f3b33de46794bddc1d76777a54563770194ee294efd92fb02"},"schema_version":"1.0","source":{"id":"1505.00164","kind":"arxiv","version":2}},"canonical_sha256":"b91f371df78d6cf2c53c210c4bc7c0a2bef3de4e7b52f618e5234fd1f910f13f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b91f371df78d6cf2c53c210c4bc7c0a2bef3de4e7b52f618e5234fd1f910f13f","first_computed_at":"2026-05-18T01:23:38.300939Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:38.300939Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w0GEdYywzQdcfZw6j767t/AtfgbM0hogamoYBiyFHAY4OexYcdTORmx1JdmvQnACHbD2jhIHtFFjUsRYS3V9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:38.301597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.00164","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2af74c6a55bef44fadec3fe5b05dd132e8dfd136b956084ae64a7f96175fc9c7","sha256:8f001a654140f3ab3a33b308d0233d5d9b5d71486cc14c3b3cd5ed7a2032254b"],"state_sha256":"6d6c1b8f46493340cdaff398f5101de9efd56cacacb4d096c9e14af832817fa2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xg8ka6ewDLiWpUDbf7OSVNbOlgAIzwbcEwoY6dYETm0EuxWsyIufB1/b7ShryeiN76TFOm+eA//v0MVjwIDjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:54:24.304366Z","bundle_sha256":"0b3763affe8a9b57c8fbdf584aeb56f725026fbcfca319e84c340fa69a99ae29"}}