{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:YYJYGHNJXZLOF6LWUPELHPJKG4","short_pith_number":"pith:YYJYGHNJ","schema_version":"1.0","canonical_sha256":"c613831da9be56e2f976a3c8b3bd2a372598a1d3c64207b82edb79f3061b075a","source":{"kind":"arxiv","id":"1710.07584","version":2},"attestation_state":"computed","paper":{"title":"The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Christian Komusiewicz, Guillaume Fertin, Julien Fradin","submitted_at":"2017-10-20T15:55:58Z","abstract_excerpt":"Let G=(V,A) be a vertex-colored arc-weighted directed acyclic graph (DAG) rooted in some vertex r, and let H be its color hierarchy graph, defined as follows: V(H) is the color set C of G, and an arc from color c to color c' exists in H if there is an arc in G from a vertex of color c to a vertex of color c'. In this paper, we study the MAXIMUM COLORFUL ARBORESCENCE problem (or MCA), which takes as input a DAG G with the additional constraint that H is also a DAG, and aims at finding in G an arborescence rooted in r, of maximum weight, and in which no color appears more than once. The MCA prob"},"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.07584","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T15:55:58Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"170ee84a1dfd2c393f561b677ff039e834f6345e07fb30d6332afe443682492d","abstract_canon_sha256":"5688fef1ba489b845fdad73c3cbb2af97c18fc402c5073e398daca6963772660"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:20.633125Z","signature_b64":"hQsQfCG9Y4VSKRpuxHrY+qQyFJgEZkxUg4OMkMT1jDxC2izgJY26Y4x9Rf/5O7e8rhbTxnEJ0Q6JxxuJLiGBBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c613831da9be56e2f976a3c8b3bd2a372598a1d3c64207b82edb79f3061b075a","last_reissued_at":"2026-05-18T00:22:20.632580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:20.632580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.CC","authors_text":"Christian Komusiewicz, Guillaume Fertin, Julien Fradin","submitted_at":"2017-10-20T15:55:58Z","abstract_excerpt":"Let G=(V,A) be a vertex-colored arc-weighted directed acyclic graph (DAG) rooted in some vertex r, and let H be its color hierarchy graph, defined as follows: V(H) is the color set C of G, and an arc from color c to color c' exists in H if there is an arc in G from a vertex of color c to a vertex of color c'. In this paper, we study the MAXIMUM COLORFUL ARBORESCENCE problem (or MCA), which takes as input a DAG G with the additional constraint that H is also a DAG, and aims at finding in G an arborescence rooted in r, of maximum weight, and in which no color appears more than once. The MCA prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07584","kind":"arxiv","version":2},"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.07584","created_at":"2026-05-18T00:22:20.632647+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07584v2","created_at":"2026-05-18T00:22:20.632647+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07584","created_at":"2026-05-18T00:22:20.632647+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYJYGHNJXZLO","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYJYGHNJXZLOF6LW","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYJYGHNJ","created_at":"2026-05-18T12:31:59.375834+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/YYJYGHNJXZLOF6LWUPELHPJKG4","json":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4.json","graph_json":"https://pith.science/api/pith-number/YYJYGHNJXZLOF6LWUPELHPJKG4/graph.json","events_json":"https://pith.science/api/pith-number/YYJYGHNJXZLOF6LWUPELHPJKG4/events.json","paper":"https://pith.science/paper/YYJYGHNJ"},"agent_actions":{"view_html":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4","download_json":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4.json","view_paper":"https://pith.science/paper/YYJYGHNJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07584&json=true","fetch_graph":"https://pith.science/api/pith-number/YYJYGHNJXZLOF6LWUPELHPJKG4/graph.json","fetch_events":"https://pith.science/api/pith-number/YYJYGHNJXZLOF6LWUPELHPJKG4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/action/storage_attestation","attest_author":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/action/author_attestation","sign_citation":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/action/citation_signature","submit_replication":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/action/replication_record"}},"created_at":"2026-05-18T00:22:20.632647+00:00","updated_at":"2026-05-18T00:22:20.632647+00:00"}