{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LPHXLUM7UWMPYLA2KXEZIU5QU4","short_pith_number":"pith:LPHXLUM7","schema_version":"1.0","canonical_sha256":"5bcf75d19fa598fc2c1a55c99453b0a7181c792283125508fa1bedbca35f0d90","source":{"kind":"arxiv","id":"2304.01644","version":2},"attestation_state":"computed","paper":{"title":"Repeated Fair Allocation of Indivisible Items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arianna Novaro, Ayumi Igarashi, Martin Lackner, Oliviero Nardi","submitted_at":"2023-04-04T09:00:58Z","abstract_excerpt":"The problem of fairly allocating a set of indivisible items is a well-known challenge in the field of (computational) social choice. In this scenario, there is a fundamental incompatibility between notions of fairness (such as envy-freeness and proportionality) and economic efficiency (such as Pareto-optimality). However, in the real world, items are not always allocated once and for all, but often repeatedly. For example, the items may be recurring chores to distribute in a household. Motivated by this, we initiate the study of the repeated fair division of indivisible goods and chores, and p"},"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":"2304.01644","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-04-04T09:00:58Z","cross_cats_sorted":[],"title_canon_sha256":"f417b43eb763ed68c3671568312fcd792570bf15fe3a09165ccb1c324294e027","abstract_canon_sha256":"6ae3924a828eca020c37a2414a086466c41443ec23cd0c1c1956d0a8e120267f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:26:13.020560Z","signature_b64":"gOswBwd2MwR9f8ifMZ1R2uS1MMGk4hVnbxAKUU6yy/Ztb87o9SQAWzuwl0LDcnPJXFn8AgMw5+G4z1I17ZudAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bcf75d19fa598fc2c1a55c99453b0a7181c792283125508fa1bedbca35f0d90","last_reissued_at":"2026-07-05T07:26:13.019957Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:26:13.019957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repeated Fair Allocation of Indivisible Items","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Arianna Novaro, Ayumi Igarashi, Martin Lackner, Oliviero Nardi","submitted_at":"2023-04-04T09:00:58Z","abstract_excerpt":"The problem of fairly allocating a set of indivisible items is a well-known challenge in the field of (computational) social choice. In this scenario, there is a fundamental incompatibility between notions of fairness (such as envy-freeness and proportionality) and economic efficiency (such as Pareto-optimality). However, in the real world, items are not always allocated once and for all, but often repeatedly. For example, the items may be recurring chores to distribute in a household. Motivated by this, we initiate the study of the repeated fair division of indivisible goods and chores, and p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01644","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/2304.01644/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":"2304.01644","created_at":"2026-07-05T07:26:13.020017+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.01644v2","created_at":"2026-07-05T07:26:13.020017+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01644","created_at":"2026-07-05T07:26:13.020017+00:00"},{"alias_kind":"pith_short_12","alias_value":"LPHXLUM7UWMP","created_at":"2026-07-05T07:26:13.020017+00:00"},{"alias_kind":"pith_short_16","alias_value":"LPHXLUM7UWMPYLA2","created_at":"2026-07-05T07:26:13.020017+00:00"},{"alias_kind":"pith_short_8","alias_value":"LPHXLUM7","created_at":"2026-07-05T07:26:13.020017+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/LPHXLUM7UWMPYLA2KXEZIU5QU4","json":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4.json","graph_json":"https://pith.science/api/pith-number/LPHXLUM7UWMPYLA2KXEZIU5QU4/graph.json","events_json":"https://pith.science/api/pith-number/LPHXLUM7UWMPYLA2KXEZIU5QU4/events.json","paper":"https://pith.science/paper/LPHXLUM7"},"agent_actions":{"view_html":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4","download_json":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4.json","view_paper":"https://pith.science/paper/LPHXLUM7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.01644&json=true","fetch_graph":"https://pith.science/api/pith-number/LPHXLUM7UWMPYLA2KXEZIU5QU4/graph.json","fetch_events":"https://pith.science/api/pith-number/LPHXLUM7UWMPYLA2KXEZIU5QU4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/action/storage_attestation","attest_author":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/action/author_attestation","sign_citation":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/action/citation_signature","submit_replication":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/action/replication_record"}},"created_at":"2026-07-05T07:26:13.020017+00:00","updated_at":"2026-07-05T07:26:13.020017+00:00"}