{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:I5FLY575YBA5VVUAUVJ7N5OM67","short_pith_number":"pith:I5FLY575","schema_version":"1.0","canonical_sha256":"474abc77fdc041dad680a553f6f5ccf7edcee15a771196232b3f531d6d021ff0","source":{"kind":"arxiv","id":"2606.08328","version":1},"attestation_state":"computed","paper":{"title":"Optimal Online Equitable Allocation with Indivisible Resources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ramiro N. Deo-Campo Vuong","submitted_at":"2026-06-06T20:38:47Z","abstract_excerpt":"Equitable allocation of indivisible goods to agents in online settings is an algorithmic primitive with applications for load balancing, network routing, online marketplaces, and multi-agent systems. We consider a general setting in which allocations are constrained to be bases of discrete polymatroids that arrive online.\n  Our work demonstrates that a simple, myopic algorithm called Brick-Laying, which greedily minimizes the sum of squared loads on agents, achieves a universal and objective-free notion of optimality called majorization minimax-optimality [BDK26] for this setting. As a consequ"},"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":"2606.08328","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-06T20:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"573cfbe8d5809ba1384dcf4e5dc9c44043873c579f54e0b090b56cc2cf081026","abstract_canon_sha256":"80f1d5b1f0f2a9de8204ed1f379fd7df5b8960f9ad50a6f7bd03633efe1c6d16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:05:33.698929Z","signature_b64":"omYaAl8QHx03YNDDEUtoYT5WA/ex2soWGwUkktEfc19+JG3o0/8zoAnSnNGcmIAG13kKPxpINX/+N1oNWiRlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"474abc77fdc041dad680a553f6f5ccf7edcee15a771196232b3f531d6d021ff0","last_reissued_at":"2026-06-09T01:05:33.698400Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:05:33.698400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Online Equitable Allocation with Indivisible Resources","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ramiro N. Deo-Campo Vuong","submitted_at":"2026-06-06T20:38:47Z","abstract_excerpt":"Equitable allocation of indivisible goods to agents in online settings is an algorithmic primitive with applications for load balancing, network routing, online marketplaces, and multi-agent systems. We consider a general setting in which allocations are constrained to be bases of discrete polymatroids that arrive online.\n  Our work demonstrates that a simple, myopic algorithm called Brick-Laying, which greedily minimizes the sum of squared loads on agents, achieves a universal and objective-free notion of optimality called majorization minimax-optimality [BDK26] for this setting. As a consequ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08328","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/2606.08328/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":"2606.08328","created_at":"2026-06-09T01:05:33.698475+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.08328v1","created_at":"2026-06-09T01:05:33.698475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08328","created_at":"2026-06-09T01:05:33.698475+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5FLY575YBA5","created_at":"2026-06-09T01:05:33.698475+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5FLY575YBA5VVUA","created_at":"2026-06-09T01:05:33.698475+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5FLY575","created_at":"2026-06-09T01:05:33.698475+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/I5FLY575YBA5VVUAUVJ7N5OM67","json":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67.json","graph_json":"https://pith.science/api/pith-number/I5FLY575YBA5VVUAUVJ7N5OM67/graph.json","events_json":"https://pith.science/api/pith-number/I5FLY575YBA5VVUAUVJ7N5OM67/events.json","paper":"https://pith.science/paper/I5FLY575"},"agent_actions":{"view_html":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67","download_json":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67.json","view_paper":"https://pith.science/paper/I5FLY575","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.08328&json=true","fetch_graph":"https://pith.science/api/pith-number/I5FLY575YBA5VVUAUVJ7N5OM67/graph.json","fetch_events":"https://pith.science/api/pith-number/I5FLY575YBA5VVUAUVJ7N5OM67/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/action/storage_attestation","attest_author":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/action/author_attestation","sign_citation":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/action/citation_signature","submit_replication":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/action/replication_record"}},"created_at":"2026-06-09T01:05:33.698475+00:00","updated_at":"2026-06-09T01:05:33.698475+00:00"}