{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:DJ6J3WFQUQ4IOUS6IZNNYATN35","short_pith_number":"pith:DJ6J3WFQ","schema_version":"1.0","canonical_sha256":"1a7c9dd8b0a43887525e465adc026ddf445e0fbbf94711d53dc27f700d5977f1","source":{"kind":"arxiv","id":"1201.3091","version":2},"attestation_state":"computed","paper":{"title":"Using Neighborhood Diversity to Solve Hard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Robert Ganian","submitted_at":"2012-01-15T14:52:50Z","abstract_excerpt":"Parameterized algorithms are a very useful tool for dealing with NP-hard problems on graphs. Yet, to properly utilize parameterized algorithms it is necessary to choose the right parameter based on the type of problem and properties of the target graph class. Tree-width is an example of a very successful graph parameter, however it cannot be used on dense graph classes and there also exist problems which are hard even on graphs of bounded tree-width. Such problems can be tackled by using vertex cover as a parameter, however this places severe restrictions on admissible graph classes.\n  Michael"},"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":"1201.3091","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-15T14:52:50Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"915f79da33d2496a2bf497ade6a16ef73c5e190fe4cb3b84c4272be679461536","abstract_canon_sha256":"9d80b2621682d7ea06128be27955d507857aae3bb348d2a5305d849003619823"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:29.551020Z","signature_b64":"8DZvJArrIhPDDRWb0tXHkbA7PlQV+qDiJKB1Nh/UM45t8BAIuwwtQ/VRJfH05eFkZGqWaa5U8+f0Q3PMtqNUBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a7c9dd8b0a43887525e465adc026ddf445e0fbbf94711d53dc27f700d5977f1","last_reissued_at":"2026-05-18T04:04:29.550464Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:29.550464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Using Neighborhood Diversity to Solve Hard Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Robert Ganian","submitted_at":"2012-01-15T14:52:50Z","abstract_excerpt":"Parameterized algorithms are a very useful tool for dealing with NP-hard problems on graphs. Yet, to properly utilize parameterized algorithms it is necessary to choose the right parameter based on the type of problem and properties of the target graph class. Tree-width is an example of a very successful graph parameter, however it cannot be used on dense graph classes and there also exist problems which are hard even on graphs of bounded tree-width. Such problems can be tackled by using vertex cover as a parameter, however this places severe restrictions on admissible graph classes.\n  Michael"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.3091","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":"1201.3091","created_at":"2026-05-18T04:04:29.550546+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.3091v2","created_at":"2026-05-18T04:04:29.550546+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.3091","created_at":"2026-05-18T04:04:29.550546+00:00"},{"alias_kind":"pith_short_12","alias_value":"DJ6J3WFQUQ4I","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"DJ6J3WFQUQ4IOUS6","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"DJ6J3WFQ","created_at":"2026-05-18T12:27:04.183437+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.15274","citing_title":"The Parameterized Complexity of Coloring Mixed Graphs","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35","json":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35.json","graph_json":"https://pith.science/api/pith-number/DJ6J3WFQUQ4IOUS6IZNNYATN35/graph.json","events_json":"https://pith.science/api/pith-number/DJ6J3WFQUQ4IOUS6IZNNYATN35/events.json","paper":"https://pith.science/paper/DJ6J3WFQ"},"agent_actions":{"view_html":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35","download_json":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35.json","view_paper":"https://pith.science/paper/DJ6J3WFQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.3091&json=true","fetch_graph":"https://pith.science/api/pith-number/DJ6J3WFQUQ4IOUS6IZNNYATN35/graph.json","fetch_events":"https://pith.science/api/pith-number/DJ6J3WFQUQ4IOUS6IZNNYATN35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35/action/storage_attestation","attest_author":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35/action/author_attestation","sign_citation":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35/action/citation_signature","submit_replication":"https://pith.science/pith/DJ6J3WFQUQ4IOUS6IZNNYATN35/action/replication_record"}},"created_at":"2026-05-18T04:04:29.550546+00:00","updated_at":"2026-05-18T04:04:29.550546+00:00"}