{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DAVMFNCD4BNAPJWRNLHY4MEBEW","short_pith_number":"pith:DAVMFNCD","canonical_record":{"source":{"id":"1305.0750","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-03T15:33:56Z","cross_cats_sorted":[],"title_canon_sha256":"62e8fa67ca066cc3684bc33df58c7919f9381c201db451cd2869b43c809b6152","abstract_canon_sha256":"d4caa7fe010dc9ee18ca088220bfb8453a797aad958441b4ea67853137c927f1"},"schema_version":"1.0"},"canonical_sha256":"182ac2b443e05a07a6d16acf8e308125bc4fa7810f7aea56f369679a16cd16bc","source":{"kind":"arxiv","id":"1305.0750","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0750","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0750v4","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0750","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"DAVMFNCD4BNA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DAVMFNCD4BNAPJWR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DAVMFNCD","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DAVMFNCD4BNAPJWRNLHY4MEBEW","target":"record","payload":{"canonical_record":{"source":{"id":"1305.0750","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-03T15:33:56Z","cross_cats_sorted":[],"title_canon_sha256":"62e8fa67ca066cc3684bc33df58c7919f9381c201db451cd2869b43c809b6152","abstract_canon_sha256":"d4caa7fe010dc9ee18ca088220bfb8453a797aad958441b4ea67853137c927f1"},"schema_version":"1.0"},"canonical_sha256":"182ac2b443e05a07a6d16acf8e308125bc4fa7810f7aea56f369679a16cd16bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:21.185854Z","signature_b64":"1ySN9mEezb4DXINKd88ti47XFgV7Ej/hMf8qGS9QoLugO4r5SmM78ymcSUnpo8MhU7JBcvfsnL0yJaAfITZYCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"182ac2b443e05a07a6d16acf8e308125bc4fa7810f7aea56f369679a16cd16bc","last_reissued_at":"2026-05-18T00:06:21.185513Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:21.185513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.0750","source_version":4,"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Voh5uVlq4if0WSisDMNUSuQlCU7+6ePn3zu7kT5tAhdcmqtxGLBMfjXJ8UYyvz8/KlHQhXo8lrIYjFD4qyWTBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:13:07.288449Z"},"content_sha256":"022ee4e281f7cba4131deba9db6f0cf78f5c1986d707f9598ee2d197104f105d","schema_version":"1.0","event_id":"sha256:022ee4e281f7cba4131deba9db6f0cf78f5c1986d707f9598ee2d197104f105d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DAVMFNCD4BNAPJWRNLHY4MEBEW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Sided Boundary Labeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Alexander Wolff, Andr\\'e Schulz, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, Philipp Kindermann","submitted_at":"2013-05-03T15:33:56Z","abstract_excerpt":"In the Boundary Labeling problem, we are given a set of $n$ points, referred to as sites, inside an axis-parallel rectangle $R$, and a set of $n$ pairwise disjoint rectangular labels that are attached to $R$ from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend.\n  In this paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0750","kind":"arxiv","version":4},"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:06:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T8LkutoshXNmwH8na0NeO/viZbSu47PoOycZvaLyj0zV9sLyeQ9VXiaA/Eq53me+1x/dJIeItqEBR7+lslekDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:13:07.288879Z"},"content_sha256":"1907e4f551c00cd5eef700774176d4001ee8b42beed6d096d0c6f37cdc9eeab0","schema_version":"1.0","event_id":"sha256:1907e4f551c00cd5eef700774176d4001ee8b42beed6d096d0c6f37cdc9eeab0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/bundle.json","state_url":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/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-30T21:13:07Z","links":{"resolver":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW","bundle":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/bundle.json","state":"https://pith.science/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DAVMFNCD4BNAPJWRNLHY4MEBEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DAVMFNCD4BNAPJWRNLHY4MEBEW","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":"d4caa7fe010dc9ee18ca088220bfb8453a797aad958441b4ea67853137c927f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-03T15:33:56Z","title_canon_sha256":"62e8fa67ca066cc3684bc33df58c7919f9381c201db451cd2869b43c809b6152"},"schema_version":"1.0","source":{"id":"1305.0750","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.0750","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.0750v4","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.0750","created_at":"2026-05-18T00:06:21Z"},{"alias_kind":"pith_short_12","alias_value":"DAVMFNCD4BNA","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DAVMFNCD4BNAPJWR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DAVMFNCD","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:1907e4f551c00cd5eef700774176d4001ee8b42beed6d096d0c6f37cdc9eeab0","target":"graph","created_at":"2026-05-18T00:06:21Z","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":"In the Boundary Labeling problem, we are given a set of $n$ points, referred to as sites, inside an axis-parallel rectangle $R$, and a set of $n$ pairwise disjoint rectangular labels that are attached to $R$ from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend.\n  In this paper, we study the Multi-Sided Boundary Labeling problem, with labels lying on at least two sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, suc","authors_text":"Alexander Wolff, Andr\\'e Schulz, Benjamin Niedermann, Ignaz Rutter, Marcus Schaefer, Philipp Kindermann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-03T15:33:56Z","title":"Multi-Sided Boundary Labeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.0750","kind":"arxiv","version":4},"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:022ee4e281f7cba4131deba9db6f0cf78f5c1986d707f9598ee2d197104f105d","target":"record","created_at":"2026-05-18T00:06:21Z","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":"d4caa7fe010dc9ee18ca088220bfb8453a797aad958441b4ea67853137c927f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2013-05-03T15:33:56Z","title_canon_sha256":"62e8fa67ca066cc3684bc33df58c7919f9381c201db451cd2869b43c809b6152"},"schema_version":"1.0","source":{"id":"1305.0750","kind":"arxiv","version":4}},"canonical_sha256":"182ac2b443e05a07a6d16acf8e308125bc4fa7810f7aea56f369679a16cd16bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"182ac2b443e05a07a6d16acf8e308125bc4fa7810f7aea56f369679a16cd16bc","first_computed_at":"2026-05-18T00:06:21.185513Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:06:21.185513Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1ySN9mEezb4DXINKd88ti47XFgV7Ej/hMf8qGS9QoLugO4r5SmM78ymcSUnpo8MhU7JBcvfsnL0yJaAfITZYCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:06:21.185854Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.0750","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:022ee4e281f7cba4131deba9db6f0cf78f5c1986d707f9598ee2d197104f105d","sha256:1907e4f551c00cd5eef700774176d4001ee8b42beed6d096d0c6f37cdc9eeab0"],"state_sha256":"71f7a7a3f51accf30f05f34bff8d8c676dc39747058962807038e0c4a0776f46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4Q8VGkO62eeOsEgzebLWyhyoWnzzO9KHS1ReQPkdiMjVLw8/BjgZeecWRevPH7vmXwJcUUacFWY346SOxU6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:13:07.290978Z","bundle_sha256":"d487167803db4ebc7a21eafa7f721a88977556300d83ed6a97766bae95379f51"}}