{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:TW32F7RMXSFHOL477IUUDA3YYL","short_pith_number":"pith:TW32F7RM","schema_version":"1.0","canonical_sha256":"9db7a2fe2cbc8a772f9ffa29418378c2ea6d2c85889c772b99187734ce535090","source":{"kind":"arxiv","id":"2411.02845","version":2},"attestation_state":"computed","paper":{"title":"Max-Distance Sparsification for Diversification and Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Soh Kumabe","submitted_at":"2024-11-05T06:34:29Z","abstract_excerpt":"Let $\\mathcal{D}$ be a set family that is the solution domain of some combinatorial problem. The \\emph{max-min diversification problem on $\\mathcal{D}$} is the problem to select $k$ sets from $\\mathcal{D}$ such that the Hamming distance between any two selected sets is at least $d$. FPT algorithms parameterized by $k+\\ell $, where $\\ell=\\max_{D\\in \\mathcal{D}}|D|$, and $k+d$ have been actively studied recently for several specific domains.\n  This paper provides unified algorithmic frameworks to solve this problem. Specifically, for each parameterization $k+\\ell $ and $k+d$, we provide an FPT o"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2411.02845","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T06:34:29Z","cross_cats_sorted":[],"title_canon_sha256":"f15558c938096605d92ecd09d306d2e6ecb603e2ea3be054c1b4aa9c2bc0b4c2","abstract_canon_sha256":"eafe8ecc8d7bc4cbd4fdd37b45e338f4e0b1f5922cb8fe9b2393551e0e046e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:28:12.141605Z","signature_b64":"bynxVxHyr7cdtdYERN0HRr+BJRl7E/+40M8c9irsuw+Ygh0sgK7VnDumboDvUGNINHjEdES8xLCiGIOO73H0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9db7a2fe2cbc8a772f9ffa29418378c2ea6d2c85889c772b99187734ce535090","last_reissued_at":"2026-07-05T11:28:12.141081Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:28:12.141081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Max-Distance Sparsification for Diversification and Clustering","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Soh Kumabe","submitted_at":"2024-11-05T06:34:29Z","abstract_excerpt":"Let $\\mathcal{D}$ be a set family that is the solution domain of some combinatorial problem. The \\emph{max-min diversification problem on $\\mathcal{D}$} is the problem to select $k$ sets from $\\mathcal{D}$ such that the Hamming distance between any two selected sets is at least $d$. FPT algorithms parameterized by $k+\\ell $, where $\\ell=\\max_{D\\in \\mathcal{D}}|D|$, and $k+d$ have been actively studied recently for several specific domains.\n  This paper provides unified algorithmic frameworks to solve this problem. Specifically, for each parameterization $k+\\ell $ and $k+d$, we provide an FPT o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02845","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.02845/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.02845","created_at":"2026-07-05T11:28:12.141148+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.02845v2","created_at":"2026-07-05T11:28:12.141148+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02845","created_at":"2026-07-05T11:28:12.141148+00:00"},{"alias_kind":"pith_short_12","alias_value":"TW32F7RMXSFH","created_at":"2026-07-05T11:28:12.141148+00:00"},{"alias_kind":"pith_short_16","alias_value":"TW32F7RMXSFHOL47","created_at":"2026-07-05T11:28:12.141148+00:00"},{"alias_kind":"pith_short_8","alias_value":"TW32F7RM","created_at":"2026-07-05T11:28:12.141148+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.12261","citing_title":"A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL","json":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL.json","graph_json":"https://pith.science/api/pith-number/TW32F7RMXSFHOL477IUUDA3YYL/graph.json","events_json":"https://pith.science/api/pith-number/TW32F7RMXSFHOL477IUUDA3YYL/events.json","paper":"https://pith.science/paper/TW32F7RM"},"agent_actions":{"view_html":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL","download_json":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL.json","view_paper":"https://pith.science/paper/TW32F7RM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.02845&json=true","fetch_graph":"https://pith.science/api/pith-number/TW32F7RMXSFHOL477IUUDA3YYL/graph.json","fetch_events":"https://pith.science/api/pith-number/TW32F7RMXSFHOL477IUUDA3YYL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/action/storage_attestation","attest_author":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/action/author_attestation","sign_citation":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/action/citation_signature","submit_replication":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/action/replication_record"}},"created_at":"2026-07-05T11:28:12.141148+00:00","updated_at":"2026-07-05T11:28:12.141148+00:00"}