{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FGDK2O7WBRKYJLJAFSUR4DFYHG","short_pith_number":"pith:FGDK2O7W","canonical_record":{"source":{"id":"1907.04087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:29:43Z","cross_cats_sorted":[],"title_canon_sha256":"bb07eac7e4aac570dfada4c46b3b8f30651d0f7bbdb5eaaf8b2e17a22c2558bd","abstract_canon_sha256":"522e464861c2e631e4a0862e9cf819b2ca193617291d7bee83c8ff522230fee9"},"schema_version":"1.0"},"canonical_sha256":"2986ad3bf60c5584ad202ca91e0cb839b1daf123094f50398582fa9430bdadcf","source":{"kind":"arxiv","id":"1907.04087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04087","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04087v1","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04087","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"FGDK2O7WBRKY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGDK2O7WBRKYJLJA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGDK2O7W","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FGDK2O7WBRKYJLJAFSUR4DFYHG","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:29:43Z","cross_cats_sorted":[],"title_canon_sha256":"bb07eac7e4aac570dfada4c46b3b8f30651d0f7bbdb5eaaf8b2e17a22c2558bd","abstract_canon_sha256":"522e464861c2e631e4a0862e9cf819b2ca193617291d7bee83c8ff522230fee9"},"schema_version":"1.0"},"canonical_sha256":"2986ad3bf60c5584ad202ca91e0cb839b1daf123094f50398582fa9430bdadcf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:05.727737Z","signature_b64":"r/FLYz79gaxzobtQ++S1wSHby+16AIt4xyxaTMItOgjRrxMCHTzwfSVfSemeQoRTtmhw1evb+xynkO64/nZKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2986ad3bf60c5584ad202ca91e0cb839b1daf123094f50398582fa9430bdadcf","last_reissued_at":"2026-05-17T23:41:05.727074Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:05.727074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04087","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-17T23:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SCzkoFEwEgltzC+FgpWXKmwLLJcf1BNks5zxzuQuamFhFnskiQ/KrF1jzE07w6q0nZeLMXnFOKMsp6bFAriGAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:35:52.598560Z"},"content_sha256":"9d3211b5537e876dc01ed60cc63e3a90c5d09a6fe9b6f5c65d228a3d99f8fccf","schema_version":"1.0","event_id":"sha256:9d3211b5537e876dc01ed60cc63e3a90c5d09a6fe9b6f5c65d228a3d99f8fccf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FGDK2O7WBRKYJLJAFSUR4DFYHG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"PTAS and Exact Algorithms for $r$-Gathering Problems on Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Soh Kumabe, Takanori Maehara","submitted_at":"2019-07-09T11:29:43Z","abstract_excerpt":"r-gathering problem is a variant of facility location problems. In this problem, we are given a set of users and a set of facilities on same metric space. We open some of the facilities and assign each user to an open facility, so that at least r users are assigned to every open facility. We aim to minimize the maximum distance between user and assigned facility. In general, this problem is NP-hard and admit an approximation algorithm with factor 3. It is known that the problem does not admit any approximation algorithm within a factor less than 3. In our another paper, we proved that this pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04087","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-17T23:41:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpxNp/tj93+pEtZF5unq7LMC8u1BKjLeqOngveB/YfXu+58KE3q2ogoCj77+6AJEcqWM0f9bHL9psHHiwHMjCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:35:52.599272Z"},"content_sha256":"255a19af8f63c2025382b0ebad3f465f037db993bf386386a0a192560045e20c","schema_version":"1.0","event_id":"sha256:255a19af8f63c2025382b0ebad3f465f037db993bf386386a0a192560045e20c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FGDK2O7WBRKYJLJAFSUR4DFYHG/bundle.json","state_url":"https://pith.science/pith/FGDK2O7WBRKYJLJAFSUR4DFYHG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FGDK2O7WBRKYJLJAFSUR4DFYHG/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-26T08:35:52Z","links":{"resolver":"https://pith.science/pith/FGDK2O7WBRKYJLJAFSUR4DFYHG","bundle":"https://pith.science/pith/FGDK2O7WBRKYJLJAFSUR4DFYHG/bundle.json","state":"https://pith.science/pith/FGDK2O7WBRKYJLJAFSUR4DFYHG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FGDK2O7WBRKYJLJAFSUR4DFYHG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FGDK2O7WBRKYJLJAFSUR4DFYHG","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":"522e464861c2e631e4a0862e9cf819b2ca193617291d7bee83c8ff522230fee9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:29:43Z","title_canon_sha256":"bb07eac7e4aac570dfada4c46b3b8f30651d0f7bbdb5eaaf8b2e17a22c2558bd"},"schema_version":"1.0","source":{"id":"1907.04087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04087","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04087v1","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04087","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"FGDK2O7WBRKY","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FGDK2O7WBRKYJLJA","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FGDK2O7W","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:255a19af8f63c2025382b0ebad3f465f037db993bf386386a0a192560045e20c","target":"graph","created_at":"2026-05-17T23:41:05Z","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":"r-gathering problem is a variant of facility location problems. In this problem, we are given a set of users and a set of facilities on same metric space. We open some of the facilities and assign each user to an open facility, so that at least r users are assigned to every open facility. We aim to minimize the maximum distance between user and assigned facility. In general, this problem is NP-hard and admit an approximation algorithm with factor 3. It is known that the problem does not admit any approximation algorithm within a factor less than 3. In our another paper, we proved that this pro","authors_text":"Soh Kumabe, Takanori Maehara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:29:43Z","title":"PTAS and Exact Algorithms for $r$-Gathering Problems on Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04087","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:9d3211b5537e876dc01ed60cc63e3a90c5d09a6fe9b6f5c65d228a3d99f8fccf","target":"record","created_at":"2026-05-17T23:41:05Z","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":"522e464861c2e631e4a0862e9cf819b2ca193617291d7bee83c8ff522230fee9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:29:43Z","title_canon_sha256":"bb07eac7e4aac570dfada4c46b3b8f30651d0f7bbdb5eaaf8b2e17a22c2558bd"},"schema_version":"1.0","source":{"id":"1907.04087","kind":"arxiv","version":1}},"canonical_sha256":"2986ad3bf60c5584ad202ca91e0cb839b1daf123094f50398582fa9430bdadcf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2986ad3bf60c5584ad202ca91e0cb839b1daf123094f50398582fa9430bdadcf","first_computed_at":"2026-05-17T23:41:05.727074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:05.727074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r/FLYz79gaxzobtQ++S1wSHby+16AIt4xyxaTMItOgjRrxMCHTzwfSVfSemeQoRTtmhw1evb+xynkO64/nZKBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:05.727737Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d3211b5537e876dc01ed60cc63e3a90c5d09a6fe9b6f5c65d228a3d99f8fccf","sha256:255a19af8f63c2025382b0ebad3f465f037db993bf386386a0a192560045e20c"],"state_sha256":"c7870c02f73d608842f3b57d549d414dfd566598c27583f44b07ead9c7b98cb8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7PMCmw1L8V17Mu83TPDr8mU/kwNSflJIZ7RXcFBFfYMR1A1HA069yDON/pWMSK4L5kS8R0GJLtLsdnpK2YHGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:35:52.602900Z","bundle_sha256":"5e9173b9af7200dbf141ea24384dff1b667f869631cfe0d8d37d975229e1579d"}}