{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:3FEDHWJSAEQ7G4GYRD7UEUISO5","short_pith_number":"pith:3FEDHWJS","canonical_record":{"source":{"id":"1811.08918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T19:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"fb44d91176244eaf1454440493cb6ca6636294bd714f5161306fac74e33abee3","abstract_canon_sha256":"380c22da4c57c540f5db7cc9ccd9c9a7fe13276e885b968db69a50ad570afa08"},"schema_version":"1.0"},"canonical_sha256":"d94833d9320121f370d888ff425112774c4eb8ea7a7fc92b43a71f9fb8814c25","source":{"kind":"arxiv","id":"1811.08918","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08918","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08918v1","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08918","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"pith_short_12","alias_value":"3FEDHWJSAEQ7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FEDHWJSAEQ7G4GY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FEDHWJS","created_at":"2026-05-18T12:32:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:3FEDHWJSAEQ7G4GYRD7UEUISO5","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08918","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T19:23:48Z","cross_cats_sorted":[],"title_canon_sha256":"fb44d91176244eaf1454440493cb6ca6636294bd714f5161306fac74e33abee3","abstract_canon_sha256":"380c22da4c57c540f5db7cc9ccd9c9a7fe13276e885b968db69a50ad570afa08"},"schema_version":"1.0"},"canonical_sha256":"d94833d9320121f370d888ff425112774c4eb8ea7a7fc92b43a71f9fb8814c25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:07.624327Z","signature_b64":"WWqsAiZDYr6id5RwP0Jgwl5jYGGR80gWElsMRUFIivue6kwebfxJjZYsfkR5F14PZXGhstErn316p7f/nwgtCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d94833d9320121f370d888ff425112774c4eb8ea7a7fc92b43a71f9fb8814c25","last_reissued_at":"2026-05-18T00:00:07.623700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:07.623700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08918","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-18T00:00:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5ciZ/zBbB6E1T17WImQOra40OVm5nR50ORo9Y8vkmUWdP1m3UF5RLxRSLqUGtVYyrB4+GrvkxGdn0Bp7Lqk5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:39.517582Z"},"content_sha256":"fb22b3f29590cc8bf23dd34cb2d2b0422e7c2477ff1455b73c2ded510a20d4f4","schema_version":"1.0","event_id":"sha256:fb22b3f29590cc8bf23dd34cb2d2b0422e7c2477ff1455b73c2ded510a20d4f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:3FEDHWJSAEQ7G4GYRD7UEUISO5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dispersing obnoxious facilities on a graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander Grigoriev, Gerhard J. Woeginger, Stefan Lendl, Tim A. Hartmann","submitted_at":"2018-11-21T19:23:48Z","abstract_excerpt":"We study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $\\delta$ from each other. We investigate the complexity of this problem in terms of the rational parameter $\\delta$. The problem is polynomially solvable, if the numerator of $\\delta$ is $1$ or $2$, while all other cases turn out to be NP-hard."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08918","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-18T00:00:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2v94Pnl8NRNhfn/1q+Jcym3iKW9uGfzbboAslwEljig7yyjqNFfFJaOXOMiplSZ3lw/zFads/dKfzoiQzvVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:53:39.518168Z"},"content_sha256":"d2b45ea2ce8410100ed0dd5ba54daa12cd31fb4f7da2ce5b8c5025d91bd3714b","schema_version":"1.0","event_id":"sha256:d2b45ea2ce8410100ed0dd5ba54daa12cd31fb4f7da2ce5b8c5025d91bd3714b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3FEDHWJSAEQ7G4GYRD7UEUISO5/bundle.json","state_url":"https://pith.science/pith/3FEDHWJSAEQ7G4GYRD7UEUISO5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3FEDHWJSAEQ7G4GYRD7UEUISO5/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-27T08:53:39Z","links":{"resolver":"https://pith.science/pith/3FEDHWJSAEQ7G4GYRD7UEUISO5","bundle":"https://pith.science/pith/3FEDHWJSAEQ7G4GYRD7UEUISO5/bundle.json","state":"https://pith.science/pith/3FEDHWJSAEQ7G4GYRD7UEUISO5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3FEDHWJSAEQ7G4GYRD7UEUISO5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:3FEDHWJSAEQ7G4GYRD7UEUISO5","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":"380c22da4c57c540f5db7cc9ccd9c9a7fe13276e885b968db69a50ad570afa08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T19:23:48Z","title_canon_sha256":"fb44d91176244eaf1454440493cb6ca6636294bd714f5161306fac74e33abee3"},"schema_version":"1.0","source":{"id":"1811.08918","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08918","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08918v1","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08918","created_at":"2026-05-18T00:00:07Z"},{"alias_kind":"pith_short_12","alias_value":"3FEDHWJSAEQ7","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"3FEDHWJSAEQ7G4GY","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"3FEDHWJS","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:d2b45ea2ce8410100ed0dd5ba54daa12cd31fb4f7da2ce5b8c5025d91bd3714b","target":"graph","created_at":"2026-05-18T00:00:07Z","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 study a continuous facility location problem on a graph where all edges have unit length and where the facilities may also be positioned in the interior of the edges. The goal is to position as many facilities as possible subject to the condition that any two facilities have at least distance $\\delta$ from each other. We investigate the complexity of this problem in terms of the rational parameter $\\delta$. The problem is polynomially solvable, if the numerator of $\\delta$ is $1$ or $2$, while all other cases turn out to be NP-hard.","authors_text":"Alexander Grigoriev, Gerhard J. Woeginger, Stefan Lendl, Tim A. Hartmann","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T19:23:48Z","title":"Dispersing obnoxious facilities on a graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08918","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:fb22b3f29590cc8bf23dd34cb2d2b0422e7c2477ff1455b73c2ded510a20d4f4","target":"record","created_at":"2026-05-18T00:00:07Z","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":"380c22da4c57c540f5db7cc9ccd9c9a7fe13276e885b968db69a50ad570afa08","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-21T19:23:48Z","title_canon_sha256":"fb44d91176244eaf1454440493cb6ca6636294bd714f5161306fac74e33abee3"},"schema_version":"1.0","source":{"id":"1811.08918","kind":"arxiv","version":1}},"canonical_sha256":"d94833d9320121f370d888ff425112774c4eb8ea7a7fc92b43a71f9fb8814c25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d94833d9320121f370d888ff425112774c4eb8ea7a7fc92b43a71f9fb8814c25","first_computed_at":"2026-05-18T00:00:07.623700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:07.623700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWqsAiZDYr6id5RwP0Jgwl5jYGGR80gWElsMRUFIivue6kwebfxJjZYsfkR5F14PZXGhstErn316p7f/nwgtCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:07.624327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08918","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fb22b3f29590cc8bf23dd34cb2d2b0422e7c2477ff1455b73c2ded510a20d4f4","sha256:d2b45ea2ce8410100ed0dd5ba54daa12cd31fb4f7da2ce5b8c5025d91bd3714b"],"state_sha256":"8a9bcb745eb8251efedcca325bd22126201c20e71450cd5acb5e219562881ab1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ttdkSA6loeWHg8OyGRs1YwE5/N59Rseuld76FAwSmrmBc9VPzCvQfGuAhcDkDsy73EiMytzLaMTejuDfyVgNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:53:39.521205Z","bundle_sha256":"11d6aab833efe1ba2ffd7034a9a7f4488a67dd650dc82b18e3172f8c4081fd4a"}}