{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2UUUTCG2MUXQV2C7MMJRTUDPRB","short_pith_number":"pith:2UUUTCG2","canonical_record":{"source":{"id":"2608.09130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T05:13:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"688338a453c5510d7b7b781228dffd7166dd23cd2bf779fa5a228a86974535d3","abstract_canon_sha256":"8eb4155e3af75bad200587a4df01ddd8880b5efd9f2dda930b7b422362571ce4"},"schema_version":"1.0"},"canonical_sha256":"d5294988da652f0ae85f631319d06f886a3b0b19cb5c663797d12a32ff389ec5","source":{"kind":"arxiv","id":"2608.09130","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09130","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09130v1","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09130","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"2UUUTCG2MUXQ","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"pith_short_16","alias_value":"2UUUTCG2MUXQV2C7","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"pith_short_8","alias_value":"2UUUTCG2","created_at":"2026-08-11T02:21:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2UUUTCG2MUXQV2C7MMJRTUDPRB","target":"record","payload":{"canonical_record":{"source":{"id":"2608.09130","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T05:13:56Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"688338a453c5510d7b7b781228dffd7166dd23cd2bf779fa5a228a86974535d3","abstract_canon_sha256":"8eb4155e3af75bad200587a4df01ddd8880b5efd9f2dda930b7b422362571ce4"},"schema_version":"1.0"},"canonical_sha256":"d5294988da652f0ae85f631319d06f886a3b0b19cb5c663797d12a32ff389ec5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T02:21:52.473470Z","signature_b64":"2mS0OdOkF0aBflykCMYgHwG1YEa5grOlTZTpwB7c+AJfXeQwKNQaphf2MvUAliwUw8Y90jPERYO8/tVtKAC9AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5294988da652f0ae85f631319d06f886a3b0b19cb5c663797d12a32ff389ec5","last_reissued_at":"2026-08-11T02:21:52.471888Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T02:21:52.471888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2608.09130","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-08-11T02:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"awBIH8qwAB9fc2rlj6qVlfW+1nf6nov+SuXKX1ISzbDhQiNl/HgtF1KFKHPDaMd/t60CSbhaMD0qyWIvIJbuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:42:58.016412Z"},"content_sha256":"111fd328801acd5d399de18a857493a09b2e6102d114347766e62b8eee47d895","schema_version":"1.0","event_id":"sha256:111fd328801acd5d399de18a857493a09b2e6102d114347766e62b8eee47d895"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2UUUTCG2MUXQV2C7MMJRTUDPRB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"MARA: Flow-Matching-Guided Multi-Agent Resource Allocation for Computational Resource Efficient Learning","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Hanye Zhao, Muning Wen, Weinan Zhang, Yong Yu","submitted_at":"2026-08-10T05:13:56Z","abstract_excerpt":"Allocating limited computation among concurrent learning tasks is difficult when each task must reach a target loss before a deadline but its required training effort is unknown. Existing approaches combine online loss prediction with adaptive resource allocation, yet commonly treat computation as continuously divisible throughput. We instead study a practical setting in which tasks arrive over time and computation is provided by discrete nodes. This setting introduces both uncertain demand and constrained sequential decisions. We propose MARA, which predicts future loss trajectories with cond"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09130","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/2608.09130/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-08-11T02:21:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rz+czndADbuHORM5M27nHhoi/5BxLY9a79mHKW1euWilMBOONzsMlJTjtVI4sD8SzMB9Mt4CoGKTrA323beNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T08:42:58.016927Z"},"content_sha256":"9021e20f3b4a868b74efbc06367b41afa3fd7dfce6a60d5a272ca5b9f203bc4b","schema_version":"1.0","event_id":"sha256:9021e20f3b4a868b74efbc06367b41afa3fd7dfce6a60d5a272ca5b9f203bc4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UUUTCG2MUXQV2C7MMJRTUDPRB/bundle.json","state_url":"https://pith.science/pith/2UUUTCG2MUXQV2C7MMJRTUDPRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UUUTCG2MUXQV2C7MMJRTUDPRB/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-15T08:42:58Z","links":{"resolver":"https://pith.science/pith/2UUUTCG2MUXQV2C7MMJRTUDPRB","bundle":"https://pith.science/pith/2UUUTCG2MUXQV2C7MMJRTUDPRB/bundle.json","state":"https://pith.science/pith/2UUUTCG2MUXQV2C7MMJRTUDPRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UUUTCG2MUXQV2C7MMJRTUDPRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2UUUTCG2MUXQV2C7MMJRTUDPRB","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":"8eb4155e3af75bad200587a4df01ddd8880b5efd9f2dda930b7b422362571ce4","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T05:13:56Z","title_canon_sha256":"688338a453c5510d7b7b781228dffd7166dd23cd2bf779fa5a228a86974535d3"},"schema_version":"1.0","source":{"id":"2608.09130","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.09130","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"arxiv_version","alias_value":"2608.09130v1","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.09130","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"pith_short_12","alias_value":"2UUUTCG2MUXQ","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"pith_short_16","alias_value":"2UUUTCG2MUXQV2C7","created_at":"2026-08-11T02:21:52Z"},{"alias_kind":"pith_short_8","alias_value":"2UUUTCG2","created_at":"2026-08-11T02:21:52Z"}],"graph_snapshots":[{"event_id":"sha256:9021e20f3b4a868b74efbc06367b41afa3fd7dfce6a60d5a272ca5b9f203bc4b","target":"graph","created_at":"2026-08-11T02:21:52Z","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/2608.09130/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Allocating limited computation among concurrent learning tasks is difficult when each task must reach a target loss before a deadline but its required training effort is unknown. Existing approaches combine online loss prediction with adaptive resource allocation, yet commonly treat computation as continuously divisible throughput. We instead study a practical setting in which tasks arrive over time and computation is provided by discrete nodes. This setting introduces both uncertain demand and constrained sequential decisions. We propose MARA, which predicts future loss trajectories with cond","authors_text":"Hanye Zhao, Muning Wen, Weinan Zhang, Yong Yu","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T05:13:56Z","title":"MARA: Flow-Matching-Guided Multi-Agent Resource Allocation for Computational Resource Efficient Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.09130","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:111fd328801acd5d399de18a857493a09b2e6102d114347766e62b8eee47d895","target":"record","created_at":"2026-08-11T02:21:52Z","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":"8eb4155e3af75bad200587a4df01ddd8880b5efd9f2dda930b7b422362571ce4","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-08-10T05:13:56Z","title_canon_sha256":"688338a453c5510d7b7b781228dffd7166dd23cd2bf779fa5a228a86974535d3"},"schema_version":"1.0","source":{"id":"2608.09130","kind":"arxiv","version":1}},"canonical_sha256":"d5294988da652f0ae85f631319d06f886a3b0b19cb5c663797d12a32ff389ec5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5294988da652f0ae85f631319d06f886a3b0b19cb5c663797d12a32ff389ec5","first_computed_at":"2026-08-11T02:21:52.471888Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-11T02:21:52.471888Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2mS0OdOkF0aBflykCMYgHwG1YEa5grOlTZTpwB7c+AJfXeQwKNQaphf2MvUAliwUw8Y90jPERYO8/tVtKAC9AQ==","signature_status":"signed_v1","signed_at":"2026-08-11T02:21:52.473470Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.09130","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:111fd328801acd5d399de18a857493a09b2e6102d114347766e62b8eee47d895","sha256:9021e20f3b4a868b74efbc06367b41afa3fd7dfce6a60d5a272ca5b9f203bc4b"],"state_sha256":"79af5da31a533243816a61c720dc0f25684aaa05eaaf9004b3e348aa6aee1c49"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ok2SvfGqdb69PWUULdIFftVdOhxYoA2gO/0Sc8rg996WlMTSXTYkb669LiXSHm/+DKQcn7862nWpmAYCNwL/Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T08:42:58.020545Z","bundle_sha256":"7c15c6d6c376f18e596d082fc9d9b6485f2a76be949ada6b8968b233792eaed3"}}