{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:36VMFJMF4SBEFN2K5X7Y5YYTUR","short_pith_number":"pith:36VMFJMF","canonical_record":{"source":{"id":"1412.0760","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T02:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"dbb00bfcbb23602c62a88c1b3a5946c5d5d132eedcc7dc033c146fcffa6f690f","abstract_canon_sha256":"fd2a3b542a80db65411cd316686ff2700ef890e9ce1b3e34ab39b4e1445c2383"},"schema_version":"1.0"},"canonical_sha256":"dfaac2a585e48242b74aedff8ee313a46cc4fe888116b27a606406d138eaae25","source":{"kind":"arxiv","id":"1412.0760","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0760","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0760v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0760","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"36VMFJMF4SBE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"36VMFJMF4SBEFN2K","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"36VMFJMF","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:36VMFJMF4SBEFN2K5X7Y5YYTUR","target":"record","payload":{"canonical_record":{"source":{"id":"1412.0760","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T02:40:17Z","cross_cats_sorted":[],"title_canon_sha256":"dbb00bfcbb23602c62a88c1b3a5946c5d5d132eedcc7dc033c146fcffa6f690f","abstract_canon_sha256":"fd2a3b542a80db65411cd316686ff2700ef890e9ce1b3e34ab39b4e1445c2383"},"schema_version":"1.0"},"canonical_sha256":"dfaac2a585e48242b74aedff8ee313a46cc4fe888116b27a606406d138eaae25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:37.443924Z","signature_b64":"GM/ROBXDvY53oftmEpB+jfbU46y4hqDXHCgOkijiXO4qrYcW0NDHYZ7BRv4sNFYhhYpzVFznPyO6f5C/MMgYDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dfaac2a585e48242b74aedff8ee313a46cc4fe888116b27a606406d138eaae25","last_reissued_at":"2026-05-18T00:44:37.443394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:37.443394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.0760","source_version":3,"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:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJnEBMvvdsw95SGZxyxwvLH6lIRX4TbB1vL3D4ocOu0FxTl/5qUd72nlRphG7+bgNDIVihAsa1fCR0+D2yzsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:43:12.248135Z"},"content_sha256":"60b7b7176edbe7fd59c4a1bb43c875e6db93536deb61a11a89030fd8b2b6dfd7","schema_version":"1.0","event_id":"sha256:60b7b7176edbe7fd59c4a1bb43c875e6db93536deb61a11a89030fd8b2b6dfd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:36VMFJMF4SBEFN2K5X7Y5YYTUR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Competitive Local Routing with Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Andr\\'e van Renssen, Prosenjit Bose, Rolf Fagerberg, Sander Verdonschot","submitted_at":"2014-12-02T02:40:17Z","abstract_excerpt":"Let $P$ be a set of $n$ vertices in the plane and $S$ a set of non-crossing line segments between vertices in $P$, called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained $\\Theta_m$-graph is constructed by partitioning the plane around each vertex into $m$ disjoint cones, each with aperture $\\theta = 2 \\pi/m$, and adding an edge to the `closest' visible vertex in each cone. We consider how to route on the constrained $\\Theta_6$-graph. We first show that no deterministic 1-local routing algorithm is $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0760","kind":"arxiv","version":3},"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:44:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pZMqqJ3JH8bGRRjGe422KKcHSX4IAJw1e5Y2hwMOeIIpG5renOEW5UbZTGX31tbsO77bWYPm2ymQD1ZpSg+wDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T11:43:12.248500Z"},"content_sha256":"2835072d24610b4ea8164ef3cb8beb4d37f03bac1094c7a09c7ee73377dc8d8e","schema_version":"1.0","event_id":"sha256:2835072d24610b4ea8164ef3cb8beb4d37f03bac1094c7a09c7ee73377dc8d8e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/36VMFJMF4SBEFN2K5X7Y5YYTUR/bundle.json","state_url":"https://pith.science/pith/36VMFJMF4SBEFN2K5X7Y5YYTUR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/36VMFJMF4SBEFN2K5X7Y5YYTUR/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-25T11:43:12Z","links":{"resolver":"https://pith.science/pith/36VMFJMF4SBEFN2K5X7Y5YYTUR","bundle":"https://pith.science/pith/36VMFJMF4SBEFN2K5X7Y5YYTUR/bundle.json","state":"https://pith.science/pith/36VMFJMF4SBEFN2K5X7Y5YYTUR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/36VMFJMF4SBEFN2K5X7Y5YYTUR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:36VMFJMF4SBEFN2K5X7Y5YYTUR","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":"fd2a3b542a80db65411cd316686ff2700ef890e9ce1b3e34ab39b4e1445c2383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T02:40:17Z","title_canon_sha256":"dbb00bfcbb23602c62a88c1b3a5946c5d5d132eedcc7dc033c146fcffa6f690f"},"schema_version":"1.0","source":{"id":"1412.0760","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.0760","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"arxiv_version","alias_value":"1412.0760v3","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0760","created_at":"2026-05-18T00:44:37Z"},{"alias_kind":"pith_short_12","alias_value":"36VMFJMF4SBE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"36VMFJMF4SBEFN2K","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"36VMFJMF","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:2835072d24610b4ea8164ef3cb8beb4d37f03bac1094c7a09c7ee73377dc8d8e","target":"graph","created_at":"2026-05-18T00:44:37Z","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":"Let $P$ be a set of $n$ vertices in the plane and $S$ a set of non-crossing line segments between vertices in $P$, called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained $\\Theta_m$-graph is constructed by partitioning the plane around each vertex into $m$ disjoint cones, each with aperture $\\theta = 2 \\pi/m$, and adding an edge to the `closest' visible vertex in each cone. We consider how to route on the constrained $\\Theta_6$-graph. We first show that no deterministic 1-local routing algorithm is $","authors_text":"Andr\\'e van Renssen, Prosenjit Bose, Rolf Fagerberg, Sander Verdonschot","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T02:40:17Z","title":"Competitive Local Routing with Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0760","kind":"arxiv","version":3},"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:60b7b7176edbe7fd59c4a1bb43c875e6db93536deb61a11a89030fd8b2b6dfd7","target":"record","created_at":"2026-05-18T00:44:37Z","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":"fd2a3b542a80db65411cd316686ff2700ef890e9ce1b3e34ab39b4e1445c2383","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-12-02T02:40:17Z","title_canon_sha256":"dbb00bfcbb23602c62a88c1b3a5946c5d5d132eedcc7dc033c146fcffa6f690f"},"schema_version":"1.0","source":{"id":"1412.0760","kind":"arxiv","version":3}},"canonical_sha256":"dfaac2a585e48242b74aedff8ee313a46cc4fe888116b27a606406d138eaae25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dfaac2a585e48242b74aedff8ee313a46cc4fe888116b27a606406d138eaae25","first_computed_at":"2026-05-18T00:44:37.443394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:37.443394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GM/ROBXDvY53oftmEpB+jfbU46y4hqDXHCgOkijiXO4qrYcW0NDHYZ7BRv4sNFYhhYpzVFznPyO6f5C/MMgYDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:37.443924Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.0760","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60b7b7176edbe7fd59c4a1bb43c875e6db93536deb61a11a89030fd8b2b6dfd7","sha256:2835072d24610b4ea8164ef3cb8beb4d37f03bac1094c7a09c7ee73377dc8d8e"],"state_sha256":"dcbe0d0e1d820d60af6a79196d64185394af9e99c9f8bfb976c62abbf652858f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9vI5/pMJxXOXDSUnpDUf00+TQtbvoRONFQgrb1TLHk/iA1lBLRyFtW6YxVtQXCkeC/63li8pi4A2KES1Dy3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T11:43:12.251353Z","bundle_sha256":"f7c3fdb116662e6882bea7a48e275ef6ef1fb209eaaaab0e5cb4483829c16576"}}