{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YHUVFOR5MLD43JHFO7UXUD2GGN","short_pith_number":"pith:YHUVFOR5","canonical_record":{"source":{"id":"1605.00532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T15:39:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ef32fc516675ad2048934ba9c94c8c6ce9204f067f0456b931ca3c9567be9dfe","abstract_canon_sha256":"e0f6daa615560bc00c0d7269178bbe0b48b61c57f88c7ad0c441389353adf315"},"schema_version":"1.0"},"canonical_sha256":"c1e952ba3d62c7cda4e577e97a0f463362d14368696cdf07227b618357ddaef9","source":{"kind":"arxiv","id":"1605.00532","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00532","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00532v1","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00532","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"YHUVFOR5MLD4","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YHUVFOR5MLD43JHF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YHUVFOR5","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YHUVFOR5MLD43JHFO7UXUD2GGN","target":"record","payload":{"canonical_record":{"source":{"id":"1605.00532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T15:39:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ef32fc516675ad2048934ba9c94c8c6ce9204f067f0456b931ca3c9567be9dfe","abstract_canon_sha256":"e0f6daa615560bc00c0d7269178bbe0b48b61c57f88c7ad0c441389353adf315"},"schema_version":"1.0"},"canonical_sha256":"c1e952ba3d62c7cda4e577e97a0f463362d14368696cdf07227b618357ddaef9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:53.950933Z","signature_b64":"mgxgNmwmzhT4eAXZ5l4foI2gSEgkXenKLYqFCyJZBg39BRVLwFf9AIQQR/n/xRpn+J2dSENy7ItUho0LP26UDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1e952ba3d62c7cda4e577e97a0f463362d14368696cdf07227b618357ddaef9","last_reissued_at":"2026-05-18T01:15:53.950242Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:53.950242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.00532","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-05-18T01:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4K97J1fpwZiVLtPEmjNPwSu+rvSp/V3dfyIwqDpyKs44cVY6oG/HJmMyZINmO+8HshQN6KZQw4/f1VPzc940Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:57:38.073706Z"},"content_sha256":"da77197e3666558618b9175a4f40bde5886e2fc2275b9e351dc656a6927457a5","schema_version":"1.0","event_id":"sha256:da77197e3666558618b9175a4f40bde5886e2fc2275b9e351dc656a6927457a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YHUVFOR5MLD43JHFO7UXUD2GGN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized complexity of the MINCCA problem on graphs of bounded decomposability","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Christophe Paul, Didem G\\\"oz\\\"upek, Ignasi Sau, Mordechai Shalom, Sibel \\\"Ozkan","submitted_at":"2016-05-02T15:39:50Z","abstract_excerpt":"In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The \"Minimum Changeover Cost Arborescence\" (MINCCA) problem consists in finding an arborescence with a given root vertex such that the total changeover cost of the internal vertices is minimized. It has been recently proved by G\\\"oz\\\"upek et al. [TCS 2016] that the problem is FPT when parameterized by the treewidth and the maximum degree of the input graph. In this article we present the following results for the MINCCA problem:\n  - "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00532","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"},"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-18T01:15:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7K9KsK3AJCiZiv3Al8ZtOpez+QNBKzHSOLzAfWfFOBmTr2D3uGttryTFC/gwoL7kN3Lo9lQ10hJeOF4Dg8BMDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-21T21:57:38.074039Z"},"content_sha256":"9756d5aff85b7a9789e9946d078ad36d996e4f824e87f8714b9f224ac20bcc48","schema_version":"1.0","event_id":"sha256:9756d5aff85b7a9789e9946d078ad36d996e4f824e87f8714b9f224ac20bcc48"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHUVFOR5MLD43JHFO7UXUD2GGN/bundle.json","state_url":"https://pith.science/pith/YHUVFOR5MLD43JHFO7UXUD2GGN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHUVFOR5MLD43JHFO7UXUD2GGN/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-21T21:57:38Z","links":{"resolver":"https://pith.science/pith/YHUVFOR5MLD43JHFO7UXUD2GGN","bundle":"https://pith.science/pith/YHUVFOR5MLD43JHFO7UXUD2GGN/bundle.json","state":"https://pith.science/pith/YHUVFOR5MLD43JHFO7UXUD2GGN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHUVFOR5MLD43JHFO7UXUD2GGN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YHUVFOR5MLD43JHFO7UXUD2GGN","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":"e0f6daa615560bc00c0d7269178bbe0b48b61c57f88c7ad0c441389353adf315","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T15:39:50Z","title_canon_sha256":"ef32fc516675ad2048934ba9c94c8c6ce9204f067f0456b931ca3c9567be9dfe"},"schema_version":"1.0","source":{"id":"1605.00532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.00532","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"arxiv_version","alias_value":"1605.00532v1","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.00532","created_at":"2026-05-18T01:15:53Z"},{"alias_kind":"pith_short_12","alias_value":"YHUVFOR5MLD4","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YHUVFOR5MLD43JHF","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YHUVFOR5","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:9756d5aff85b7a9789e9946d078ad36d996e4f824e87f8714b9f224ac20bcc48","target":"graph","created_at":"2026-05-18T01:15:53Z","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":"In an edge-colored graph, the cost incurred at a vertex on a path when two incident edges with different colors are traversed is called reload or changeover cost. The \"Minimum Changeover Cost Arborescence\" (MINCCA) problem consists in finding an arborescence with a given root vertex such that the total changeover cost of the internal vertices is minimized. It has been recently proved by G\\\"oz\\\"upek et al. [TCS 2016] that the problem is FPT when parameterized by the treewidth and the maximum degree of the input graph. In this article we present the following results for the MINCCA problem:\n  - ","authors_text":"Christophe Paul, Didem G\\\"oz\\\"upek, Ignasi Sau, Mordechai Shalom, Sibel \\\"Ozkan","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T15:39:50Z","title":"Parameterized complexity of the MINCCA problem on graphs of bounded decomposability"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.00532","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:da77197e3666558618b9175a4f40bde5886e2fc2275b9e351dc656a6927457a5","target":"record","created_at":"2026-05-18T01:15:53Z","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":"e0f6daa615560bc00c0d7269178bbe0b48b61c57f88c7ad0c441389353adf315","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-05-02T15:39:50Z","title_canon_sha256":"ef32fc516675ad2048934ba9c94c8c6ce9204f067f0456b931ca3c9567be9dfe"},"schema_version":"1.0","source":{"id":"1605.00532","kind":"arxiv","version":1}},"canonical_sha256":"c1e952ba3d62c7cda4e577e97a0f463362d14368696cdf07227b618357ddaef9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1e952ba3d62c7cda4e577e97a0f463362d14368696cdf07227b618357ddaef9","first_computed_at":"2026-05-18T01:15:53.950242Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:53.950242Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mgxgNmwmzhT4eAXZ5l4foI2gSEgkXenKLYqFCyJZBg39BRVLwFf9AIQQR/n/xRpn+J2dSENy7ItUho0LP26UDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:53.950933Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.00532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da77197e3666558618b9175a4f40bde5886e2fc2275b9e351dc656a6927457a5","sha256:9756d5aff85b7a9789e9946d078ad36d996e4f824e87f8714b9f224ac20bcc48"],"state_sha256":"f87a508812d8b03ba78389ea5c8974f49bb60d257b6443352f18cf720639ac9f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IEkqu1p1wScro0RiPk3zgheJcQrsq1hVfn5Ay50gLXr774Jk0ziw0mLIq0qsLg9HqeEVdN8ECTCkUJIVfZ4pCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-21T21:57:38.075946Z","bundle_sha256":"2036974cf3b16e7e11a0f27f63a48e08a24185ffc16b005897ac6dd446ac1d38"}}