{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:HDVHIHD7OFAOIAVSSGAOHABZ36","short_pith_number":"pith:HDVHIHD7","schema_version":"1.0","canonical_sha256":"38ea741c7f7140e402b29180e38039dfade13b04cc034301f4ab40fcce055662","source":{"kind":"arxiv","id":"2403.12181","version":1},"attestation_state":"computed","paper":{"title":"MAC Advice for Facility Location Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Anupam Gupta, Inbal Talgam-Cohen, Zohar Barak","submitted_at":"2024-03-18T18:52:04Z","abstract_excerpt":"Algorithms with predictions have attracted much attention in the last years across various domains, including variants of facility location, as a way to surpass traditional worst-case analyses. We study the $k$-facility location mechanism design problem, where the $n$ agents are strategic and might misreport their location.\n  Unlike previous models, where predictions are for the $k$ optimal facility locations, we receive $n$ predictions for the locations of each of the agents. However, these predictions are only \"mostly\" and \"approximately\" correct (or MAC for short) -- i.e., some $\\delta$-fra"},"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":"2403.12181","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2024-03-18T18:52:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ff476322bd21ac9a747ee0efed1347219126889d84ff244ddd83d54a7dcb9dbd","abstract_canon_sha256":"962e66b30e4e1d189a472b9e7cd7884ec27041393b11e6f43e31351bab17df75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:56.777593Z","signature_b64":"T9DEne5U4tb/HJVWITdBK5ixUMu/xiPNWsKOIZyavaB3noQo6LKmwuIn+B5WsYi1xOe9H5F3Szo4Xa0hDoiMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38ea741c7f7140e402b29180e38039dfade13b04cc034301f4ab40fcce055662","last_reissued_at":"2026-07-05T07:57:56.777183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:56.777183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MAC Advice for Facility Location Mechanism Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.GT","authors_text":"Anupam Gupta, Inbal Talgam-Cohen, Zohar Barak","submitted_at":"2024-03-18T18:52:04Z","abstract_excerpt":"Algorithms with predictions have attracted much attention in the last years across various domains, including variants of facility location, as a way to surpass traditional worst-case analyses. We study the $k$-facility location mechanism design problem, where the $n$ agents are strategic and might misreport their location.\n  Unlike previous models, where predictions are for the $k$ optimal facility locations, we receive $n$ predictions for the locations of each of the agents. However, these predictions are only \"mostly\" and \"approximately\" correct (or MAC for short) -- i.e., some $\\delta$-fra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.12181","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/2403.12181/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":"2403.12181","created_at":"2026-07-05T07:57:56.777248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.12181v1","created_at":"2026-07-05T07:57:56.777248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.12181","created_at":"2026-07-05T07:57:56.777248+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDVHIHD7OFAO","created_at":"2026-07-05T07:57:56.777248+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDVHIHD7OFAOIAVS","created_at":"2026-07-05T07:57:56.777248+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDVHIHD7","created_at":"2026-07-05T07:57:56.777248+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08578","citing_title":"Approximation guarantees of Median Mechanism in $\\mathbb{R}^d$","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36","json":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36.json","graph_json":"https://pith.science/api/pith-number/HDVHIHD7OFAOIAVSSGAOHABZ36/graph.json","events_json":"https://pith.science/api/pith-number/HDVHIHD7OFAOIAVSSGAOHABZ36/events.json","paper":"https://pith.science/paper/HDVHIHD7"},"agent_actions":{"view_html":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36","download_json":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36.json","view_paper":"https://pith.science/paper/HDVHIHD7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.12181&json=true","fetch_graph":"https://pith.science/api/pith-number/HDVHIHD7OFAOIAVSSGAOHABZ36/graph.json","fetch_events":"https://pith.science/api/pith-number/HDVHIHD7OFAOIAVSSGAOHABZ36/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36/action/storage_attestation","attest_author":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36/action/author_attestation","sign_citation":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36/action/citation_signature","submit_replication":"https://pith.science/pith/HDVHIHD7OFAOIAVSSGAOHABZ36/action/replication_record"}},"created_at":"2026-07-05T07:57:56.777248+00:00","updated_at":"2026-07-05T07:57:56.777248+00:00"}