{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WDLPRVY64MGIWRV6DU57D77P7S","short_pith_number":"pith:WDLPRVY6","schema_version":"1.0","canonical_sha256":"b0d6f8d71ee30c8b46be1d3bf1ffeffc863464d48cce1dc5ffbe5358f4cd7554","source":{"kind":"arxiv","id":"2607.19053","version":1},"attestation_state":"computed","paper":{"title":"Approximating $\\delta$-Dispersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tom Jan{\\ss}en","submitted_at":"2026-07-21T12:40:56Z","abstract_excerpt":"We consider a continuous facility location problem called $\\delta$-Dispersion. For some fixed $\\delta > 0$, the goal is to place as many facilities on a graph as possible with pairwise distance at least $\\delta$. The facilities may be located on the vertices of the graph, or the interior of the edges. This problem can be interpreted as a continuous version of the well-known Independent Set problem. Its approximation behavior is very similar for large values of $\\delta$. Notably, Grigoriev et al. [Algorithmica 21] showed that $\\delta$-Dispersion is solvable in polynomial time when $\\delta = 1/x"},"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":"2607.19053","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2026-07-21T12:40:56Z","cross_cats_sorted":[],"title_canon_sha256":"2bebb169492b9dd2b3ec18e1f9c911f2283470e55fbf47fedb7b3e8a87ee5845","abstract_canon_sha256":"88769965f1c53634c8d58d55f3c13239ff0de33e658a9489ebce1d72bec65feb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T01:24:06.197747Z","signature_b64":"rbOUB/ZugynSSikrRHaY34vtXFrEW1bE0wcJGg+gwJ0FN9QTdwVfDakAP5gOIMHmMYleUutDfbBLo7mAYlFVCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b0d6f8d71ee30c8b46be1d3bf1ffeffc863464d48cce1dc5ffbe5358f4cd7554","last_reissued_at":"2026-07-22T01:24:06.196891Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T01:24:06.196891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating $\\delta$-Dispersion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tom Jan{\\ss}en","submitted_at":"2026-07-21T12:40:56Z","abstract_excerpt":"We consider a continuous facility location problem called $\\delta$-Dispersion. For some fixed $\\delta > 0$, the goal is to place as many facilities on a graph as possible with pairwise distance at least $\\delta$. The facilities may be located on the vertices of the graph, or the interior of the edges. This problem can be interpreted as a continuous version of the well-known Independent Set problem. Its approximation behavior is very similar for large values of $\\delta$. Notably, Grigoriev et al. [Algorithmica 21] showed that $\\delta$-Dispersion is solvable in polynomial time when $\\delta = 1/x"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.19053","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/2607.19053/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":"2607.19053","created_at":"2026-07-22T01:24:06.197344+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.19053v1","created_at":"2026-07-22T01:24:06.197344+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.19053","created_at":"2026-07-22T01:24:06.197344+00:00"},{"alias_kind":"pith_short_12","alias_value":"WDLPRVY64MGI","created_at":"2026-07-22T01:24:06.197344+00:00"},{"alias_kind":"pith_short_16","alias_value":"WDLPRVY64MGIWRV6","created_at":"2026-07-22T01:24:06.197344+00:00"},{"alias_kind":"pith_short_8","alias_value":"WDLPRVY6","created_at":"2026-07-22T01:24:06.197344+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/WDLPRVY64MGIWRV6DU57D77P7S","json":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S.json","graph_json":"https://pith.science/api/pith-number/WDLPRVY64MGIWRV6DU57D77P7S/graph.json","events_json":"https://pith.science/api/pith-number/WDLPRVY64MGIWRV6DU57D77P7S/events.json","paper":"https://pith.science/paper/WDLPRVY6"},"agent_actions":{"view_html":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S","download_json":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S.json","view_paper":"https://pith.science/paper/WDLPRVY6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.19053&json=true","fetch_graph":"https://pith.science/api/pith-number/WDLPRVY64MGIWRV6DU57D77P7S/graph.json","fetch_events":"https://pith.science/api/pith-number/WDLPRVY64MGIWRV6DU57D77P7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S/action/storage_attestation","attest_author":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S/action/author_attestation","sign_citation":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S/action/citation_signature","submit_replication":"https://pith.science/pith/WDLPRVY64MGIWRV6DU57D77P7S/action/replication_record"}},"created_at":"2026-07-22T01:24:06.197344+00:00","updated_at":"2026-07-22T01:24:06.197344+00:00"}