{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:L532TBW2RPM53GQ7FYD7Q6O2J7","short_pith_number":"pith:L532TBW2","schema_version":"1.0","canonical_sha256":"5f77a986da8bd9dd9a1f2e07f879da4fc3e081927d68a4b51ed88ec1f63615d5","source":{"kind":"arxiv","id":"2508.12453","version":1},"attestation_state":"computed","paper":{"title":"Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Alexander S{\\o}ltoft, Anders Bo Ipsen, Ioannis Caragiannis, Martin Jupakkal Andersen","submitted_at":"2025-08-17T17:59:40Z","abstract_excerpt":"Although approximate notions of envy-freeness-such as envy-freeness up to one good (EF1)-have been extensively studied for indivisible goods, the seemingly simpler fairness concept of proportionality up to one good (PROP1) has received far less attention. For additive valuations, every EF1 allocation is PROP1, and well-known algorithms such as Round-Robin and Envy-Cycle Elimination compute such allocations in polynomial time. PROP1 is also compatible with Pareto efficiency, as maximum Nash welfare allocations are EF1 and hence PROP1.\n  We ask whether these favorable properties extend to non-ad"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2508.12453","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2025-08-17T17:59:40Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c6d62d316ea8e7a05552128f36a3f1e615a263d277a67043964a1f554c0b2c53","abstract_canon_sha256":"0fc7e1f31ddb3a81fb3c72fd4248aad66b0e910e0543af012de400c1bae26e75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:55:05.919942Z","signature_b64":"VDlOtilH3D/EbtWr5ph94ToYZ8TC0dDuOJBzN0BCfMC6vqRUxVIYj6dur5mh74pQQVYSTT1Uj6s0FnnZEpwoCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5f77a986da8bd9dd9a1f2e07f879da4fc3e081927d68a4b51ed88ec1f63615d5","last_reissued_at":"2026-07-05T11:55:05.919494Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:55:05.919494Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Alexander S{\\o}ltoft, Anders Bo Ipsen, Ioannis Caragiannis, Martin Jupakkal Andersen","submitted_at":"2025-08-17T17:59:40Z","abstract_excerpt":"Although approximate notions of envy-freeness-such as envy-freeness up to one good (EF1)-have been extensively studied for indivisible goods, the seemingly simpler fairness concept of proportionality up to one good (PROP1) has received far less attention. For additive valuations, every EF1 allocation is PROP1, and well-known algorithms such as Round-Robin and Envy-Cycle Elimination compute such allocations in polynomial time. PROP1 is also compatible with Pareto efficiency, as maximum Nash welfare allocations are EF1 and hence PROP1.\n  We ask whether these favorable properties extend to non-ad"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12453","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/2508.12453/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2508.12453","created_at":"2026-07-05T11:55:05.919553+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12453v1","created_at":"2026-07-05T11:55:05.919553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12453","created_at":"2026-07-05T11:55:05.919553+00:00"},{"alias_kind":"pith_short_12","alias_value":"L532TBW2RPM5","created_at":"2026-07-05T11:55:05.919553+00:00"},{"alias_kind":"pith_short_16","alias_value":"L532TBW2RPM53GQ7","created_at":"2026-07-05T11:55:05.919553+00:00"},{"alias_kind":"pith_short_8","alias_value":"L532TBW2","created_at":"2026-07-05T11:55:05.919553+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7","json":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7.json","graph_json":"https://pith.science/api/pith-number/L532TBW2RPM53GQ7FYD7Q6O2J7/graph.json","events_json":"https://pith.science/api/pith-number/L532TBW2RPM53GQ7FYD7Q6O2J7/events.json","paper":"https://pith.science/paper/L532TBW2"},"agent_actions":{"view_html":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7","download_json":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7.json","view_paper":"https://pith.science/paper/L532TBW2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12453&json=true","fetch_graph":"https://pith.science/api/pith-number/L532TBW2RPM53GQ7FYD7Q6O2J7/graph.json","fetch_events":"https://pith.science/api/pith-number/L532TBW2RPM53GQ7FYD7Q6O2J7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7/action/storage_attestation","attest_author":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7/action/author_attestation","sign_citation":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7/action/citation_signature","submit_replication":"https://pith.science/pith/L532TBW2RPM53GQ7FYD7Q6O2J7/action/replication_record"}},"created_at":"2026-07-05T11:55:05.919553+00:00","updated_at":"2026-07-05T11:55:05.919553+00:00"}