{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y3B2RXK2ZGGPZG3PMBJEWLS6RK","short_pith_number":"pith:Y3B2RXK2","schema_version":"1.0","canonical_sha256":"c6c3a8dd5ac98cfc9b6f60524b2e5e8a93bfa81feecde2d7c5b50a9fc41cd539","source":{"kind":"arxiv","id":"1703.01686","version":2},"attestation_state":"computed","paper":{"title":"Parameterized complexity of finding a spanning tree with minimum reload cost diameter","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, Dimitrios M. Thilikos, Ignasi Sau, Julien Baste, Mordechai Shalom","submitted_at":"2017-03-05T23:06:03Z","abstract_excerpt":"We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). In this problem, given an undirected edge-colored graph $G$, reload costs on a path arise at a node where the path uses consecutive edges of different colors. The objective is to find a spanning tree of $G$ of minimum diameter with respect to the reload costs. We initiate a systematic study of the parameterized complexity of the DIAMETER-TREE problem by considering the following parameters: the cost of a solution, and the treewidth and the maximum de"},"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":"1703.01686","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-05T23:06:03Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"6c942a5089e4d53b8f0e9efa71c0687b2d7324a0d2cb31caf7d4a76be288d912","abstract_canon_sha256":"320658cea8724499f077a0a764fd46691e6941530237669e0d9ec5f3090c4a2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:53.877396Z","signature_b64":"lB2p4wNUJUGKEuB/k69/NC5x80TsU16YOWqr7px49grPAJ+ox6S1R+P8ljxccfNtSOoRmm9Oau8L9nj/oVJWCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6c3a8dd5ac98cfc9b6f60524b2e5e8a93bfa81feecde2d7c5b50a9fc41cd539","last_reissued_at":"2026-05-18T00:45:53.876880Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:53.876880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized complexity of finding a spanning tree with minimum reload cost diameter","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, Dimitrios M. Thilikos, Ignasi Sau, Julien Baste, Mordechai Shalom","submitted_at":"2017-03-05T23:06:03Z","abstract_excerpt":"We study the minimum diameter spanning tree problem under the reload cost model (DIAMETER-TREE for short) introduced by Wirth and Steffan (2001). In this problem, given an undirected edge-colored graph $G$, reload costs on a path arise at a node where the path uses consecutive edges of different colors. The objective is to find a spanning tree of $G$ of minimum diameter with respect to the reload costs. We initiate a systematic study of the parameterized complexity of the DIAMETER-TREE problem by considering the following parameters: the cost of a solution, and the treewidth and the maximum de"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01686","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":"1703.01686","created_at":"2026-05-18T00:45:53.876959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.01686v2","created_at":"2026-05-18T00:45:53.876959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.01686","created_at":"2026-05-18T00:45:53.876959+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3B2RXK2ZGGP","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3B2RXK2ZGGPZG3P","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3B2RXK2","created_at":"2026-05-18T12:31:56.362134+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/Y3B2RXK2ZGGPZG3PMBJEWLS6RK","json":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK.json","graph_json":"https://pith.science/api/pith-number/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/graph.json","events_json":"https://pith.science/api/pith-number/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/events.json","paper":"https://pith.science/paper/Y3B2RXK2"},"agent_actions":{"view_html":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK","download_json":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK.json","view_paper":"https://pith.science/paper/Y3B2RXK2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.01686&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/action/storage_attestation","attest_author":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/action/author_attestation","sign_citation":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/action/citation_signature","submit_replication":"https://pith.science/pith/Y3B2RXK2ZGGPZG3PMBJEWLS6RK/action/replication_record"}},"created_at":"2026-05-18T00:45:53.876959+00:00","updated_at":"2026-05-18T00:45:53.876959+00:00"}