{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LPHXLUM7UWMPYLA2KXEZIU5QU4","short_pith_number":"pith:LPHXLUM7","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"},"canonical_sha256":"5bcf75d19fa598fc2c1a55c99453b0a7181c792283125508fa1bedbca35f0d90","source":{"kind":"arxiv","id":"2304.01644","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.01644","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"2304.01644v2","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01644","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"LPHXLUM7UWMP","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"LPHXLUM7UWMPYLA2","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"LPHXLUM7","created_at":"2026-07-05T07:26:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LPHXLUM7UWMPYLA2KXEZIU5QU4","target":"record","payload":{"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"},"canonical_sha256":"5bcf75d19fa598fc2c1a55c99453b0a7181c792283125508fa1bedbca35f0d90","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"},"source_kind":"arxiv","source_id":"2304.01644","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8WxkRm7MV0DNW9KcDsCyj13Q7DQeFtpS0ikQgAGn5aYKrg3RCHdGGGNd4uUNEo44rK3uMz5oqH65EuNF3DlCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:43:04.651845Z"},"content_sha256":"04dfc7328a57d352cd3005f450ffef3933a743903762a829940cad53a4de3f16","schema_version":"1.0","event_id":"sha256:04dfc7328a57d352cd3005f450ffef3933a743903762a829940cad53a4de3f16"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LPHXLUM7UWMPYLA2KXEZIU5QU4","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:26:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yOZ7pQUQGwsgkE+KUFk1xFhfa+ApQ6Q1vAYyTuy8z+C0CDlYbSy7ftsHcBaKeW5SiqB0aPeB348+p8n+oxxVAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T08:43:04.652338Z"},"content_sha256":"71b67e869e78c37949faa2c1370adc54ab2e98fd3e9f342f6398d67e7813628a","schema_version":"1.0","event_id":"sha256:71b67e869e78c37949faa2c1370adc54ab2e98fd3e9f342f6398d67e7813628a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/bundle.json","state_url":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T08:43:04Z","links":{"resolver":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4","bundle":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/bundle.json","state":"https://pith.science/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPHXLUM7UWMPYLA2KXEZIU5QU4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LPHXLUM7UWMPYLA2KXEZIU5QU4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6ae3924a828eca020c37a2414a086466c41443ec23cd0c1c1956d0a8e120267f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-04-04T09:00:58Z","title_canon_sha256":"f417b43eb763ed68c3671568312fcd792570bf15fe3a09165ccb1c324294e027"},"schema_version":"1.0","source":{"id":"2304.01644","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.01644","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"arxiv_version","alias_value":"2304.01644v2","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.01644","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"pith_short_12","alias_value":"LPHXLUM7UWMP","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"LPHXLUM7UWMPYLA2","created_at":"2026-07-05T07:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"LPHXLUM7","created_at":"2026-07-05T07:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:71b67e869e78c37949faa2c1370adc54ab2e98fd3e9f342f6398d67e7813628a","target":"graph","created_at":"2026-07-05T07:26:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2304.01644/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Arianna Novaro, Ayumi Igarashi, Martin Lackner, Oliviero Nardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-04-04T09:00:58Z","title":"Repeated Fair Allocation of Indivisible Items"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.01644","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:04dfc7328a57d352cd3005f450ffef3933a743903762a829940cad53a4de3f16","target":"record","created_at":"2026-07-05T07:26:13Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6ae3924a828eca020c37a2414a086466c41443ec23cd0c1c1956d0a8e120267f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2023-04-04T09:00:58Z","title_canon_sha256":"f417b43eb763ed68c3671568312fcd792570bf15fe3a09165ccb1c324294e027"},"schema_version":"1.0","source":{"id":"2304.01644","kind":"arxiv","version":2}},"canonical_sha256":"5bcf75d19fa598fc2c1a55c99453b0a7181c792283125508fa1bedbca35f0d90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bcf75d19fa598fc2c1a55c99453b0a7181c792283125508fa1bedbca35f0d90","first_computed_at":"2026-07-05T07:26:13.019957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:26:13.019957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gOswBwd2MwR9f8ifMZ1R2uS1MMGk4hVnbxAKUU6yy/Ztb87o9SQAWzuwl0LDcnPJXFn8AgMw5+G4z1I17ZudAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:26:13.020560Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.01644","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:04dfc7328a57d352cd3005f450ffef3933a743903762a829940cad53a4de3f16","sha256:71b67e869e78c37949faa2c1370adc54ab2e98fd3e9f342f6398d67e7813628a"],"state_sha256":"7050fc936779cce79977f83600e0d0383133010bf449e2407d8b76cce8c1f9b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3O9ZPMiwzAkXmCmH4yvk2zXNU8kU2/IKWgYkg4MQdRhi0Cnv2TN8djJNag5ZLUHquGKb91YCptHsBGGG88VfAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T08:43:04.655556Z","bundle_sha256":"0af304dcbcd8004a5772ed0a039a43023d3b40bc8d5886cb09df2861ebef5a1c"}}