{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:XISZIXHFCOC3KDG7HUJ2JD2QAW","short_pith_number":"pith:XISZIXHF","canonical_record":{"source":{"id":"2506.05613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-05T21:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"0324edbdfc18ab44c44b2bcf7ba41ded009d8e1a20a913cf94d3b9e8e2786dcb","abstract_canon_sha256":"6d2180cd98a78bbfa64eb8c5a5be90979ae683f2cb7198ed1d78f1851a013f26"},"schema_version":"1.0"},"canonical_sha256":"ba25945ce51385b50cdf3d13a48f5005b7c3802fcb9b7a7a95f13616a0e936da","source":{"kind":"arxiv","id":"2506.05613","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05613","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05613v1","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05613","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"XISZIXHFCOC3","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"pith_short_16","alias_value":"XISZIXHFCOC3KDG7","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"pith_short_8","alias_value":"XISZIXHF","created_at":"2026-07-05T11:17:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:XISZIXHFCOC3KDG7HUJ2JD2QAW","target":"record","payload":{"canonical_record":{"source":{"id":"2506.05613","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-05T21:55:07Z","cross_cats_sorted":[],"title_canon_sha256":"0324edbdfc18ab44c44b2bcf7ba41ded009d8e1a20a913cf94d3b9e8e2786dcb","abstract_canon_sha256":"6d2180cd98a78bbfa64eb8c5a5be90979ae683f2cb7198ed1d78f1851a013f26"},"schema_version":"1.0"},"canonical_sha256":"ba25945ce51385b50cdf3d13a48f5005b7c3802fcb9b7a7a95f13616a0e936da","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:17:06.888766Z","signature_b64":"x2LW2vkQJxpjaJfhY4wnyi9nYP5Xpgz+Ijgk5fVa0G+eNuN/9Xknpo64MKT/UuDFfQ+3WdkgPb9m3u3cIYl0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba25945ce51385b50cdf3d13a48f5005b7c3802fcb9b7a7a95f13616a0e936da","last_reissued_at":"2026-07-05T11:17:06.888143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:17:06.888143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2506.05613","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-05T11:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ut/RmvtND60xQU+EOo6553I97wMLCM0SKYpGptLdUe8iTc6WVhoGwNJeZMjzOlJ3eiug98tuzvNk3bUhDneTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:49:17.345011Z"},"content_sha256":"90f603a0129396769773b4dd2bea5d93636a42423790eceb43631b892037ee4e","schema_version":"1.0","event_id":"sha256:90f603a0129396769773b4dd2bea5d93636a42423790eceb43631b892037ee4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:XISZIXHFCOC3KDG7HUJ2JD2QAW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Masoud Seddighin, Saeed Seddighin","submitted_at":"2025-06-05T21:55:07Z","abstract_excerpt":"We study the problem of fair allocation of indivisible goods for subadditive agents. While constant-\\textsf{MMS} bounds have been given for additive and fractionally subadditive agents, the best existential bound for the case of subadditive agents is $1/O(\\log n \\log \\log n)$. In this work, we improve this bound to a $1/O((\\log \\log n)^2)$-\\textsf{MMS} guarantee. To this end, we introduce new matching techniques and rounding methods for subadditive valuations that we believe are of independent interest and will find their applications in future work."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05613","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/2506.05613/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-05T11:17:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Iy9aZud3eL6YHTjWkhkmVZEpoI3hDIB9+W/AYvkW2KoeoXYfeKo5elAu77sgOj6rpOWib7FowoEq0hf7RO85DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:49:17.345396Z"},"content_sha256":"7a69b6b66ec35d7f0a4a6bd3ae2df5136e8fcd1bd684e9b4477c4600d3de9807","schema_version":"1.0","event_id":"sha256:7a69b6b66ec35d7f0a4a6bd3ae2df5136e8fcd1bd684e9b4477c4600d3de9807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XISZIXHFCOC3KDG7HUJ2JD2QAW/bundle.json","state_url":"https://pith.science/pith/XISZIXHFCOC3KDG7HUJ2JD2QAW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XISZIXHFCOC3KDG7HUJ2JD2QAW/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-07T23:49:17Z","links":{"resolver":"https://pith.science/pith/XISZIXHFCOC3KDG7HUJ2JD2QAW","bundle":"https://pith.science/pith/XISZIXHFCOC3KDG7HUJ2JD2QAW/bundle.json","state":"https://pith.science/pith/XISZIXHFCOC3KDG7HUJ2JD2QAW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XISZIXHFCOC3KDG7HUJ2JD2QAW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XISZIXHFCOC3KDG7HUJ2JD2QAW","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":"6d2180cd98a78bbfa64eb8c5a5be90979ae683f2cb7198ed1d78f1851a013f26","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-05T21:55:07Z","title_canon_sha256":"0324edbdfc18ab44c44b2bcf7ba41ded009d8e1a20a913cf94d3b9e8e2786dcb"},"schema_version":"1.0","source":{"id":"2506.05613","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.05613","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"arxiv_version","alias_value":"2506.05613v1","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.05613","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"pith_short_12","alias_value":"XISZIXHFCOC3","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"pith_short_16","alias_value":"XISZIXHFCOC3KDG7","created_at":"2026-07-05T11:17:06Z"},{"alias_kind":"pith_short_8","alias_value":"XISZIXHF","created_at":"2026-07-05T11:17:06Z"}],"graph_snapshots":[{"event_id":"sha256:7a69b6b66ec35d7f0a4a6bd3ae2df5136e8fcd1bd684e9b4477c4600d3de9807","target":"graph","created_at":"2026-07-05T11:17:06Z","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/2506.05613/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of fair allocation of indivisible goods for subadditive agents. While constant-\\textsf{MMS} bounds have been given for additive and fractionally subadditive agents, the best existential bound for the case of subadditive agents is $1/O(\\log n \\log \\log n)$. In this work, we improve this bound to a $1/O((\\log \\log n)^2)$-\\textsf{MMS} guarantee. To this end, we introduce new matching techniques and rounding methods for subadditive valuations that we believe are of independent interest and will find their applications in future work.","authors_text":"Masoud Seddighin, Saeed Seddighin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-05T21:55:07Z","title":"Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.05613","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:90f603a0129396769773b4dd2bea5d93636a42423790eceb43631b892037ee4e","target":"record","created_at":"2026-07-05T11:17:06Z","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":"6d2180cd98a78bbfa64eb8c5a5be90979ae683f2cb7198ed1d78f1851a013f26","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-06-05T21:55:07Z","title_canon_sha256":"0324edbdfc18ab44c44b2bcf7ba41ded009d8e1a20a913cf94d3b9e8e2786dcb"},"schema_version":"1.0","source":{"id":"2506.05613","kind":"arxiv","version":1}},"canonical_sha256":"ba25945ce51385b50cdf3d13a48f5005b7c3802fcb9b7a7a95f13616a0e936da","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba25945ce51385b50cdf3d13a48f5005b7c3802fcb9b7a7a95f13616a0e936da","first_computed_at":"2026-07-05T11:17:06.888143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:17:06.888143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x2LW2vkQJxpjaJfhY4wnyi9nYP5Xpgz+Ijgk5fVa0G+eNuN/9Xknpo64MKT/UuDFfQ+3WdkgPb9m3u3cIYl0Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T11:17:06.888766Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.05613","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:90f603a0129396769773b4dd2bea5d93636a42423790eceb43631b892037ee4e","sha256:7a69b6b66ec35d7f0a4a6bd3ae2df5136e8fcd1bd684e9b4477c4600d3de9807"],"state_sha256":"c401bcc7e17e9c6fd1d5b390c434f1c01df346fb8ed3cb457780a4f79e25c957"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ag2VLVNvLcL/RegcsIABe/5IZtasv8tQv7cSwbWcfYGFb3JvxQPt8dM8Irc1uBV9Z4ZYeGcYiGzeG0o1DzJmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T23:49:17.348214Z","bundle_sha256":"49d8de879a2019534bc32bc7d2fb678947c3d42339ad5eafc8796a3b4a1df6f3"}}