{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:TW32F7RMXSFHOL477IUUDA3YYL","short_pith_number":"pith:TW32F7RM","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"},"canonical_sha256":"9db7a2fe2cbc8a772f9ffa29418378c2ea6d2c85889c772b99187734ce535090","source":{"kind":"arxiv","id":"2411.02845","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.02845","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"2411.02845v2","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02845","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"TW32F7RMXSFH","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"pith_short_16","alias_value":"TW32F7RMXSFHOL47","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"pith_short_8","alias_value":"TW32F7RM","created_at":"2026-07-05T11:28:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:TW32F7RMXSFHOL477IUUDA3YYL","target":"record","payload":{"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"},"canonical_sha256":"9db7a2fe2cbc8a772f9ffa29418378c2ea6d2c85889c772b99187734ce535090","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"},"source_kind":"arxiv","source_id":"2411.02845","source_version":2,"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-07-05T11:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PzOxoowsrsQnRnIaKj/ertJpR482r57eSKn8PpsRCCdhTLOSFxw06WMDAFnBGHD8bF3mO/NZNs07qF7biCKIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:31:00.618600Z"},"content_sha256":"f69a6af31bf8d95affdc54ae061d27774ca109c4276ed1aff22ac253655a099b","schema_version":"1.0","event_id":"sha256:f69a6af31bf8d95affdc54ae061d27774ca109c4276ed1aff22ac253655a099b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:TW32F7RMXSFHOL477IUUDA3YYL","target":"graph","payload":{"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"},"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-07-05T11:28:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4S9EJ7SJA8caQWAbmvblz47r6ElvksnvO/tnDrEMBXLwVZjOo5YODkX9ZhuxhO1vaPD3YSAqOggT/uev3aL3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T17:31:00.619483Z"},"content_sha256":"12e6c4006083ac506cb910fd787297954459392f22c17b79715cbe91d9b186ba","schema_version":"1.0","event_id":"sha256:12e6c4006083ac506cb910fd787297954459392f22c17b79715cbe91d9b186ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/bundle.json","state_url":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TW32F7RMXSFHOL477IUUDA3YYL/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-08-15T17:31:00Z","links":{"resolver":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL","bundle":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/bundle.json","state":"https://pith.science/pith/TW32F7RMXSFHOL477IUUDA3YYL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TW32F7RMXSFHOL477IUUDA3YYL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:TW32F7RMXSFHOL477IUUDA3YYL","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":"eafe8ecc8d7bc4cbd4fdd37b45e338f4e0b1f5922cb8fe9b2393551e0e046e6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T06:34:29Z","title_canon_sha256":"f15558c938096605d92ecd09d306d2e6ecb603e2ea3be054c1b4aa9c2bc0b4c2"},"schema_version":"1.0","source":{"id":"2411.02845","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.02845","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"arxiv_version","alias_value":"2411.02845v2","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.02845","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"pith_short_12","alias_value":"TW32F7RMXSFH","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"pith_short_16","alias_value":"TW32F7RMXSFHOL47","created_at":"2026-07-05T11:28:12Z"},{"alias_kind":"pith_short_8","alias_value":"TW32F7RM","created_at":"2026-07-05T11:28:12Z"}],"graph_snapshots":[{"event_id":"sha256:12e6c4006083ac506cb910fd787297954459392f22c17b79715cbe91d9b186ba","target":"graph","created_at":"2026-07-05T11:28:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.02845/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Soh Kumabe","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T06:34:29Z","title":"Max-Distance Sparsification for Diversification and Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.02845","kind":"arxiv","version":2},"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:f69a6af31bf8d95affdc54ae061d27774ca109c4276ed1aff22ac253655a099b","target":"record","created_at":"2026-07-05T11:28:12Z","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":"eafe8ecc8d7bc4cbd4fdd37b45e338f4e0b1f5922cb8fe9b2393551e0e046e6f","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T06:34:29Z","title_canon_sha256":"f15558c938096605d92ecd09d306d2e6ecb603e2ea3be054c1b4aa9c2bc0b4c2"},"schema_version":"1.0","source":{"id":"2411.02845","kind":"arxiv","version":2}},"canonical_sha256":"9db7a2fe2cbc8a772f9ffa29418378c2ea6d2c85889c772b99187734ce535090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9db7a2fe2cbc8a772f9ffa29418378c2ea6d2c85889c772b99187734ce535090","first_computed_at":"2026-07-05T11:28:12.141081Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:28:12.141081Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bynxVxHyr7cdtdYERN0HRr+BJRl7E/+40M8c9irsuw+Ygh0sgK7VnDumboDvUGNINHjEdES8xLCiGIOO73H0Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:28:12.141605Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.02845","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f69a6af31bf8d95affdc54ae061d27774ca109c4276ed1aff22ac253655a099b","sha256:12e6c4006083ac506cb910fd787297954459392f22c17b79715cbe91d9b186ba"],"state_sha256":"70acae34c5d93b3402815eb31a79d6a869cd61acefdd5452ff95920ae83935ed"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KhdohQfBOHLI54nYrGFfWcySiij6SGVhCmbarpPVxzJOq4ab/j/Jhnj5DtlBAU5wO2Z0QqPb/NFVkLEVuxMuCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T17:31:00.623901Z","bundle_sha256":"dacffcf2cf557bb5e1bb89a3e1d0ae3728e5bff0796a92d0da89f34b42e38635"}}