{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:MMVNKELE7H3OLVAHVABXYEB4IU","short_pith_number":"pith:MMVNKELE","canonical_record":{"source":{"id":"1908.00161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-01T00:58:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b7069f2c8909ce6810239ecfcd6a1ea915e7d8df22e9c84ba22c6a779352f174","abstract_canon_sha256":"c18d97ae4f36dc33a84b12ae6ddd5eb8e45a56ea2c0f86fe2c2baf7d18ddf100"},"schema_version":"1.0"},"canonical_sha256":"632ad51164f9f6e5d407a8037c103c450cde1d43131138fab0393a8fce0140bc","source":{"kind":"arxiv","id":"1908.00161","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00161","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00161v1","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00161","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"MMVNKELE7H3O","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_16","alias_value":"MMVNKELE7H3OLVAH","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_8","alias_value":"MMVNKELE","created_at":"2026-07-04T23:50:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:MMVNKELE7H3OLVAHVABXYEB4IU","target":"record","payload":{"canonical_record":{"source":{"id":"1908.00161","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-01T00:58:13Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"b7069f2c8909ce6810239ecfcd6a1ea915e7d8df22e9c84ba22c6a779352f174","abstract_canon_sha256":"c18d97ae4f36dc33a84b12ae6ddd5eb8e45a56ea2c0f86fe2c2baf7d18ddf100"},"schema_version":"1.0"},"canonical_sha256":"632ad51164f9f6e5d407a8037c103c450cde1d43131138fab0393a8fce0140bc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:50:57.503839Z","signature_b64":"rLXs+dOFchrlm7aarXIfAPYf2avhTzVKFH99He/5KoJuNFBJUeUxGnOYLeeqKfR/B3NxW/lySkWb+8yNJj2pAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"632ad51164f9f6e5d407a8037c103c450cde1d43131138fab0393a8fce0140bc","last_reissued_at":"2026-07-04T23:50:57.503244Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:50:57.503244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.00161","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-04T23:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SUyOIN4DN8XSypC8EfbvC+tcghSsukmPYKlLBEj+S5QRjX8Y+GtIjrLEUzZaDnzphTOJN6d0MTszduVKYpBAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:45:32.462707Z"},"content_sha256":"92349246401432340d059225f1ab6e7247eb5f8cc64e57460a77c3845e7c677a","schema_version":"1.0","event_id":"sha256:92349246401432340d059225f1ab6e7247eb5f8cc64e57460a77c3845e7c677a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:MMVNKELE7H3OLVAHVABXYEB4IU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Erel Segal-Halevi, Haris Aziz, Nicholas Mattei, Xin Huang","submitted_at":"2019-08-01T00:58:13Z","abstract_excerpt":"We consider a multi-agent resource allocation setting that models the assignment of papers to reviewers. A recurring issue in allocation problems is the compatibility of welfare/efficiency and fairness. Given an oracle to find a welfare-achieving allocation, we embed such an oracle into a flexible algorithm called the Constrained Round Robin (CRR) algorithm, that achieves the required welfare level. Our algorithm also allows the system designer to lower the welfare requirements in order to achieve a higher degree of fairness. If the welfare requirement is lowered enough, a strengthening of env"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00161","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/1908.00161/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-04T23:50:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qrQfhqDxQLluxqlr83CgcFLgKMIoLgxt1f6SE+2108xx87z8mqeo/Vmx0j/gkdNN9FDRUA84YUCrDIucFCyDDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T08:45:32.463214Z"},"content_sha256":"a43d50498d6f26169de8c2ccfdac135d88439ea7f5753c1203a5f34187fdc4a3","schema_version":"1.0","event_id":"sha256:a43d50498d6f26169de8c2ccfdac135d88439ea7f5753c1203a5f34187fdc4a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MMVNKELE7H3OLVAHVABXYEB4IU/bundle.json","state_url":"https://pith.science/pith/MMVNKELE7H3OLVAHVABXYEB4IU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MMVNKELE7H3OLVAHVABXYEB4IU/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-16T08:45:32Z","links":{"resolver":"https://pith.science/pith/MMVNKELE7H3OLVAHVABXYEB4IU","bundle":"https://pith.science/pith/MMVNKELE7H3OLVAHVABXYEB4IU/bundle.json","state":"https://pith.science/pith/MMVNKELE7H3OLVAHVABXYEB4IU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MMVNKELE7H3OLVAHVABXYEB4IU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:MMVNKELE7H3OLVAHVABXYEB4IU","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":"c18d97ae4f36dc33a84b12ae6ddd5eb8e45a56ea2c0f86fe2c2baf7d18ddf100","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-01T00:58:13Z","title_canon_sha256":"b7069f2c8909ce6810239ecfcd6a1ea915e7d8df22e9c84ba22c6a779352f174"},"schema_version":"1.0","source":{"id":"1908.00161","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.00161","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"arxiv_version","alias_value":"1908.00161v1","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.00161","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_12","alias_value":"MMVNKELE7H3O","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_16","alias_value":"MMVNKELE7H3OLVAH","created_at":"2026-07-04T23:50:57Z"},{"alias_kind":"pith_short_8","alias_value":"MMVNKELE","created_at":"2026-07-04T23:50:57Z"}],"graph_snapshots":[{"event_id":"sha256:a43d50498d6f26169de8c2ccfdac135d88439ea7f5753c1203a5f34187fdc4a3","target":"graph","created_at":"2026-07-04T23:50:57Z","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/1908.00161/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider a multi-agent resource allocation setting that models the assignment of papers to reviewers. A recurring issue in allocation problems is the compatibility of welfare/efficiency and fairness. Given an oracle to find a welfare-achieving allocation, we embed such an oracle into a flexible algorithm called the Constrained Round Robin (CRR) algorithm, that achieves the required welfare level. Our algorithm also allows the system designer to lower the welfare requirements in order to achieve a higher degree of fairness. If the welfare requirement is lowered enough, a strengthening of env","authors_text":"Erel Segal-Halevi, Haris Aziz, Nicholas Mattei, Xin Huang","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-01T00:58:13Z","title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.00161","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:92349246401432340d059225f1ab6e7247eb5f8cc64e57460a77c3845e7c677a","target":"record","created_at":"2026-07-04T23:50:57Z","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":"c18d97ae4f36dc33a84b12ae6ddd5eb8e45a56ea2c0f86fe2c2baf7d18ddf100","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-08-01T00:58:13Z","title_canon_sha256":"b7069f2c8909ce6810239ecfcd6a1ea915e7d8df22e9c84ba22c6a779352f174"},"schema_version":"1.0","source":{"id":"1908.00161","kind":"arxiv","version":1}},"canonical_sha256":"632ad51164f9f6e5d407a8037c103c450cde1d43131138fab0393a8fce0140bc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"632ad51164f9f6e5d407a8037c103c450cde1d43131138fab0393a8fce0140bc","first_computed_at":"2026-07-04T23:50:57.503244Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:50:57.503244Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rLXs+dOFchrlm7aarXIfAPYf2avhTzVKFH99He/5KoJuNFBJUeUxGnOYLeeqKfR/B3NxW/lySkWb+8yNJj2pAQ==","signature_status":"signed_v1","signed_at":"2026-07-04T23:50:57.503839Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.00161","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:92349246401432340d059225f1ab6e7247eb5f8cc64e57460a77c3845e7c677a","sha256:a43d50498d6f26169de8c2ccfdac135d88439ea7f5753c1203a5f34187fdc4a3"],"state_sha256":"db06090d6c3f83e3c3d52b80d098dd346614aa352f911c70e3b66d3e89d12e38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"51SRBxyPfOhfIzsL2YQQFPP0ovgP7D2NW4duDVAMmsYtN8Uvl4icab+E0H6QIuw9OU74XBTvZ8JjturJS5qACA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T08:45:32.466604Z","bundle_sha256":"6fedc04e686768aafc445a566fe5c7f1b8f3c97b3cbe333ed7faf8586bd411a2"}}