{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:QRYOZQT3552LMMCG4RMTKJ5WL5","short_pith_number":"pith:QRYOZQT3","schema_version":"1.0","canonical_sha256":"8470ecc27bef74b63046e4593527b65f70c85e564194e33de0cfb0edface8eb8","source":{"kind":"arxiv","id":"2002.02789","version":2},"attestation_state":"computed","paper":{"title":"Computing envy-freeable allocations with limited subsidies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Ioannis Caragiannis, Stavros Ioannidis","submitted_at":"2020-02-06T11:57:59Z","abstract_excerpt":"Fair division has emerged as a very hot topic in multiagent systems, and envy-freeness is among the most compelling fairness concepts. An allocation of indivisible items to agents is envy-free if no agent prefers the bundle of any other agent to his own in terms of value. As envy-freeness is rarely a feasible goal, there is a recent focus on relaxations of its definition. An approach in this direction is to complement allocations with payments (or subsidies) to the agents. A feasible goal then is to achieve envy-freeness in terms of the total value an agent gets from the allocation and the sub"},"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":"2002.02789","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2020-02-06T11:57:59Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"951a7bea9bcd6336c09917b9b4901e74bcd8369fb28894353bc30aa584e4a95a","abstract_canon_sha256":"35d43d6624041c940646d80b7cc5b78a163ae93d66d8669ba0138da41b54e060"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:18:14.793660Z","signature_b64":"qFXnQljxfl9hxC8GDGKoBCQ5VND0EsjTnDSVMjONhDId4k0NUqIddvL9mIHdGRLUckmiqhTAw+q0VNnxdMpuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8470ecc27bef74b63046e4593527b65f70c85e564194e33de0cfb0edface8eb8","last_reissued_at":"2026-07-05T02:18:14.793179Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:18:14.793179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing envy-freeable allocations with limited subsidies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.GT","authors_text":"Ioannis Caragiannis, Stavros Ioannidis","submitted_at":"2020-02-06T11:57:59Z","abstract_excerpt":"Fair division has emerged as a very hot topic in multiagent systems, and envy-freeness is among the most compelling fairness concepts. An allocation of indivisible items to agents is envy-free if no agent prefers the bundle of any other agent to his own in terms of value. As envy-freeness is rarely a feasible goal, there is a recent focus on relaxations of its definition. An approach in this direction is to complement allocations with payments (or subsidies) to the agents. A feasible goal then is to achieve envy-freeness in terms of the total value an agent gets from the allocation and the sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2002.02789","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/2002.02789/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":"2002.02789","created_at":"2026-07-05T02:18:14.793237+00:00"},{"alias_kind":"arxiv_version","alias_value":"2002.02789v2","created_at":"2026-07-05T02:18:14.793237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2002.02789","created_at":"2026-07-05T02:18:14.793237+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRYOZQT3552L","created_at":"2026-07-05T02:18:14.793237+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRYOZQT3552LMMCG","created_at":"2026-07-05T02:18:14.793237+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRYOZQT3","created_at":"2026-07-05T02:18:14.793237+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/QRYOZQT3552LMMCG4RMTKJ5WL5","json":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5.json","graph_json":"https://pith.science/api/pith-number/QRYOZQT3552LMMCG4RMTKJ5WL5/graph.json","events_json":"https://pith.science/api/pith-number/QRYOZQT3552LMMCG4RMTKJ5WL5/events.json","paper":"https://pith.science/paper/QRYOZQT3"},"agent_actions":{"view_html":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5","download_json":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5.json","view_paper":"https://pith.science/paper/QRYOZQT3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2002.02789&json=true","fetch_graph":"https://pith.science/api/pith-number/QRYOZQT3552LMMCG4RMTKJ5WL5/graph.json","fetch_events":"https://pith.science/api/pith-number/QRYOZQT3552LMMCG4RMTKJ5WL5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5/action/storage_attestation","attest_author":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5/action/author_attestation","sign_citation":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5/action/citation_signature","submit_replication":"https://pith.science/pith/QRYOZQT3552LMMCG4RMTKJ5WL5/action/replication_record"}},"created_at":"2026-07-05T02:18:14.793237+00:00","updated_at":"2026-07-05T02:18:14.793237+00:00"}