{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SCRBDES4WP7QM5SL7CIIC5GOIJ","short_pith_number":"pith:SCRBDES4","canonical_record":{"source":{"id":"1907.04088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:33:01Z","cross_cats_sorted":[],"title_canon_sha256":"fac0cd9ad14ac5c0e2d554fd20bf85146084d3148883dbc0f48370633eac3ae4","abstract_canon_sha256":"74b0ce38fda54d0c9b478000992dc8da6d802c0f471520f5b3193abcf9f40f51"},"schema_version":"1.0"},"canonical_sha256":"90a211925cb3ff06764bf8908174ce4263729dc4c4249f7e32b461330904f8a0","source":{"kind":"arxiv","id":"1907.04088","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04088","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04088v1","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04088","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"SCRBDES4WP7Q","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SCRBDES4WP7QM5SL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SCRBDES4","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SCRBDES4WP7QM5SL7CIIC5GOIJ","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04088","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:33:01Z","cross_cats_sorted":[],"title_canon_sha256":"fac0cd9ad14ac5c0e2d554fd20bf85146084d3148883dbc0f48370633eac3ae4","abstract_canon_sha256":"74b0ce38fda54d0c9b478000992dc8da6d802c0f471520f5b3193abcf9f40f51"},"schema_version":"1.0"},"canonical_sha256":"90a211925cb3ff06764bf8908174ce4263729dc4c4249f7e32b461330904f8a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:05.719630Z","signature_b64":"spvfYyAJJvxlWqwCRhaVWviqQTMgmijMkSC4jzKesW2EwtAQM2+YwlsWKSSokUDm80/x6T/F8g9sL24J9Q+7DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90a211925cb3ff06764bf8908174ce4263729dc4c4249f7e32b461330904f8a0","last_reissued_at":"2026-05-17T23:41:05.718950Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:05.718950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04088","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":"ZQJE+s3FKVxSncXwRYZrqT/98Rjw4hhn7GGBZvtBSdF22DQVCQFRCNzbXQrTARIyZiYtzNwvhG/1rqgmPr0jBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:41:18.249669Z"},"content_sha256":"a5d6c9bc65a4c1aa31c3eee0580ecc481cdb2a8d2668c275ec909762e3daa2c9","schema_version":"1.0","event_id":"sha256:a5d6c9bc65a4c1aa31c3eee0580ecc481cdb2a8d2668c275ec909762e3daa2c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SCRBDES4WP7QM5SL7CIIC5GOIJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"$r$-Gather Clustering and $r$-Gathering on Spider: FPT Algorithms and Hardness","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:33:01Z","abstract_excerpt":"We consider min-max $r$-gather clustering problem and min-max $r$-gathering problem. In the min-max $r$-gather clustering problem, we are given a set of users and divide them into clusters with size at least $r$; the goal is to minimize the maximum diameter of clusters. In the min-max $r$-gathering problem, we are additionally given a set of facilities and assign each cluster to a facility; the goal is to minimize the maximum distance between the users and the assigned facility. In this study, we consider the case that the users and facilities are located on a ``spider'' and propose the first "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04088","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":"E8GJuTqhYH3dOiBUwKkPb45sA9wi1Sxj6qho2p3rusFPX5l2tFvib9d5/7Azzti0uKqV8UCN3fxX997uQllOBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:41:18.250045Z"},"content_sha256":"fc6015c3bd2eebf9a439da449ad453f4005c20d41590b16c26cc3d466aa62fd6","schema_version":"1.0","event_id":"sha256:fc6015c3bd2eebf9a439da449ad453f4005c20d41590b16c26cc3d466aa62fd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SCRBDES4WP7QM5SL7CIIC5GOIJ/bundle.json","state_url":"https://pith.science/pith/SCRBDES4WP7QM5SL7CIIC5GOIJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SCRBDES4WP7QM5SL7CIIC5GOIJ/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-25T12:41:18Z","links":{"resolver":"https://pith.science/pith/SCRBDES4WP7QM5SL7CIIC5GOIJ","bundle":"https://pith.science/pith/SCRBDES4WP7QM5SL7CIIC5GOIJ/bundle.json","state":"https://pith.science/pith/SCRBDES4WP7QM5SL7CIIC5GOIJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SCRBDES4WP7QM5SL7CIIC5GOIJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SCRBDES4WP7QM5SL7CIIC5GOIJ","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":"74b0ce38fda54d0c9b478000992dc8da6d802c0f471520f5b3193abcf9f40f51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:33:01Z","title_canon_sha256":"fac0cd9ad14ac5c0e2d554fd20bf85146084d3148883dbc0f48370633eac3ae4"},"schema_version":"1.0","source":{"id":"1907.04088","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04088","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04088v1","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04088","created_at":"2026-05-17T23:41:05Z"},{"alias_kind":"pith_short_12","alias_value":"SCRBDES4WP7Q","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SCRBDES4WP7QM5SL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SCRBDES4","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:fc6015c3bd2eebf9a439da449ad453f4005c20d41590b16c26cc3d466aa62fd6","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":"We consider min-max $r$-gather clustering problem and min-max $r$-gathering problem. In the min-max $r$-gather clustering problem, we are given a set of users and divide them into clusters with size at least $r$; the goal is to minimize the maximum diameter of clusters. In the min-max $r$-gathering problem, we are additionally given a set of facilities and assign each cluster to a facility; the goal is to minimize the maximum distance between the users and the assigned facility. In this study, we consider the case that the users and facilities are located on a ``spider'' and propose the first ","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:33:01Z","title":"$r$-Gather Clustering and $r$-Gathering on Spider: FPT Algorithms and Hardness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04088","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:a5d6c9bc65a4c1aa31c3eee0580ecc481cdb2a8d2668c275ec909762e3daa2c9","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":"74b0ce38fda54d0c9b478000992dc8da6d802c0f471520f5b3193abcf9f40f51","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-09T11:33:01Z","title_canon_sha256":"fac0cd9ad14ac5c0e2d554fd20bf85146084d3148883dbc0f48370633eac3ae4"},"schema_version":"1.0","source":{"id":"1907.04088","kind":"arxiv","version":1}},"canonical_sha256":"90a211925cb3ff06764bf8908174ce4263729dc4c4249f7e32b461330904f8a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90a211925cb3ff06764bf8908174ce4263729dc4c4249f7e32b461330904f8a0","first_computed_at":"2026-05-17T23:41:05.718950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:05.718950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"spvfYyAJJvxlWqwCRhaVWviqQTMgmijMkSC4jzKesW2EwtAQM2+YwlsWKSSokUDm80/x6T/F8g9sL24J9Q+7DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:05.719630Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04088","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a5d6c9bc65a4c1aa31c3eee0580ecc481cdb2a8d2668c275ec909762e3daa2c9","sha256:fc6015c3bd2eebf9a439da449ad453f4005c20d41590b16c26cc3d466aa62fd6"],"state_sha256":"f2b0d98ba4fa3228555e06510bc0f72144d18198458245f23964115c4a3ba158"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5BL2z0DsPt61vGIuDYldtONEHMso+ircLxDi8kWzFc5gCM53SXZ/P96BXfCl16Wqf+IO1HMfs9mGcGY8B569BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:41:18.253481Z","bundle_sha256":"d0e03776cdf866de03fb07aaadb32b0ba4b1c8e0e52bb21392daec73cf8b0b13"}}