{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QTGHODXFIJFYWPA2YKRKSQLYY2","short_pith_number":"pith:QTGHODXF","schema_version":"1.0","canonical_sha256":"84cc770ee5424b8b3c1ac2a2a94178c6857f67d780ef2772c2840811c667f251","source":{"kind":"arxiv","id":"2606.01309","version":1},"attestation_state":"computed","paper":{"title":"Multiagent Matroid Upgrading: Greedy is Fair and Efficient","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Changfeng Xu, Chao Peng, Chenyang Xu, Qingwen Ma, Ruilong Zhang","submitted_at":"2026-05-31T15:57:38Z","abstract_excerpt":"This paper introduces a general multiagent matroid upgrading problem that models a broad class of real-world resource allocation tasks. In this setting, there are multiple agents and a ground set of elements, where each element is assigned to a specific agent and has two associated costs: a default cost and a reduced (upgraded) cost. Upgrading an element lowers its cost to the upgraded value, while non-upgraded elements retain their default costs. Each agent is associated with its own matroid, with the goal of finding a minimum-cost basis. The central task is to select at most k elements to up"},"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.01309","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-05-31T15:57:38Z","cross_cats_sorted":[],"title_canon_sha256":"49aab0bbe950c35fbfaa918810f05c0d5fb0b29e91df44b63dcca94ade0f3812","abstract_canon_sha256":"b0c260e71100018a298348a68d481beefaf0ed1b9fe472b564aa978e5558c406"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:29.735055Z","signature_b64":"ODxnzG2BETFx+4PhD59h2SdobNBSqJSLtLqkKGOZNfa1XCrtvH0Puky5p4ZjVBhPgYayi3n2P3GrC3JAP8toBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84cc770ee5424b8b3c1ac2a2a94178c6857f67d780ef2772c2840811c667f251","last_reissued_at":"2026-06-02T02:04:29.734663Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:29.734663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiagent Matroid Upgrading: Greedy is Fair and Efficient","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Changfeng Xu, Chao Peng, Chenyang Xu, Qingwen Ma, Ruilong Zhang","submitted_at":"2026-05-31T15:57:38Z","abstract_excerpt":"This paper introduces a general multiagent matroid upgrading problem that models a broad class of real-world resource allocation tasks. In this setting, there are multiple agents and a ground set of elements, where each element is assigned to a specific agent and has two associated costs: a default cost and a reduced (upgraded) cost. Upgrading an element lowers its cost to the upgraded value, while non-upgraded elements retain their default costs. Each agent is associated with its own matroid, with the goal of finding a minimum-cost basis. The central task is to select at most k elements to up"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01309","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.01309/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.01309","created_at":"2026-06-02T02:04:29.734726+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01309v1","created_at":"2026-06-02T02:04:29.734726+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01309","created_at":"2026-06-02T02:04:29.734726+00:00"},{"alias_kind":"pith_short_12","alias_value":"QTGHODXFIJFY","created_at":"2026-06-02T02:04:29.734726+00:00"},{"alias_kind":"pith_short_16","alias_value":"QTGHODXFIJFYWPA2","created_at":"2026-06-02T02:04:29.734726+00:00"},{"alias_kind":"pith_short_8","alias_value":"QTGHODXF","created_at":"2026-06-02T02:04:29.734726+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/QTGHODXFIJFYWPA2YKRKSQLYY2","json":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2.json","graph_json":"https://pith.science/api/pith-number/QTGHODXFIJFYWPA2YKRKSQLYY2/graph.json","events_json":"https://pith.science/api/pith-number/QTGHODXFIJFYWPA2YKRKSQLYY2/events.json","paper":"https://pith.science/paper/QTGHODXF"},"agent_actions":{"view_html":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2","download_json":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2.json","view_paper":"https://pith.science/paper/QTGHODXF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01309&json=true","fetch_graph":"https://pith.science/api/pith-number/QTGHODXFIJFYWPA2YKRKSQLYY2/graph.json","fetch_events":"https://pith.science/api/pith-number/QTGHODXFIJFYWPA2YKRKSQLYY2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2/action/storage_attestation","attest_author":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2/action/author_attestation","sign_citation":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2/action/citation_signature","submit_replication":"https://pith.science/pith/QTGHODXFIJFYWPA2YKRKSQLYY2/action/replication_record"}},"created_at":"2026-06-02T02:04:29.734726+00:00","updated_at":"2026-06-02T02:04:29.734726+00:00"}