{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2VTXLNSVCLWW3URWNN6SSX5KBB","short_pith_number":"pith:2VTXLNSV","canonical_record":{"source":{"id":"2606.10472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-09T06:41:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65c7a7d28a7c99ef81ac4cabc926056dfc00df37daa3bc41038e79a0199027ae","abstract_canon_sha256":"bc961377b0623d9330a14aeefb02df39a2d2df0501dd1e5c839e41e9df32643c"},"schema_version":"1.0"},"canonical_sha256":"d56775b65512ed6dd2366b7d295faa084fd45cfd1a3477f7e8f8c5de1e14f241","source":{"kind":"arxiv","id":"2606.10472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10472","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10472v1","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10472","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"2VTXLNSVCLWW","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"2VTXLNSVCLWW3URW","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"2VTXLNSV","created_at":"2026-06-10T01:10:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2VTXLNSVCLWW3URWNN6SSX5KBB","target":"record","payload":{"canonical_record":{"source":{"id":"2606.10472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-09T06:41:04Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"65c7a7d28a7c99ef81ac4cabc926056dfc00df37daa3bc41038e79a0199027ae","abstract_canon_sha256":"bc961377b0623d9330a14aeefb02df39a2d2df0501dd1e5c839e41e9df32643c"},"schema_version":"1.0"},"canonical_sha256":"d56775b65512ed6dd2366b7d295faa084fd45cfd1a3477f7e8f8c5de1e14f241","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:10:20.945480Z","signature_b64":"xIqeuM0WBRbhDTszFTqUnO1P14CVxKeheujvPW3BEQzYvd0BYrYrwCF+EoPqWwhwtP5cW2D8f91BIuBIudo0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d56775b65512ed6dd2366b7d295faa084fd45cfd1a3477f7e8f8c5de1e14f241","last_reissued_at":"2026-06-10T01:10:20.944583Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:10:20.944583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.10472","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-10T01:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2QTmk96KlOqf7K7cYvaQRWLcqHYRboa1aFGrBfXldVgC+eSt24SYBSscHZaHiDE6BDDnkNMPRfU4DzjndcFgCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:53:45.914676Z"},"content_sha256":"b7267a8c509a65110449f6c30503da7da2bead188778af0615dd66326ba6563d","schema_version":"1.0","event_id":"sha256:b7267a8c509a65110449f6c30503da7da2bead188778af0615dd66326ba6563d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2VTXLNSVCLWW3URWNN6SSX5KBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Trading Utility for Dynamic Fairness in Multiple Resource Division with Sequential Demand","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.GT","authors_text":"Kaiqi Jiang, Karim El Husseini, Wenzhe Fan, Xinhua Zhang","submitted_at":"2026-06-09T06:41:04Z","abstract_excerpt":"Dynamic multi-resource allocation is a central problem in shared computing environments, where users' demands arrive sequentially and resources must be distributed fairly without knowledge of future demands. Existing methods emphasize fairness guarantees such as Sharing Incentive, Envy Freeness, and Dynamic Pareto Optimality, but often overlook system utility. Moreover, these fairness criteria are mutually incompatible, preventing strict enforcement of them at the same time.\n  We propose a neural allocation mechanism that reconciles fairness with utility through multi-objective optimization du"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10472","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.10472/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-10T01:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NwwzVnUw03UUCuYQSRBKTm42EgQglXYzL2I6eXqfTrJm4QdP5hEDsbXywcj1oF70oSjXXv+JCxOKQhNgpTYmCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T19:53:45.915052Z"},"content_sha256":"adb641108d4e733b5b9d99377023abeea70929d4c17429e8ceb8cf8ce18e5e46","schema_version":"1.0","event_id":"sha256:adb641108d4e733b5b9d99377023abeea70929d4c17429e8ceb8cf8ce18e5e46"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2VTXLNSVCLWW3URWNN6SSX5KBB/bundle.json","state_url":"https://pith.science/pith/2VTXLNSVCLWW3URWNN6SSX5KBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2VTXLNSVCLWW3URWNN6SSX5KBB/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-06-28T19:53:45Z","links":{"resolver":"https://pith.science/pith/2VTXLNSVCLWW3URWNN6SSX5KBB","bundle":"https://pith.science/pith/2VTXLNSVCLWW3URWNN6SSX5KBB/bundle.json","state":"https://pith.science/pith/2VTXLNSVCLWW3URWNN6SSX5KBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2VTXLNSVCLWW3URWNN6SSX5KBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2VTXLNSVCLWW3URWNN6SSX5KBB","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":"bc961377b0623d9330a14aeefb02df39a2d2df0501dd1e5c839e41e9df32643c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-09T06:41:04Z","title_canon_sha256":"65c7a7d28a7c99ef81ac4cabc926056dfc00df37daa3bc41038e79a0199027ae"},"schema_version":"1.0","source":{"id":"2606.10472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.10472","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.10472v1","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.10472","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"2VTXLNSVCLWW","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"2VTXLNSVCLWW3URW","created_at":"2026-06-10T01:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"2VTXLNSV","created_at":"2026-06-10T01:10:20Z"}],"graph_snapshots":[{"event_id":"sha256:adb641108d4e733b5b9d99377023abeea70929d4c17429e8ceb8cf8ce18e5e46","target":"graph","created_at":"2026-06-10T01:10:20Z","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.10472/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic multi-resource allocation is a central problem in shared computing environments, where users' demands arrive sequentially and resources must be distributed fairly without knowledge of future demands. Existing methods emphasize fairness guarantees such as Sharing Incentive, Envy Freeness, and Dynamic Pareto Optimality, but often overlook system utility. Moreover, these fairness criteria are mutually incompatible, preventing strict enforcement of them at the same time.\n  We propose a neural allocation mechanism that reconciles fairness with utility through multi-objective optimization du","authors_text":"Kaiqi Jiang, Karim El Husseini, Wenzhe Fan, Xinhua Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-09T06:41:04Z","title":"Trading Utility for Dynamic Fairness in Multiple Resource Division with Sequential Demand"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.10472","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:b7267a8c509a65110449f6c30503da7da2bead188778af0615dd66326ba6563d","target":"record","created_at":"2026-06-10T01:10:20Z","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":"bc961377b0623d9330a14aeefb02df39a2d2df0501dd1e5c839e41e9df32643c","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2026-06-09T06:41:04Z","title_canon_sha256":"65c7a7d28a7c99ef81ac4cabc926056dfc00df37daa3bc41038e79a0199027ae"},"schema_version":"1.0","source":{"id":"2606.10472","kind":"arxiv","version":1}},"canonical_sha256":"d56775b65512ed6dd2366b7d295faa084fd45cfd1a3477f7e8f8c5de1e14f241","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d56775b65512ed6dd2366b7d295faa084fd45cfd1a3477f7e8f8c5de1e14f241","first_computed_at":"2026-06-10T01:10:20.944583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-10T01:10:20.944583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xIqeuM0WBRbhDTszFTqUnO1P14CVxKeheujvPW3BEQzYvd0BYrYrwCF+EoPqWwhwtP5cW2D8f91BIuBIudo0CA==","signature_status":"signed_v1","signed_at":"2026-06-10T01:10:20.945480Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.10472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7267a8c509a65110449f6c30503da7da2bead188778af0615dd66326ba6563d","sha256:adb641108d4e733b5b9d99377023abeea70929d4c17429e8ceb8cf8ce18e5e46"],"state_sha256":"ddbc2cee446a642a843bd6b42826f7d57f95e0b16ff2cee21b6a32170185452e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8NTcAtY/SLNBuc4M/BpIf+nXwAikTbpjYnu9hMeYNbCDDOgjud3CYd4W7oKx5qNZ0zfZh8Vb9o2ZWF9T7Fs5Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T19:53:45.917049Z","bundle_sha256":"922b524fd103cb2ce207576c9e52d8f13c778576751fbc71b9cbb6663524a6c4"}}