{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:35WOUJCBONAMBOCFELY4RHZSIM","short_pith_number":"pith:35WOUJCB","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"},"canonical_sha256":"df6cea24417340c0b84522f1c89f32432dd932a70d7ce2053a194c73a6c7d96e","source":{"kind":"arxiv","id":"1708.00622","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00622","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00622v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00622","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"35WOUJCBONAM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"35WOUJCBONAMBOCF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"35WOUJCB","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:35WOUJCBONAMBOCFELY4RHZSIM","target":"record","payload":{"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"},"canonical_sha256":"df6cea24417340c0b84522f1c89f32432dd932a70d7ce2053a194c73a6c7d96e","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"},"source_kind":"arxiv","source_id":"1708.00622","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-18T00:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6RVRR4It6fakvSLfXEeBPiNE7ENEscyPSxbs7pt32yRIujGWxbJJloFrahZCp2is2esMfpVMX+7NSGd3GzQCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:21:15.680656Z"},"content_sha256":"72ef61c5d574ce5df02d9aef6722f8a3bbb7629659a3763685c75cd929145835","schema_version":"1.0","event_id":"sha256:72ef61c5d574ce5df02d9aef6722f8a3bbb7629659a3763685c75cd929145835"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:35WOUJCBONAMBOCFELY4RHZSIM","target":"graph","payload":{"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"},"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:38:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fcJ4pCYSFCvsIsQE10s6mMw9CCFDQFxDBWAgol8DPPnPgAXUcy5k94TYqVwAPNEETgpXMxZfb2dL1G5eFyw0BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:21:15.681298Z"},"content_sha256":"4bce25a5184be79fefb47331e9adf8844bfde5c7235e619c507aa6a45a25abc4","schema_version":"1.0","event_id":"sha256:4bce25a5184be79fefb47331e9adf8844bfde5c7235e619c507aa6a45a25abc4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/bundle.json","state_url":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/35WOUJCBONAMBOCFELY4RHZSIM/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-05-31T22:21:15Z","links":{"resolver":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM","bundle":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/bundle.json","state":"https://pith.science/pith/35WOUJCBONAMBOCFELY4RHZSIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/35WOUJCBONAMBOCFELY4RHZSIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:35WOUJCBONAMBOCFELY4RHZSIM","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":"2c52064db7aca60aa53e1f2acd57fdaa2c0ffcf1561eb292fccf97d94013dc12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-02T07:44:40Z","title_canon_sha256":"9a5484eab73854cf6eba9bd29cd72b26e1ac521c3da08aa0214b324cf9d6cf62"},"schema_version":"1.0","source":{"id":"1708.00622","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00622","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00622v1","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00622","created_at":"2026-05-18T00:38:45Z"},{"alias_kind":"pith_short_12","alias_value":"35WOUJCBONAM","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"35WOUJCBONAMBOCF","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"35WOUJCB","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:4bce25a5184be79fefb47331e9adf8844bfde5c7235e619c507aa6a45a25abc4","target":"graph","created_at":"2026-05-18T00:38:45Z","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":"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","authors_text":"Akanksha Agrawal, Prafullkumar Tale, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-02T07:44:40Z","title":"On the Parameterized Complexity of Contraction to Generalization of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00622","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:72ef61c5d574ce5df02d9aef6722f8a3bbb7629659a3763685c75cd929145835","target":"record","created_at":"2026-05-18T00:38:45Z","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":"2c52064db7aca60aa53e1f2acd57fdaa2c0ffcf1561eb292fccf97d94013dc12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-02T07:44:40Z","title_canon_sha256":"9a5484eab73854cf6eba9bd29cd72b26e1ac521c3da08aa0214b324cf9d6cf62"},"schema_version":"1.0","source":{"id":"1708.00622","kind":"arxiv","version":1}},"canonical_sha256":"df6cea24417340c0b84522f1c89f32432dd932a70d7ce2053a194c73a6c7d96e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"df6cea24417340c0b84522f1c89f32432dd932a70d7ce2053a194c73a6c7d96e","first_computed_at":"2026-05-18T00:38:45.212581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:45.212581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sQ0LKcE9S9H9TlIT1jJpqpSXufpEwJtWTdq+wpH0PW/2feISK7IglkheboEl2y2ClgLc5q0BT4pWJmegnXy+CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:45.213032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00622","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72ef61c5d574ce5df02d9aef6722f8a3bbb7629659a3763685c75cd929145835","sha256:4bce25a5184be79fefb47331e9adf8844bfde5c7235e619c507aa6a45a25abc4"],"state_sha256":"4b3c3bb8d0d057d9086d6877f4d368bbdb0e99fc96a1e20ede049ea8341835c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBxSyXXYn6H/5xtXCw7uExn5yYq6/dxD1Fh2b4LYsPgxqQL16TL0Ba3NA7tOmm4Uroixpam1D4f/i5L6ITL4Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:21:15.684905Z","bundle_sha256":"f5ef35df2ac1896587d64702b42fa1fb53cecd36f1bac3191c6b0c01835a2503"}}