{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:V3H2CGGWMCSZIX2Q6HVLRS6XUK","short_pith_number":"pith:V3H2CGGW","schema_version":"1.0","canonical_sha256":"aecfa118d660a5945f50f1eab8cbd7a2a28fdf920b248c23fe1e691af4eca600","source":{"kind":"arxiv","id":"2011.07934","version":2},"attestation_state":"computed","paper":{"title":"A Distributed Differentially Private Algorithm for Resource Allocation in Unboundedly Large Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.MA","authors_text":"Aleksei Triastcyn, Boi Faltings, Panayiotis Danassis","submitted_at":"2020-11-16T13:33:04Z","abstract_excerpt":"We introduce a practical and scalable algorithm (PALMA) for solving one of the fundamental problems of multi-agent systems -- finding matches and allocations -- in unboundedly large settings (e.g., resource allocation in urban environments, mobility-on-demand systems, etc.), while providing strong worst-case privacy guarantees. PALMA is decentralized, runs on-device, requires no inter-agent communication, and converges in constant time under reasonable assumptions. We evaluate PALMA in a mobility-on-demand and a paper assignment scenario, using real data in both, and demonstrate that it provid"},"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":"2011.07934","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2020-11-16T13:33:04Z","cross_cats_sorted":["cs.AI","cs.CR"],"title_canon_sha256":"188ee8ddfefba3344a0effd419fb363844894cf1a08254cdb11bfe035977758e","abstract_canon_sha256":"be6f984a3f37e274a8bb036f13960fbfdce60021ff7006af3f20bc13a3639889"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:36.386122Z","signature_b64":"HWDGUvhgkWrzAAgUAfXIOWe4aeYyBOak4SPDnQjxVCy5DQYn6Zfn4UFJCq6wc/moOXZPbQifvvZS4koxOo0DBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aecfa118d660a5945f50f1eab8cbd7a2a28fdf920b248c23fe1e691af4eca600","last_reissued_at":"2026-07-05T04:04:36.385574Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:36.385574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Distributed Differentially Private Algorithm for Resource Allocation in Unboundedly Large Settings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CR"],"primary_cat":"cs.MA","authors_text":"Aleksei Triastcyn, Boi Faltings, Panayiotis Danassis","submitted_at":"2020-11-16T13:33:04Z","abstract_excerpt":"We introduce a practical and scalable algorithm (PALMA) for solving one of the fundamental problems of multi-agent systems -- finding matches and allocations -- in unboundedly large settings (e.g., resource allocation in urban environments, mobility-on-demand systems, etc.), while providing strong worst-case privacy guarantees. PALMA is decentralized, runs on-device, requires no inter-agent communication, and converges in constant time under reasonable assumptions. We evaluate PALMA in a mobility-on-demand and a paper assignment scenario, using real data in both, and demonstrate that it provid"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.07934","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/2011.07934/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":"2011.07934","created_at":"2026-07-05T04:04:36.385646+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.07934v2","created_at":"2026-07-05T04:04:36.385646+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.07934","created_at":"2026-07-05T04:04:36.385646+00:00"},{"alias_kind":"pith_short_12","alias_value":"V3H2CGGWMCSZ","created_at":"2026-07-05T04:04:36.385646+00:00"},{"alias_kind":"pith_short_16","alias_value":"V3H2CGGWMCSZIX2Q","created_at":"2026-07-05T04:04:36.385646+00:00"},{"alias_kind":"pith_short_8","alias_value":"V3H2CGGW","created_at":"2026-07-05T04:04:36.385646+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/V3H2CGGWMCSZIX2Q6HVLRS6XUK","json":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK.json","graph_json":"https://pith.science/api/pith-number/V3H2CGGWMCSZIX2Q6HVLRS6XUK/graph.json","events_json":"https://pith.science/api/pith-number/V3H2CGGWMCSZIX2Q6HVLRS6XUK/events.json","paper":"https://pith.science/paper/V3H2CGGW"},"agent_actions":{"view_html":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK","download_json":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK.json","view_paper":"https://pith.science/paper/V3H2CGGW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.07934&json=true","fetch_graph":"https://pith.science/api/pith-number/V3H2CGGWMCSZIX2Q6HVLRS6XUK/graph.json","fetch_events":"https://pith.science/api/pith-number/V3H2CGGWMCSZIX2Q6HVLRS6XUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK/action/storage_attestation","attest_author":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK/action/author_attestation","sign_citation":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK/action/citation_signature","submit_replication":"https://pith.science/pith/V3H2CGGWMCSZIX2Q6HVLRS6XUK/action/replication_record"}},"created_at":"2026-07-05T04:04:36.385646+00:00","updated_at":"2026-07-05T04:04:36.385646+00:00"}