{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:NSJXRVXXK3D7LRJZS3K2V3BUXC","short_pith_number":"pith:NSJXRVXX","canonical_record":{"source":{"id":"2502.02815","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-05T01:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"a5fab8f4a6c6ba5c4ddd6e0ba8d5dac41bc4ce1f26169218ee08168696ebad54","abstract_canon_sha256":"42c650637c88dd8176010cbad55fa7f882f2107b439ea0544ccb2fc0ca2147ea"},"schema_version":"1.0"},"canonical_sha256":"6c9378d6f756c7f5c53996d5aaec34b8ba894e12344cb34cfd6e6440060e6bb3","source":{"kind":"arxiv","id":"2502.02815","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02815","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02815v3","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02815","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"NSJXRVXXK3D7","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"pith_short_16","alias_value":"NSJXRVXXK3D7LRJZ","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"pith_short_8","alias_value":"NSJXRVXX","created_at":"2026-07-09T01:19:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:NSJXRVXXK3D7LRJZS3K2V3BUXC","target":"record","payload":{"canonical_record":{"source":{"id":"2502.02815","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-05T01:21:44Z","cross_cats_sorted":[],"title_canon_sha256":"a5fab8f4a6c6ba5c4ddd6e0ba8d5dac41bc4ce1f26169218ee08168696ebad54","abstract_canon_sha256":"42c650637c88dd8176010cbad55fa7f882f2107b439ea0544ccb2fc0ca2147ea"},"schema_version":"1.0"},"canonical_sha256":"6c9378d6f756c7f5c53996d5aaec34b8ba894e12344cb34cfd6e6440060e6bb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-09T01:19:35.078810Z","signature_b64":"NLfSiw9BhFmlfkDZpzC3xcGqI0pzS2FGD5l9TEUHnzsCfjrRGc+xaq67zsF2W++lnvoqcmcMYmnOoos42M0XCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c9378d6f756c7f5c53996d5aaec34b8ba894e12344cb34cfd6e6440060e6bb3","last_reissued_at":"2026-07-09T01:19:35.078268Z","signature_status":"signed_v1","first_computed_at":"2026-07-09T01:19:35.078268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.02815","source_version":3,"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-09T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x2Ay6fdJTP1ASE5p9ZKl1R7vB53aN2gujUfSRoypxjq1zgC1+v6xkvWnJXV9IiDCmw1V8tvcoRJXhmRY4N/HAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:01:04.994338Z"},"content_sha256":"23f8e6fce3cdbccb9208129755fef88d2cf22cf3d359fe988c44873bac1d2821","schema_version":"1.0","event_id":"sha256:23f8e6fce3cdbccb9208129755fef88d2cf22cf3d359fe988c44873bac1d2821"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:NSJXRVXXK3D7LRJZS3K2V3BUXC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exploring Relations among Fairness Notions in Discrete Fair Division","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eklavya Sharma, Jugal Garg","submitted_at":"2025-02-05T01:21:44Z","abstract_excerpt":"Fair allocation of indivisible items among agents is a fundamental and extensively studied problem. However, fairness does not have a single universally accepted definition, leading to many competing fairness notions. Some of these notions are considered stronger or more desirable, but they are also more difficult to guarantee. In this work, we examine 22 different fairness notions and organize them into a hierarchy. Formally, we say that a notion $F_1$ implies another notion $F_2$ if every $F_1$-fair allocation is also $F_2$-fair. We give a near-complete picture of implications among fairness"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02815","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/2502.02815/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-09T01:19:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sDGy7R132WdDRolZ5N3Y4ys99c/nOHQIUdELwqbHPl3A4UKMm8H6HpgK7wm01OtwhmwCBwRc6iUoWiq7bzzSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T00:01:04.995239Z"},"content_sha256":"aa28147715592df1d9fcc03baf53f7eecc17594eb273e2ec4cbced8f4f810423","schema_version":"1.0","event_id":"sha256:aa28147715592df1d9fcc03baf53f7eecc17594eb273e2ec4cbced8f4f810423"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSJXRVXXK3D7LRJZS3K2V3BUXC/bundle.json","state_url":"https://pith.science/pith/NSJXRVXXK3D7LRJZS3K2V3BUXC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSJXRVXXK3D7LRJZS3K2V3BUXC/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-10T00:01:05Z","links":{"resolver":"https://pith.science/pith/NSJXRVXXK3D7LRJZS3K2V3BUXC","bundle":"https://pith.science/pith/NSJXRVXXK3D7LRJZS3K2V3BUXC/bundle.json","state":"https://pith.science/pith/NSJXRVXXK3D7LRJZS3K2V3BUXC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSJXRVXXK3D7LRJZS3K2V3BUXC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:NSJXRVXXK3D7LRJZS3K2V3BUXC","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":"42c650637c88dd8176010cbad55fa7f882f2107b439ea0544ccb2fc0ca2147ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-05T01:21:44Z","title_canon_sha256":"a5fab8f4a6c6ba5c4ddd6e0ba8d5dac41bc4ce1f26169218ee08168696ebad54"},"schema_version":"1.0","source":{"id":"2502.02815","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.02815","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"arxiv_version","alias_value":"2502.02815v3","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02815","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"pith_short_12","alias_value":"NSJXRVXXK3D7","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"pith_short_16","alias_value":"NSJXRVXXK3D7LRJZ","created_at":"2026-07-09T01:19:35Z"},{"alias_kind":"pith_short_8","alias_value":"NSJXRVXX","created_at":"2026-07-09T01:19:35Z"}],"graph_snapshots":[{"event_id":"sha256:aa28147715592df1d9fcc03baf53f7eecc17594eb273e2ec4cbced8f4f810423","target":"graph","created_at":"2026-07-09T01:19:35Z","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/2502.02815/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Fair allocation of indivisible items among agents is a fundamental and extensively studied problem. However, fairness does not have a single universally accepted definition, leading to many competing fairness notions. Some of these notions are considered stronger or more desirable, but they are also more difficult to guarantee. In this work, we examine 22 different fairness notions and organize them into a hierarchy. Formally, we say that a notion $F_1$ implies another notion $F_2$ if every $F_1$-fair allocation is also $F_2$-fair. We give a near-complete picture of implications among fairness","authors_text":"Eklavya Sharma, Jugal Garg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-05T01:21:44Z","title":"Exploring Relations among Fairness Notions in Discrete Fair Division"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02815","kind":"arxiv","version":3},"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:23f8e6fce3cdbccb9208129755fef88d2cf22cf3d359fe988c44873bac1d2821","target":"record","created_at":"2026-07-09T01:19:35Z","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":"42c650637c88dd8176010cbad55fa7f882f2107b439ea0544ccb2fc0ca2147ea","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-02-05T01:21:44Z","title_canon_sha256":"a5fab8f4a6c6ba5c4ddd6e0ba8d5dac41bc4ce1f26169218ee08168696ebad54"},"schema_version":"1.0","source":{"id":"2502.02815","kind":"arxiv","version":3}},"canonical_sha256":"6c9378d6f756c7f5c53996d5aaec34b8ba894e12344cb34cfd6e6440060e6bb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c9378d6f756c7f5c53996d5aaec34b8ba894e12344cb34cfd6e6440060e6bb3","first_computed_at":"2026-07-09T01:19:35.078268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-09T01:19:35.078268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NLfSiw9BhFmlfkDZpzC3xcGqI0pzS2FGD5l9TEUHnzsCfjrRGc+xaq67zsF2W++lnvoqcmcMYmnOoos42M0XCA==","signature_status":"signed_v1","signed_at":"2026-07-09T01:19:35.078810Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.02815","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23f8e6fce3cdbccb9208129755fef88d2cf22cf3d359fe988c44873bac1d2821","sha256:aa28147715592df1d9fcc03baf53f7eecc17594eb273e2ec4cbced8f4f810423"],"state_sha256":"7f9385418407b46184b081bae595fee4bf2a5fa6fc0aec9ff784cb9cff438f83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6zhH9WXAK9N67JtlVqaa5ap5Sx9CsFdFeXXj4LjSNWIzfNIRdxIeLoi+gN21iRvrvILNZJ7HSLhVLjOWhN8+Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T00:01:05.006172Z","bundle_sha256":"ecd4622977a4bc852566d0f9f88204bdc8b5d83292f2a2e637190a701f25bb8a"}}