{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NOZ5PRK4ZAQEY2XKIWTTEDIYB7","short_pith_number":"pith:NOZ5PRK4","schema_version":"1.0","canonical_sha256":"6bb3d7c55cc8204c6aea45a7320d180fefbbbc9753f976463b7e4fbd8cd67d7a","source":{"kind":"arxiv","id":"2602.21687","version":3},"attestation_state":"computed","paper":{"title":"Perpetually Fair Assignments Via Balanced Sequences of Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Erel Segal-Halevi, Terrence Adams","submitted_at":"2026-02-25T08:40:06Z","abstract_excerpt":"There is a set of $n$ indivisible items (goods or chores), and a set of $n$ players. Each day, a single item should be assigned to each player. Assignments based on latin squares guarantee fairness after every $n$ days; our goal is to ensure fairness after every single day. We present two 'balance' conditions on latin squares. Informally, a latin square is balanced if its top rows and leftmost columns contain all $n$ labels; this ensures that all $n$ players receive one of the top items in one of the early days. One such condition can always be satisfied, but is arguably too weak; a second con"},"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":"2602.21687","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-02-25T08:40:06Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"f378ef8be1bf7831dd4c83c74a575c074d10cf1455d9062e8394b903c35b9028","abstract_canon_sha256":"0945ec790bfdde998fef0b77abf3e5b49764c5e4c6fcd74827ac8e6c497c3253"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-23T01:24:23.836456Z","signature_b64":"k5DEa03yORhctH2gpBuq0MEN6JrJMFBwu7OY6sUBSzztH+GIoDF2kYocPQQ+WnucG5JUhBMeymFzMFOQ5HrqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bb3d7c55cc8204c6aea45a7320d180fefbbbc9753f976463b7e4fbd8cd67d7a","last_reissued_at":"2026-07-23T01:24:23.835522Z","signature_status":"signed_v1","first_computed_at":"2026-07-23T01:24:23.835522Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perpetually Fair Assignments Via Balanced Sequences of Permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.CO","authors_text":"Erel Segal-Halevi, Terrence Adams","submitted_at":"2026-02-25T08:40:06Z","abstract_excerpt":"There is a set of $n$ indivisible items (goods or chores), and a set of $n$ players. Each day, a single item should be assigned to each player. Assignments based on latin squares guarantee fairness after every $n$ days; our goal is to ensure fairness after every single day. We present two 'balance' conditions on latin squares. Informally, a latin square is balanced if its top rows and leftmost columns contain all $n$ labels; this ensures that all $n$ players receive one of the top items in one of the early days. One such condition can always be satisfied, but is arguably too weak; a second con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.21687","kind":"arxiv","version":3},"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/2602.21687/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":"2602.21687","created_at":"2026-07-23T01:24:23.835960+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.21687v3","created_at":"2026-07-23T01:24:23.835960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.21687","created_at":"2026-07-23T01:24:23.835960+00:00"},{"alias_kind":"pith_short_12","alias_value":"NOZ5PRK4ZAQE","created_at":"2026-07-23T01:24:23.835960+00:00"},{"alias_kind":"pith_short_16","alias_value":"NOZ5PRK4ZAQEY2XK","created_at":"2026-07-23T01:24:23.835960+00:00"},{"alias_kind":"pith_short_8","alias_value":"NOZ5PRK4","created_at":"2026-07-23T01:24:23.835960+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/NOZ5PRK4ZAQEY2XKIWTTEDIYB7","json":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7.json","graph_json":"https://pith.science/api/pith-number/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/graph.json","events_json":"https://pith.science/api/pith-number/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/events.json","paper":"https://pith.science/paper/NOZ5PRK4"},"agent_actions":{"view_html":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7","download_json":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7.json","view_paper":"https://pith.science/paper/NOZ5PRK4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.21687&json=true","fetch_graph":"https://pith.science/api/pith-number/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/graph.json","fetch_events":"https://pith.science/api/pith-number/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/action/storage_attestation","attest_author":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/action/author_attestation","sign_citation":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/action/citation_signature","submit_replication":"https://pith.science/pith/NOZ5PRK4ZAQEY2XKIWTTEDIYB7/action/replication_record"}},"created_at":"2026-07-23T01:24:23.835960+00:00","updated_at":"2026-07-23T01:24:23.835960+00:00"}