{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:CGUHWY5F4TQAYNJFGB4FGMBWHL","short_pith_number":"pith:CGUHWY5F","schema_version":"1.0","canonical_sha256":"11a87b63a5e4e00c352530785330363ac975f6ba9a045cda43d5dcdd8edf336e","source":{"kind":"arxiv","id":"1710.00950","version":1},"attestation_state":"computed","paper":{"title":"Optimal Matroid Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanna Sumita, Kazuhisa Makino, Kei Kimura, Yasushi Kawase","submitted_at":"2017-10-03T01:00:19Z","abstract_excerpt":"This paper studies optimal matroid partitioning problems for various objective functions. In the problem, we are given a finite set $E$ and $k$ weighted matroids $(E, \\mathcal{I}_i, w_i)$, $i = 1, \\dots, k$, and our task is to find a minimum partition $(I_1,\\dots,I_k)$ of $E$ such that $I_i \\in \\mathcal{I}_i$ for all $i$. For each objective function, we give a polynomial-time algorithm or prove NP-hardness. In particular, for the case when the given weighted matroids are identical and the objective function is the sum of the maximum weight in each set (i.e., $\\sum_{i=1}^k\\max_{e\\in I_i}w_i(e)$"},"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":"1710.00950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-03T01:00:19Z","cross_cats_sorted":[],"title_canon_sha256":"f066a57f3391b69158ff154873f30ee6f1cbab1e222fb011493457236c606d93","abstract_canon_sha256":"64ea5cb3a9674444410286750a91f56ee7064dbaa0771884c1a53a72b6484550"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:47.389060Z","signature_b64":"v+AT7YO+6xIhTMJW2t9Ry4bR1/ghgWEadjtddPwlGLdcA1FugoiE2P9bbmh/wEDCJX8/c4jvAEeywN2YExRPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11a87b63a5e4e00c352530785330363ac975f6ba9a045cda43d5dcdd8edf336e","last_reissued_at":"2026-05-18T00:33:47.388431Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:47.388431Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Matroid Partitioning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hanna Sumita, Kazuhisa Makino, Kei Kimura, Yasushi Kawase","submitted_at":"2017-10-03T01:00:19Z","abstract_excerpt":"This paper studies optimal matroid partitioning problems for various objective functions. In the problem, we are given a finite set $E$ and $k$ weighted matroids $(E, \\mathcal{I}_i, w_i)$, $i = 1, \\dots, k$, and our task is to find a minimum partition $(I_1,\\dots,I_k)$ of $E$ such that $I_i \\in \\mathcal{I}_i$ for all $i$. For each objective function, we give a polynomial-time algorithm or prove NP-hardness. In particular, for the case when the given weighted matroids are identical and the objective function is the sum of the maximum weight in each set (i.e., $\\sum_{i=1}^k\\max_{e\\in I_i}w_i(e)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00950","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":""},"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":"1710.00950","created_at":"2026-05-18T00:33:47.388532+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00950v1","created_at":"2026-05-18T00:33:47.388532+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00950","created_at":"2026-05-18T00:33:47.388532+00:00"},{"alias_kind":"pith_short_12","alias_value":"CGUHWY5F4TQA","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"CGUHWY5F4TQAYNJF","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"CGUHWY5F","created_at":"2026-05-18T12:31:10.602751+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/CGUHWY5F4TQAYNJFGB4FGMBWHL","json":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL.json","graph_json":"https://pith.science/api/pith-number/CGUHWY5F4TQAYNJFGB4FGMBWHL/graph.json","events_json":"https://pith.science/api/pith-number/CGUHWY5F4TQAYNJFGB4FGMBWHL/events.json","paper":"https://pith.science/paper/CGUHWY5F"},"agent_actions":{"view_html":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL","download_json":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL.json","view_paper":"https://pith.science/paper/CGUHWY5F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00950&json=true","fetch_graph":"https://pith.science/api/pith-number/CGUHWY5F4TQAYNJFGB4FGMBWHL/graph.json","fetch_events":"https://pith.science/api/pith-number/CGUHWY5F4TQAYNJFGB4FGMBWHL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL/action/storage_attestation","attest_author":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL/action/author_attestation","sign_citation":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL/action/citation_signature","submit_replication":"https://pith.science/pith/CGUHWY5F4TQAYNJFGB4FGMBWHL/action/replication_record"}},"created_at":"2026-05-18T00:33:47.388532+00:00","updated_at":"2026-05-18T00:33:47.388532+00:00"}