{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:35WOUJCBONAMBOCFELY4RHZSIM","short_pith_number":"pith:35WOUJCB","schema_version":"1.0","canonical_sha256":"df6cea24417340c0b84522f1c89f32432dd932a70d7ce2053a194c73a6c7d96e","source":{"kind":"arxiv","id":"1708.00622","version":1},"attestation_state":"computed","paper":{"title":"On the Parameterized Complexity of Contraction to Generalization of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Prafullkumar Tale, Saket Saurabh","submitted_at":"2017-08-02T07:44:40Z","abstract_excerpt":"For a family of graphs $\\cal F$, the $\\mathcal{F}$-Contraction problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $S \\subseteq E(G)$ of size at most $k$ such that $G/S$ belongs to $\\cal F$. Here, $G/S$ is the graph obtained from $G$ by contracting all the edges in $S$. Heggernes et al.~[Algorithmica (2014)] were the first to study edge contraction problems in the realm of Parameterized Complexity. They studied $\\cal F$-Contraction when $\\cal F$ is a simple family of graphs such as trees and paths. In this paper, we study the $\\mathcal{F}$-Contra"},"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":"1708.00622","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-02T07:44:40Z","cross_cats_sorted":[],"title_canon_sha256":"9a5484eab73854cf6eba9bd29cd72b26e1ac521c3da08aa0214b324cf9d6cf62","abstract_canon_sha256":"2c52064db7aca60aa53e1f2acd57fdaa2c0ffcf1561eb292fccf97d94013dc12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:45.213032Z","signature_b64":"sQ0LKcE9S9H9TlIT1jJpqpSXufpEwJtWTdq+wpH0PW/2feISK7IglkheboEl2y2ClgLc5q0BT4pWJmegnXy+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df6cea24417340c0b84522f1c89f32432dd932a70d7ce2053a194c73a6c7d96e","last_reissued_at":"2026-05-18T00:38:45.212581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:45.212581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Parameterized Complexity of Contraction to Generalization of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Prafullkumar Tale, Saket Saurabh","submitted_at":"2017-08-02T07:44:40Z","abstract_excerpt":"For a family of graphs $\\cal F$, the $\\mathcal{F}$-Contraction problem takes as an input a graph $G$ and an integer $k$, and the goal is to decide if there exists $S \\subseteq E(G)$ of size at most $k$ such that $G/S$ belongs to $\\cal F$. Here, $G/S$ is the graph obtained from $G$ by contracting all the edges in $S$. Heggernes et al.~[Algorithmica (2014)] were the first to study edge contraction problems in the realm of Parameterized Complexity. They studied $\\cal F$-Contraction when $\\cal F$ is a simple family of graphs such as trees and paths. In this paper, we study the $\\mathcal{F}$-Contra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00622","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":"1708.00622","created_at":"2026-05-18T00:38:45.212642+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.00622v1","created_at":"2026-05-18T00:38:45.212642+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00622","created_at":"2026-05-18T00:38:45.212642+00:00"},{"alias_kind":"pith_short_12","alias_value":"35WOUJCBONAM","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"35WOUJCBONAMBOCF","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"35WOUJCB","created_at":"2026-05-18T12:30:58.224056+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/35WOUJCBONAMBOCFELY4RHZSIM","json":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM.json","graph_json":"https://pith.science/api/pith-number/35WOUJCBONAMBOCFELY4RHZSIM/graph.json","events_json":"https://pith.science/api/pith-number/35WOUJCBONAMBOCFELY4RHZSIM/events.json","paper":"https://pith.science/paper/35WOUJCB"},"agent_actions":{"view_html":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM","download_json":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM.json","view_paper":"https://pith.science/paper/35WOUJCB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.00622&json=true","fetch_graph":"https://pith.science/api/pith-number/35WOUJCBONAMBOCFELY4RHZSIM/graph.json","fetch_events":"https://pith.science/api/pith-number/35WOUJCBONAMBOCFELY4RHZSIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/action/storage_attestation","attest_author":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/action/author_attestation","sign_citation":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/action/citation_signature","submit_replication":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/action/replication_record"}},"created_at":"2026-05-18T00:38:45.212642+00:00","updated_at":"2026-05-18T00:38:45.212642+00:00"}