{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CXS46NLT2QKXNIKRSK5OHTVFN5","short_pith_number":"pith:CXS46NLT","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"},"canonical_sha256":"15e5cf3573d41576a15192bae3cea56f5520e87639b9180e212b3d64d1fa1a91","source":{"kind":"arxiv","id":"1306.2217","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2217","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2217v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2217","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"CXS46NLT2QKX","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CXS46NLT2QKXNIKR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CXS46NLT","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CXS46NLT2QKXNIKRSK5OHTVFN5","target":"record","payload":{"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"},"canonical_sha256":"15e5cf3573d41576a15192bae3cea56f5520e87639b9180e212b3d64d1fa1a91","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"},"source_kind":"arxiv","source_id":"1306.2217","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-18T03:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BVoWPAEfp1rlsnMlzYxZdMbPQXUs0VAKM+EY1Xy6ijoUCP6vm6wffGHTen3ocO0qYn7pIO91NOA7noyJHby3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:31:19.195656Z"},"content_sha256":"b7e2c18c5543d9d9650b39fc828d0020390c7b21cb9240d8a828de061476134b","schema_version":"1.0","event_id":"sha256:b7e2c18c5543d9d9650b39fc828d0020390c7b21cb9240d8a828de061476134b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CXS46NLT2QKXNIKRSK5OHTVFN5","target":"graph","payload":{"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"},"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-18T03:21:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goW8AOgpDGQF1lODpcoriVYeWcnNEw1OfQOE/1Qu1YjYQLqctFp6DjYZpejpPeoQiDaxcg5/flD57sQJc3LJDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:31:19.196012Z"},"content_sha256":"b5a115a175ca989945d1acc9e247b519d130128946f2bb0ddc56ae516751158e","schema_version":"1.0","event_id":"sha256:b5a115a175ca989945d1acc9e247b519d130128946f2bb0ddc56ae516751158e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/bundle.json","state_url":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/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-31T07:31:19Z","links":{"resolver":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5","bundle":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/bundle.json","state":"https://pith.science/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CXS46NLT2QKXNIKRSK5OHTVFN5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CXS46NLT2QKXNIKRSK5OHTVFN5","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":"6fc4011509021fcb765628dfa8ac7c9ed28f92d9307f4778d95c817d31415c85","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T14:48:11Z","title_canon_sha256":"fb9d29c8720cfcfa20aa28ec89c86ac91dbe9c95cc85cb99665015c5d7dc8687"},"schema_version":"1.0","source":{"id":"1306.2217","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2217","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2217v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2217","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"CXS46NLT2QKX","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CXS46NLT2QKXNIKR","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CXS46NLT","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:b5a115a175ca989945d1acc9e247b519d130128946f2bb0ddc56ae516751158e","target":"graph","created_at":"2026-05-18T03:21:22Z","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":"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","authors_text":"Bruno Escoffier, Edouard Bonnet, Emeric Tourniaire, Vangelis Th. Paschos","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T14:48:11Z","title":"Multi-parameter complexity analysis for constrained size graph problems: using greediness for parameterization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2217","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:b7e2c18c5543d9d9650b39fc828d0020390c7b21cb9240d8a828de061476134b","target":"record","created_at":"2026-05-18T03:21:22Z","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":"6fc4011509021fcb765628dfa8ac7c9ed28f92d9307f4778d95c817d31415c85","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T14:48:11Z","title_canon_sha256":"fb9d29c8720cfcfa20aa28ec89c86ac91dbe9c95cc85cb99665015c5d7dc8687"},"schema_version":"1.0","source":{"id":"1306.2217","kind":"arxiv","version":1}},"canonical_sha256":"15e5cf3573d41576a15192bae3cea56f5520e87639b9180e212b3d64d1fa1a91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"15e5cf3573d41576a15192bae3cea56f5520e87639b9180e212b3d64d1fa1a91","first_computed_at":"2026-05-18T03:21:22.066634Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.066634Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MH0WSQX/7cEEB1YDI+UuNUEG3uemZp7xrd/rtbFL8kTK+eHktpVyNX6auMLUEhoJs5Y2JdmD1eqY8GaPqhH5AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.066995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2217","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7e2c18c5543d9d9650b39fc828d0020390c7b21cb9240d8a828de061476134b","sha256:b5a115a175ca989945d1acc9e247b519d130128946f2bb0ddc56ae516751158e"],"state_sha256":"6b0db85518cc1a77361fcc03fee1914dd9ad49585d9a0eedc5b9c32008a23acb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4/6mYU4+nZzpFW7vbeAMdxVXF/alZ4+fAZMjVmQFCfSrbUPanb+W65mezV3NfCX4/Mr45/5wfK1qAdd/OO/9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:31:19.198217Z","bundle_sha256":"322444aed7e3c32f75f2f0c579973d39ec374bd29071f0570bcd9d65fce30964"}}