{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OJSXOOASOJ5DEVBZ5FG7LNGT3F","short_pith_number":"pith:OJSXOOAS","schema_version":"1.0","canonical_sha256":"7265773812727a325439e94df5b4d3d964547de8f4e22f06a508555883548f43","source":{"kind":"arxiv","id":"2308.07099","version":1},"attestation_state":"computed","paper":{"title":"Kernelization for Spreading Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2023-08-14T12:23:53Z","abstract_excerpt":"We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance, we can obtain an arrangement of points such that no pair of points is ``close\" to each other. More precisely, for a family of $n$ points, an integer $k$, and a real number $d > 0$, we ask whether at most $k$ points could be relocated, each point at distance at most $d$ from its original location, such that the distance between each pair of points is at least a fixed constant, say $1$. A number of approximation algor"},"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":"2308.07099","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CG","submitted_at":"2023-08-14T12:23:53Z","cross_cats_sorted":[],"title_canon_sha256":"a552a6450187f4f56a93cde43b30a43ee593ec7ef061e3b7416fd247c64d9cd3","abstract_canon_sha256":"1827e3e1cad4ee5b7e9d0ca49a3ae9a19e5d47effd54e5f6b191f6f97bcb279e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:40:56.233795Z","signature_b64":"pDlWvRa8mDuWYZGEdxIXy4mZjKYP2U9ieq3VbdQVz/kd5nbYKM3ix483/+OJwtsrN/+9S5iuYx9bvSNvkyaEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7265773812727a325439e94df5b4d3d964547de8f4e22f06a508555883548f43","last_reissued_at":"2026-07-05T06:40:56.233388Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:40:56.233388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Kernelization for Spreading Points","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Fedor V. Fomin, Meirav Zehavi, Petr A. Golovach, Saket Saurabh, Tanmay Inamdar","submitted_at":"2023-08-14T12:23:53Z","abstract_excerpt":"We consider the following problem about dispersing points. Given a set of points in the plane, the task is to identify whether by moving a small number of points by small distance, we can obtain an arrangement of points such that no pair of points is ``close\" to each other. More precisely, for a family of $n$ points, an integer $k$, and a real number $d > 0$, we ask whether at most $k$ points could be relocated, each point at distance at most $d$ from its original location, such that the distance between each pair of points is at least a fixed constant, say $1$. A number of approximation algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07099","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.07099/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":"2308.07099","created_at":"2026-07-05T06:40:56.233446+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.07099v1","created_at":"2026-07-05T06:40:56.233446+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07099","created_at":"2026-07-05T06:40:56.233446+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJSXOOASOJ5D","created_at":"2026-07-05T06:40:56.233446+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJSXOOASOJ5DEVBZ","created_at":"2026-07-05T06:40:56.233446+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJSXOOAS","created_at":"2026-07-05T06:40:56.233446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F","json":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F.json","graph_json":"https://pith.science/api/pith-number/OJSXOOASOJ5DEVBZ5FG7LNGT3F/graph.json","events_json":"https://pith.science/api/pith-number/OJSXOOASOJ5DEVBZ5FG7LNGT3F/events.json","paper":"https://pith.science/paper/OJSXOOAS"},"agent_actions":{"view_html":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F","download_json":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F.json","view_paper":"https://pith.science/paper/OJSXOOAS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.07099&json=true","fetch_graph":"https://pith.science/api/pith-number/OJSXOOASOJ5DEVBZ5FG7LNGT3F/graph.json","fetch_events":"https://pith.science/api/pith-number/OJSXOOASOJ5DEVBZ5FG7LNGT3F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F/action/storage_attestation","attest_author":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F/action/author_attestation","sign_citation":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F/action/citation_signature","submit_replication":"https://pith.science/pith/OJSXOOASOJ5DEVBZ5FG7LNGT3F/action/replication_record"}},"created_at":"2026-07-05T06:40:56.233446+00:00","updated_at":"2026-07-05T06:40:56.233446+00:00"}