{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:CXS46NLT2QKXNIKRSK5OHTVFN5","short_pith_number":"pith:CXS46NLT","schema_version":"1.0","canonical_sha256":"15e5cf3573d41576a15192bae3cea56f5520e87639b9180e212b3d64d1fa1a91","source":{"kind":"arxiv","id":"1306.2217","version":1},"attestation_state":"computed","paper":{"title":"Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bruno Escoffier, Edouard Bonnet, Emeric Tourniaire, Vangelis Th. Paschos","submitted_at":"2013-06-10T14:48:11Z","abstract_excerpt":"We study the parameterized complexity of a broad class of problems called \"local graph partitioning problems\" that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique \"greediness-for-parameterization\", we obtain fixed parameter algorithms with respect to a pair of parameters k, the size of the solution (but not its value) and \\Delta, the maximum degree of the input graph. In particular, greediness-for-parameterization improves asymptotic running times for these problems upon random separation (that is a special case of col"},"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":"1306.2217","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T14:48:11Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"fb9d29c8720cfcfa20aa28ec89c86ac91dbe9c95cc85cb99665015c5d7dc8687","abstract_canon_sha256":"6fc4011509021fcb765628dfa8ac7c9ed28f92d9307f4778d95c817d31415c85"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.066995Z","signature_b64":"MH0WSQX/7cEEB1YDI+UuNUEG3uemZp7xrd/rtbFL8kTK+eHktpVyNX6auMLUEhoJs5Y2JdmD1eqY8GaPqhH5AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15e5cf3573d41576a15192bae3cea56f5520e87639b9180e212b3d64d1fa1a91","last_reissued_at":"2026-05-18T03:21:22.066634Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.066634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Bruno Escoffier, Edouard Bonnet, Emeric Tourniaire, Vangelis Th. Paschos","submitted_at":"2013-06-10T14:48:11Z","abstract_excerpt":"We study the parameterized complexity of a broad class of problems called \"local graph partitioning problems\" that includes the classical fixed cardinality problems as max k-vertex cover, k-densest subgraph, etc. By developing a technique \"greediness-for-parameterization\", we obtain fixed parameter algorithms with respect to a pair of parameters k, the size of the solution (but not its value) and \\Delta, the maximum degree of the input graph. In particular, greediness-for-parameterization improves asymptotic running times for these problems upon random separation (that is a special case of col"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2217","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":"1306.2217","created_at":"2026-05-18T03:21:22.066689+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.2217v1","created_at":"2026-05-18T03:21:22.066689+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2217","created_at":"2026-05-18T03:21:22.066689+00:00"},{"alias_kind":"pith_short_12","alias_value":"CXS46NLT2QKX","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"CXS46NLT2QKXNIKR","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"CXS46NLT","created_at":"2026-05-18T12:27:40.988391+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/CXS46NLT2QKXNIKRSK5OHTVFN5","json":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5.json","graph_json":"https://pith.science/api/pith-number/CXS46NLT2QKXNIKRSK5OHTVFN5/graph.json","events_json":"https://pith.science/api/pith-number/CXS46NLT2QKXNIKRSK5OHTVFN5/events.json","paper":"https://pith.science/paper/CXS46NLT"},"agent_actions":{"view_html":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5","download_json":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5.json","view_paper":"https://pith.science/paper/CXS46NLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.2217&json=true","fetch_graph":"https://pith.science/api/pith-number/CXS46NLT2QKXNIKRSK5OHTVFN5/graph.json","fetch_events":"https://pith.science/api/pith-number/CXS46NLT2QKXNIKRSK5OHTVFN5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/action/storage_attestation","attest_author":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/action/author_attestation","sign_citation":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/action/citation_signature","submit_replication":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/action/replication_record"}},"created_at":"2026-05-18T03:21:22.066689+00:00","updated_at":"2026-05-18T03:21:22.066689+00:00"}