{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:YYJYGHNJXZLOF6LWUPELHPJKG4","short_pith_number":"pith:YYJYGHNJ","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"},"canonical_sha256":"c613831da9be56e2f976a3c8b3bd2a372598a1d3c64207b82edb79f3061b075a","source":{"kind":"arxiv","id":"1710.07584","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07584","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07584v2","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07584","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"YYJYGHNJXZLO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YYJYGHNJXZLOF6LW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YYJYGHNJ","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:YYJYGHNJXZLOF6LWUPELHPJKG4","target":"record","payload":{"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"},"canonical_sha256":"c613831da9be56e2f976a3c8b3bd2a372598a1d3c64207b82edb79f3061b075a","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"},"source_kind":"arxiv","source_id":"1710.07584","source_version":2,"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-05-18T00:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eimThY6qHuCV8dTznmybnzxDbw/GoxOgoYiCEwStvn+3zkc+YGE7tvI1o5/ZU66wemGryQDWhCbQPQCs8XftDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:48:20.675596Z"},"content_sha256":"7fc30ec8909fa593117e37a31d42ff6b9238855fa7e6b1487b6c53777e1a3da7","schema_version":"1.0","event_id":"sha256:7fc30ec8909fa593117e37a31d42ff6b9238855fa7e6b1487b6c53777e1a3da7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:YYJYGHNJXZLOF6LWUPELHPJKG4","target":"graph","payload":{"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"},"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-05-18T00:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BH2F/4TIZlQuG7rYXDmv6RoD2wzb38SRG0XOl8lLX29D25ue4jiIUe67vBh2jyfztz+UtMcFLHWywJ3mtyQBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T01:48:20.675975Z"},"content_sha256":"f2cdd6d04e1cda058755155f967610c48fdd773b45e2b11ad54181b64e1b77b1","schema_version":"1.0","event_id":"sha256:f2cdd6d04e1cda058755155f967610c48fdd773b45e2b11ad54181b64e1b77b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/bundle.json","state_url":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/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-22T01:48:20Z","links":{"resolver":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4","bundle":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/bundle.json","state":"https://pith.science/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYJYGHNJXZLOF6LWUPELHPJKG4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YYJYGHNJXZLOF6LWUPELHPJKG4","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":"5688fef1ba489b845fdad73c3cbb2af97c18fc402c5073e398daca6963772660","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T15:55:58Z","title_canon_sha256":"170ee84a1dfd2c393f561b677ff039e834f6345e07fb30d6332afe443682492d"},"schema_version":"1.0","source":{"id":"1710.07584","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.07584","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1710.07584v2","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07584","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"YYJYGHNJXZLO","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"YYJYGHNJXZLOF6LW","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"YYJYGHNJ","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:f2cdd6d04e1cda058755155f967610c48fdd773b45e2b11ad54181b64e1b77b1","target":"graph","created_at":"2026-05-18T00:22: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"},"paper":{"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","authors_text":"Christian Komusiewicz, Guillaume Fertin, Julien Fradin","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T15:55:58Z","title":"The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07584","kind":"arxiv","version":2},"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:7fc30ec8909fa593117e37a31d42ff6b9238855fa7e6b1487b6c53777e1a3da7","target":"record","created_at":"2026-05-18T00:22: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":"5688fef1ba489b845fdad73c3cbb2af97c18fc402c5073e398daca6963772660","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2017-10-20T15:55:58Z","title_canon_sha256":"170ee84a1dfd2c393f561b677ff039e834f6345e07fb30d6332afe443682492d"},"schema_version":"1.0","source":{"id":"1710.07584","kind":"arxiv","version":2}},"canonical_sha256":"c613831da9be56e2f976a3c8b3bd2a372598a1d3c64207b82edb79f3061b075a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c613831da9be56e2f976a3c8b3bd2a372598a1d3c64207b82edb79f3061b075a","first_computed_at":"2026-05-18T00:22:20.632580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:20.632580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hQsQfCG9Y4VSKRpuxHrY+qQyFJgEZkxUg4OMkMT1jDxC2izgJY26Y4x9Rf/5O7e8rhbTxnEJ0Q6JxxuJLiGBBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:20.633125Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.07584","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7fc30ec8909fa593117e37a31d42ff6b9238855fa7e6b1487b6c53777e1a3da7","sha256:f2cdd6d04e1cda058755155f967610c48fdd773b45e2b11ad54181b64e1b77b1"],"state_sha256":"98e0feee129fa2ef4a969324133da537edd2e6547748b7d1ee8ff2c0721c8268"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FG37NwuyicCS3w+RMLVSNRATKcSBRqIuoMN1BS2tjV05sHCRVF7s8tD8RiXwvTvB+jVlNzDO7ZX9BKv65UP3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T01:48:20.678021Z","bundle_sha256":"59f9961984aa1ee107b2b7961b8279e4acfcb3f0c3af3b258388c8e2822cef8b"}}