{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:I5FLY575YBA5VVUAUVJ7N5OM67","short_pith_number":"pith:I5FLY575","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"},"canonical_sha256":"474abc77fdc041dad680a553f6f5ccf7edcee15a771196232b3f531d6d021ff0","source":{"kind":"arxiv","id":"2606.08328","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08328","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08328v1","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08328","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"I5FLY575YBA5","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"pith_short_16","alias_value":"I5FLY575YBA5VVUA","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"pith_short_8","alias_value":"I5FLY575","created_at":"2026-06-09T01:05:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:I5FLY575YBA5VVUAUVJ7N5OM67","target":"record","payload":{"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"},"canonical_sha256":"474abc77fdc041dad680a553f6f5ccf7edcee15a771196232b3f531d6d021ff0","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"},"source_kind":"arxiv","source_id":"2606.08328","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-06-09T01:05:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JsQdo78V0TPZHGzotNvKkPYWr7eRSz4zLPkprcilBpH3r3glr6DWpxf+XZaIua3jb1ZhEVtTaThYFvx5U7EmDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T15:26:40.895014Z"},"content_sha256":"590a3578fad70057d6581706c9d03a4ff798ab58caf0a59ceae9b3aabb52c5fc","schema_version":"1.0","event_id":"sha256:590a3578fad70057d6581706c9d03a4ff798ab58caf0a59ceae9b3aabb52c5fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:I5FLY575YBA5VVUAUVJ7N5OM67","target":"graph","payload":{"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"},"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-06-09T01:05:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E7Oj93AO2O35dZW8SUx7UKCPp6jjHb1Qr/yT60jlS18uIEV3fYJKw+CCrMB8ajydneoRzckW8M59wXKKG5AsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T15:26:40.895401Z"},"content_sha256":"802807a9030740bf315889aa4fcf0298db02db2f56097eb94e3eeccc908ed968","schema_version":"1.0","event_id":"sha256:802807a9030740bf315889aa4fcf0298db02db2f56097eb94e3eeccc908ed968"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/bundle.json","state_url":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I5FLY575YBA5VVUAUVJ7N5OM67/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-07-02T15:26:40Z","links":{"resolver":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67","bundle":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/bundle.json","state":"https://pith.science/pith/I5FLY575YBA5VVUAUVJ7N5OM67/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I5FLY575YBA5VVUAUVJ7N5OM67/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:I5FLY575YBA5VVUAUVJ7N5OM67","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":"80f1d5b1f0f2a9de8204ed1f379fd7df5b8960f9ad50a6f7bd03633efe1c6d16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-06T20:38:47Z","title_canon_sha256":"573cfbe8d5809ba1384dcf4e5dc9c44043873c579f54e0b090b56cc2cf081026"},"schema_version":"1.0","source":{"id":"2606.08328","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.08328","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"arxiv_version","alias_value":"2606.08328v1","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.08328","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"pith_short_12","alias_value":"I5FLY575YBA5","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"pith_short_16","alias_value":"I5FLY575YBA5VVUA","created_at":"2026-06-09T01:05:33Z"},{"alias_kind":"pith_short_8","alias_value":"I5FLY575","created_at":"2026-06-09T01:05:33Z"}],"graph_snapshots":[{"event_id":"sha256:802807a9030740bf315889aa4fcf0298db02db2f56097eb94e3eeccc908ed968","target":"graph","created_at":"2026-06-09T01:05:33Z","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/2606.08328/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Ramiro N. Deo-Campo Vuong","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-06T20:38:47Z","title":"Optimal Online Equitable Allocation with Indivisible Resources"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.08328","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:590a3578fad70057d6581706c9d03a4ff798ab58caf0a59ceae9b3aabb52c5fc","target":"record","created_at":"2026-06-09T01:05:33Z","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":"80f1d5b1f0f2a9de8204ed1f379fd7df5b8960f9ad50a6f7bd03633efe1c6d16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-06T20:38:47Z","title_canon_sha256":"573cfbe8d5809ba1384dcf4e5dc9c44043873c579f54e0b090b56cc2cf081026"},"schema_version":"1.0","source":{"id":"2606.08328","kind":"arxiv","version":1}},"canonical_sha256":"474abc77fdc041dad680a553f6f5ccf7edcee15a771196232b3f531d6d021ff0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"474abc77fdc041dad680a553f6f5ccf7edcee15a771196232b3f531d6d021ff0","first_computed_at":"2026-06-09T01:05:33.698400Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:05:33.698400Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"omYaAl8QHx03YNDDEUtoYT5WA/ex2soWGwUkktEfc19+JG3o0/8zoAnSnNGcmIAG13kKPxpINX/+N1oNWiRlBg==","signature_status":"signed_v1","signed_at":"2026-06-09T01:05:33.698929Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.08328","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:590a3578fad70057d6581706c9d03a4ff798ab58caf0a59ceae9b3aabb52c5fc","sha256:802807a9030740bf315889aa4fcf0298db02db2f56097eb94e3eeccc908ed968"],"state_sha256":"3ea21653af4008297d4e17e9170bbc968e3546e9e0d686d63b4636772de8169a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SqZRLIIGn0mCYr3BZGEGB8gdewfLalWnQZ0i/YC9q/cqY/2kprEw8YZRutq0W673Svc8RAqbb7PNA+4kUfhUBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T15:26:40.897409Z","bundle_sha256":"224b6ea74662c85b39cd1c93757976e85ddfde516ae5e10b951b58762c1087bf"}}