{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OJ2V45ORGFHRXLFOTRC3I7VMU7","short_pith_number":"pith:OJ2V45OR","schema_version":"1.0","canonical_sha256":"72755e75d1314f1bacae9c45b47eaca7c64724231f79bb3c196cb9c8d1da1989","source":{"kind":"arxiv","id":"2507.04485","version":3},"attestation_state":"computed","paper":{"title":"Constant-Approximate and Constant-Strategyproof Two-Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"C. Gregory Plaxton, Elijah Journey Fullerton, Zeyuan Hu","submitted_at":"2025-07-06T17:51:52Z","abstract_excerpt":"We study deterministic mechanisms for the two-facility location problem. Given the reported locations of n agents on the real line, such a mechanism specifies where to build the two facilities. The single-facility variant of this problem admits a simple strategyproof mechanism that minimizes social cost. For two facilities, however, it is known that any strategyproof mechanism is $\\Omega(n)$-approximate. We seek to circumvent this strong lower bound by relaxing the problem requirements. Following other work in the facility location literature, we consider a relaxed form of strategyproofness in"},"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":"2507.04485","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-07-06T17:51:52Z","cross_cats_sorted":[],"title_canon_sha256":"a4d1ce032e0e9076d1228f40322f12485c5d04ffdc818463c40eb71a303a18e8","abstract_canon_sha256":"ed7b9e5b343c10cfada3dec12f0a1d0b1894cfe18ceb26689ad764df594f9460"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:48.409880Z","signature_b64":"ErOQlyVYAbYX6Jb4zrpQh+bwBw1AdcRtP4bHrxUFKOoAQLIZW78ln/z0iIyvKbcC4ALnKNH7o5yrZJTwJ4EEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72755e75d1314f1bacae9c45b47eaca7c64724231f79bb3c196cb9c8d1da1989","last_reissued_at":"2026-07-05T11:53:48.409415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:48.409415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-Approximate and Constant-Strategyproof Two-Facility Location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"C. Gregory Plaxton, Elijah Journey Fullerton, Zeyuan Hu","submitted_at":"2025-07-06T17:51:52Z","abstract_excerpt":"We study deterministic mechanisms for the two-facility location problem. Given the reported locations of n agents on the real line, such a mechanism specifies where to build the two facilities. The single-facility variant of this problem admits a simple strategyproof mechanism that minimizes social cost. For two facilities, however, it is known that any strategyproof mechanism is $\\Omega(n)$-approximate. We seek to circumvent this strong lower bound by relaxing the problem requirements. Following other work in the facility location literature, we consider a relaxed form of strategyproofness in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.04485","kind":"arxiv","version":3},"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/2507.04485/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":"2507.04485","created_at":"2026-07-05T11:53:48.409473+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.04485v3","created_at":"2026-07-05T11:53:48.409473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.04485","created_at":"2026-07-05T11:53:48.409473+00:00"},{"alias_kind":"pith_short_12","alias_value":"OJ2V45ORGFHR","created_at":"2026-07-05T11:53:48.409473+00:00"},{"alias_kind":"pith_short_16","alias_value":"OJ2V45ORGFHRXLFO","created_at":"2026-07-05T11:53:48.409473+00:00"},{"alias_kind":"pith_short_8","alias_value":"OJ2V45OR","created_at":"2026-07-05T11:53:48.409473+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/OJ2V45ORGFHRXLFOTRC3I7VMU7","json":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7.json","graph_json":"https://pith.science/api/pith-number/OJ2V45ORGFHRXLFOTRC3I7VMU7/graph.json","events_json":"https://pith.science/api/pith-number/OJ2V45ORGFHRXLFOTRC3I7VMU7/events.json","paper":"https://pith.science/paper/OJ2V45OR"},"agent_actions":{"view_html":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7","download_json":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7.json","view_paper":"https://pith.science/paper/OJ2V45OR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.04485&json=true","fetch_graph":"https://pith.science/api/pith-number/OJ2V45ORGFHRXLFOTRC3I7VMU7/graph.json","fetch_events":"https://pith.science/api/pith-number/OJ2V45ORGFHRXLFOTRC3I7VMU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7/action/storage_attestation","attest_author":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7/action/author_attestation","sign_citation":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7/action/citation_signature","submit_replication":"https://pith.science/pith/OJ2V45ORGFHRXLFOTRC3I7VMU7/action/replication_record"}},"created_at":"2026-07-05T11:53:48.409473+00:00","updated_at":"2026-07-05T11:53:48.409473+00:00"}