{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CNJIATC4P7ONUCJCMTK6IUJMKV","short_pith_number":"pith:CNJIATC4","canonical_record":{"source":{"id":"2307.07304","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-07-14T12:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"1789f6b7506382eb913b2c24f2595618510dc477cfc40fa3126133aa5ece6150","abstract_canon_sha256":"d4190a426b43e8e77de4520a5d213e0561592e88299ba264c98b25d4b9ecfc1e"},"schema_version":"1.0"},"canonical_sha256":"1352804c5c7fdcda092264d5e4512c557d36f6b5c8e543ba091d725a10daa2a4","source":{"kind":"arxiv","id":"2307.07304","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07304","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07304v2","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07304","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"pith_short_12","alias_value":"CNJIATC4P7ON","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"pith_short_16","alias_value":"CNJIATC4P7ONUCJC","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"pith_short_8","alias_value":"CNJIATC4","created_at":"2026-07-05T06:33:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CNJIATC4P7ONUCJCMTK6IUJMKV","target":"record","payload":{"canonical_record":{"source":{"id":"2307.07304","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-07-14T12:29:31Z","cross_cats_sorted":[],"title_canon_sha256":"1789f6b7506382eb913b2c24f2595618510dc477cfc40fa3126133aa5ece6150","abstract_canon_sha256":"d4190a426b43e8e77de4520a5d213e0561592e88299ba264c98b25d4b9ecfc1e"},"schema_version":"1.0"},"canonical_sha256":"1352804c5c7fdcda092264d5e4512c557d36f6b5c8e543ba091d725a10daa2a4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:33:47.337123Z","signature_b64":"RxR8EEcjs/+DQ3nERo3RozKtI+TRgr4nLXn9j1eGlyEhCbIuE/DYWRqLBJ292gcZX5EcwROaXD/M4CFLVWziDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1352804c5c7fdcda092264d5e4512c557d36f6b5c8e543ba091d725a10daa2a4","last_reissued_at":"2026-07-05T06:33:47.336398Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:33:47.336398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2307.07304","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-05T06:33:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LWjZr92yRCkfVGb+RLJJAImivMfxkUUkPI/Cm+uoByEx/4Yoqfz8OeaFKPvKkbSLIpPRCnPYXbCExWJnq9DTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:34:45.319368Z"},"content_sha256":"b67f09f2eba4a14c39d6440647f0f24ae68b9e14b256012b9a2c64afe6ecb024","schema_version":"1.0","event_id":"sha256:b67f09f2eba4a14c39d6440647f0f24ae68b9e14b256012b9a2c64afe6ecb024"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CNJIATC4P7ONUCJCMTK6IUJMKV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Breaking the $3/4$ Barrier for Approximate Maximin Share","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Hannaneh Akrami, Jugal Garg","submitted_at":"2023-07-14T12:29:31Z","abstract_excerpt":"We study the fundamental problem of fairly allocating a set of indivisible goods among $n$ agents with additive valuations using the desirable fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an agent finds an allocation fair to her if she receives goods worth at least her MMS value. An allocation is called MMS if all agents receive at least their MMS value. Since MMS allocations need not exist when $n>2$, a series of works showed the existence of approximate MMS allocations with the current best factor of $\\frac34 + O(\\frac{1}{n})$. However, a simpl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07304","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/2307.07304/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-05T06:33:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qqTwMuj6W/Po1OiYsnyys1HJG5q8p8qgzcJosFdOxGBiJS0lsrDNc+9yKJMXsergVqF6YX53IJZBzLnj+ccECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T21:34:45.319848Z"},"content_sha256":"d845d3ec785298184f95e686bf6ef26efcff2b2d0d8d3d7550be4d54573be560","schema_version":"1.0","event_id":"sha256:d845d3ec785298184f95e686bf6ef26efcff2b2d0d8d3d7550be4d54573be560"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNJIATC4P7ONUCJCMTK6IUJMKV/bundle.json","state_url":"https://pith.science/pith/CNJIATC4P7ONUCJCMTK6IUJMKV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNJIATC4P7ONUCJCMTK6IUJMKV/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-08T21:34:45Z","links":{"resolver":"https://pith.science/pith/CNJIATC4P7ONUCJCMTK6IUJMKV","bundle":"https://pith.science/pith/CNJIATC4P7ONUCJCMTK6IUJMKV/bundle.json","state":"https://pith.science/pith/CNJIATC4P7ONUCJCMTK6IUJMKV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNJIATC4P7ONUCJCMTK6IUJMKV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CNJIATC4P7ONUCJCMTK6IUJMKV","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":"d4190a426b43e8e77de4520a5d213e0561592e88299ba264c98b25d4b9ecfc1e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-07-14T12:29:31Z","title_canon_sha256":"1789f6b7506382eb913b2c24f2595618510dc477cfc40fa3126133aa5ece6150"},"schema_version":"1.0","source":{"id":"2307.07304","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2307.07304","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"arxiv_version","alias_value":"2307.07304v2","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.07304","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"pith_short_12","alias_value":"CNJIATC4P7ON","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"pith_short_16","alias_value":"CNJIATC4P7ONUCJC","created_at":"2026-07-05T06:33:47Z"},{"alias_kind":"pith_short_8","alias_value":"CNJIATC4","created_at":"2026-07-05T06:33:47Z"}],"graph_snapshots":[{"event_id":"sha256:d845d3ec785298184f95e686bf6ef26efcff2b2d0d8d3d7550be4d54573be560","target":"graph","created_at":"2026-07-05T06:33:47Z","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/2307.07304/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the fundamental problem of fairly allocating a set of indivisible goods among $n$ agents with additive valuations using the desirable fairness notion of maximin share (MMS). MMS is the most popular share-based notion, in which an agent finds an allocation fair to her if she receives goods worth at least her MMS value. An allocation is called MMS if all agents receive at least their MMS value. Since MMS allocations need not exist when $n>2$, a series of works showed the existence of approximate MMS allocations with the current best factor of $\\frac34 + O(\\frac{1}{n})$. However, a simpl","authors_text":"Hannaneh Akrami, Jugal Garg","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-07-14T12:29:31Z","title":"Breaking the $3/4$ Barrier for Approximate Maximin Share"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.07304","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:b67f09f2eba4a14c39d6440647f0f24ae68b9e14b256012b9a2c64afe6ecb024","target":"record","created_at":"2026-07-05T06:33:47Z","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":"d4190a426b43e8e77de4520a5d213e0561592e88299ba264c98b25d4b9ecfc1e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2023-07-14T12:29:31Z","title_canon_sha256":"1789f6b7506382eb913b2c24f2595618510dc477cfc40fa3126133aa5ece6150"},"schema_version":"1.0","source":{"id":"2307.07304","kind":"arxiv","version":2}},"canonical_sha256":"1352804c5c7fdcda092264d5e4512c557d36f6b5c8e543ba091d725a10daa2a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1352804c5c7fdcda092264d5e4512c557d36f6b5c8e543ba091d725a10daa2a4","first_computed_at":"2026-07-05T06:33:47.336398Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:33:47.336398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RxR8EEcjs/+DQ3nERo3RozKtI+TRgr4nLXn9j1eGlyEhCbIuE/DYWRqLBJ292gcZX5EcwROaXD/M4CFLVWziDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:33:47.337123Z","signed_message":"canonical_sha256_bytes"},"source_id":"2307.07304","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b67f09f2eba4a14c39d6440647f0f24ae68b9e14b256012b9a2c64afe6ecb024","sha256:d845d3ec785298184f95e686bf6ef26efcff2b2d0d8d3d7550be4d54573be560"],"state_sha256":"75bb182e126e432a229d3c97772368f3deb4a76920d702e7b22fd6df6c451b80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"klO7aPov8kiwJalfidKBlVb3htxFutqj3QFAFyrnU/2nON+KtX+N29ULX9FEtvaIUJm7tsuTMeZFo6vMlYnqBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T21:34:45.323356Z","bundle_sha256":"4b769454964ba3e77695cd43d2b666d5d8ef75f4624af578a19919c3a937a645"}}