{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RJSZNGHRICBBQVZF43I75ONVFZ","short_pith_number":"pith:RJSZNGHR","canonical_record":{"source":{"id":"2606.31457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-30T10:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"1e24cd29911df3b19f0cd57308f7c3da6f40831555d04692be302594cc235c20","abstract_canon_sha256":"553f9d4f75c255db00fac12be6f43644c0b1593317f98a92e7d0f473c803f23c"},"schema_version":"1.0"},"canonical_sha256":"8a659698f14082185725e6d1feb9b52e6bc6f037007307664de930f2600e434a","source":{"kind":"arxiv","id":"2606.31457","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31457","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31457v1","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31457","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"RJSZNGHRICBB","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"RJSZNGHRICBBQVZF","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"RJSZNGHR","created_at":"2026-07-01T01:18:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RJSZNGHRICBBQVZF43I75ONVFZ","target":"record","payload":{"canonical_record":{"source":{"id":"2606.31457","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-30T10:34:40Z","cross_cats_sorted":[],"title_canon_sha256":"1e24cd29911df3b19f0cd57308f7c3da6f40831555d04692be302594cc235c20","abstract_canon_sha256":"553f9d4f75c255db00fac12be6f43644c0b1593317f98a92e7d0f473c803f23c"},"schema_version":"1.0"},"canonical_sha256":"8a659698f14082185725e6d1feb9b52e6bc6f037007307664de930f2600e434a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-01T01:18:03.926476Z","signature_b64":"xDWbM6s/k6qpV48S42guVx6/GHUA0tbFedpglGUZ4oHm6K6b7FwlU/ZvI/FTjlFEbeKx8u3qC3NlG5Ih+n8ZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a659698f14082185725e6d1feb9b52e6bc6f037007307664de930f2600e434a","last_reissued_at":"2026-07-01T01:18:03.925960Z","signature_status":"signed_v1","first_computed_at":"2026-07-01T01:18:03.925960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.31457","source_version":1,"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-01T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eESQyz53X2RRnMg5azeaPYXF/96x3q0nUgq97NF3MQ7+XKQmP/0jVC4n9HsVmO/TWce3dEcZVoA+3xK6LbZ5Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:43:04.927292Z"},"content_sha256":"eb0de63a46e179c31e25316df26199b220e1bc76f3741d7ea454b185361f1c82","schema_version":"1.0","event_id":"sha256:eb0de63a46e179c31e25316df26199b220e1bc76f3741d7ea454b185361f1c82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RJSZNGHRICBBQVZF43I75ONVFZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Fair Allocation of Indivisible Items from Limited Feedback","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"David Kempe, Evi Micha, Xinyu Liu","submitted_at":"2026-06-30T10:34:40Z","abstract_excerpt":"We study a setting in which an algorithm must output a fair allocation of indivisible items while \"learning on the job\". More specifically, the algorithm is to output an allocation satisfying EF1, PROP1, or similar fairness notions; however, the algorithm initially has no information about the agents' valuations, and can only learn about them by (repeatedly) proposing an allocation, and obtaining feedback about a fairness violation in the allocation. Importantly, the observed fairness violation may be adversarially chosen. The algorithm's goal is to converge to a fair allocation in rounds poly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31457","kind":"arxiv","version":1},"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/2606.31457/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-01T01:18:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jo5vlWyqksRNyVSN/hbILwg+VoQ+Q+GjKwXWNUpr5bN5SIYGXr7Dl4iLNJn9aPJipRLztQLa3vABcBdAuJJ+BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T15:43:04.927928Z"},"content_sha256":"5338b0ad1744b3ef9dc216bb76ca5fa36df51a60f3febaec636de78d1967c6c0","schema_version":"1.0","event_id":"sha256:5338b0ad1744b3ef9dc216bb76ca5fa36df51a60f3febaec636de78d1967c6c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/bundle.json","state_url":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RJSZNGHRICBBQVZF43I75ONVFZ/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-07-05T15:43:04Z","links":{"resolver":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ","bundle":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/bundle.json","state":"https://pith.science/pith/RJSZNGHRICBBQVZF43I75ONVFZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RJSZNGHRICBBQVZF43I75ONVFZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RJSZNGHRICBBQVZF43I75ONVFZ","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":"553f9d4f75c255db00fac12be6f43644c0b1593317f98a92e7d0f473c803f23c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-30T10:34:40Z","title_canon_sha256":"1e24cd29911df3b19f0cd57308f7c3da6f40831555d04692be302594cc235c20"},"schema_version":"1.0","source":{"id":"2606.31457","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.31457","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.31457v1","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.31457","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"pith_short_12","alias_value":"RJSZNGHRICBB","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"pith_short_16","alias_value":"RJSZNGHRICBBQVZF","created_at":"2026-07-01T01:18:03Z"},{"alias_kind":"pith_short_8","alias_value":"RJSZNGHR","created_at":"2026-07-01T01:18:03Z"}],"graph_snapshots":[{"event_id":"sha256:5338b0ad1744b3ef9dc216bb76ca5fa36df51a60f3febaec636de78d1967c6c0","target":"graph","created_at":"2026-07-01T01:18:03Z","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/2606.31457/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study a setting in which an algorithm must output a fair allocation of indivisible items while \"learning on the job\". More specifically, the algorithm is to output an allocation satisfying EF1, PROP1, or similar fairness notions; however, the algorithm initially has no information about the agents' valuations, and can only learn about them by (repeatedly) proposing an allocation, and obtaining feedback about a fairness violation in the allocation. Importantly, the observed fairness violation may be adversarially chosen. The algorithm's goal is to converge to a fair allocation in rounds poly","authors_text":"David Kempe, Evi Micha, Xinyu Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-30T10:34:40Z","title":"Learning Fair Allocation of Indivisible Items from Limited Feedback"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.31457","kind":"arxiv","version":1},"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:eb0de63a46e179c31e25316df26199b220e1bc76f3741d7ea454b185361f1c82","target":"record","created_at":"2026-07-01T01:18:03Z","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":"553f9d4f75c255db00fac12be6f43644c0b1593317f98a92e7d0f473c803f23c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-30T10:34:40Z","title_canon_sha256":"1e24cd29911df3b19f0cd57308f7c3da6f40831555d04692be302594cc235c20"},"schema_version":"1.0","source":{"id":"2606.31457","kind":"arxiv","version":1}},"canonical_sha256":"8a659698f14082185725e6d1feb9b52e6bc6f037007307664de930f2600e434a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8a659698f14082185725e6d1feb9b52e6bc6f037007307664de930f2600e434a","first_computed_at":"2026-07-01T01:18:03.925960Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-01T01:18:03.925960Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xDWbM6s/k6qpV48S42guVx6/GHUA0tbFedpglGUZ4oHm6K6b7FwlU/ZvI/FTjlFEbeKx8u3qC3NlG5Ih+n8ZAA==","signature_status":"signed_v1","signed_at":"2026-07-01T01:18:03.926476Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.31457","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb0de63a46e179c31e25316df26199b220e1bc76f3741d7ea454b185361f1c82","sha256:5338b0ad1744b3ef9dc216bb76ca5fa36df51a60f3febaec636de78d1967c6c0"],"state_sha256":"5d17ec7eae000483466091e413cdfb3cb6c25ea005096d4460b82ebb4ce294a0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEWWZUIWbM1brpYfcM30+z62uE0b6O3pjAz5ujLl3Gan4TZt+vp1TrgX4aYlfcAUPEqUsjIJBs2Un7EsenSSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T15:43:04.930765Z","bundle_sha256":"26c7f82463b68191f805ad37481651f8f27fa2884296d3a025db3398340ee552"}}