{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:P6GOFWTNHOSVL62OFH4WGU45C6","short_pith_number":"pith:P6GOFWTN","canonical_record":{"source":{"id":"1306.2171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T11:49:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9b9262574a9f5ca6f56d84d16307d0efc2de1aaea6ab2b479e880bab4d4cdfdc","abstract_canon_sha256":"514479031dde650c7c2d8f23dddcbc766fb1087fcd0af04207dc7344ff70c555"},"schema_version":"1.0"},"canonical_sha256":"7f8ce2da6d3ba555fb4e29f963539d17af3871b18eec19fe82402803663db4b0","source":{"kind":"arxiv","id":"1306.2171","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2171","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2171v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2171","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6GOFWTNHOSV","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P6GOFWTNHOSVL62O","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P6GOFWTN","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:P6GOFWTNHOSVL62OFH4WGU45C6","target":"record","payload":{"canonical_record":{"source":{"id":"1306.2171","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T11:49:59Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"9b9262574a9f5ca6f56d84d16307d0efc2de1aaea6ab2b479e880bab4d4cdfdc","abstract_canon_sha256":"514479031dde650c7c2d8f23dddcbc766fb1087fcd0af04207dc7344ff70c555"},"schema_version":"1.0"},"canonical_sha256":"7f8ce2da6d3ba555fb4e29f963539d17af3871b18eec19fe82402803663db4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:22.142540Z","signature_b64":"JJDyoczmjjocTcDqnqBy4UKDvYws+8mGwoDMcHdzJk9m2k4Xj3mX8/fYO3fJXntV3pdR4fOZnk+/6gkBWEt3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f8ce2da6d3ba555fb4e29f963539d17af3871b18eec19fe82402803663db4b0","last_reissued_at":"2026-05-18T03:21:22.142050Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:22.142050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1306.2171","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":"bE2QBTRWXNHGgynRJqo/Z4BknTdvui0X52O9mnXcywyjrPzd6EyaocW7PMM5USRw76WfhQIhmPJBCPmBl/S4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:51:38.554219Z"},"content_sha256":"a44156f4b6eee338b11234cd9ca1c7a8fbfa1824adeb9f89e4ab22577061a5e4","schema_version":"1.0","event_id":"sha256:a44156f4b6eee338b11234cd9ca1c7a8fbfa1824adeb9f89e4ab22577061a5e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:P6GOFWTNHOSVL62OFH4WGU45C6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Paradigms for Parameterized Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.CC","authors_text":"Arne Meier, Heribert Vollmer, Johannes Schmidt, Julian-Steffen M\\\"uller, Nadia Creignou","submitted_at":"2013-06-10T11:49:59Z","abstract_excerpt":"The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First we define formally different notions of efficient enumeration in the context of parameterized complexity. Second we show how different algorithmic paradigms can be used in order to get parameter-efficient enumeration algorithms in a number of examples. These paradigms use well-known principles from the design of parameterized decision as well as enumeration techniques, like for instance ke"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2171","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":"ubzt2hLaaMwEyktijnCGskF3RrR0nV28F16oCMGwl4sOkl9JtkZsIMM/1slquNNizDG11hm7hIWFKqhYFKAQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:51:38.554984Z"},"content_sha256":"640aaf8910a46b612f84478bf8d4d2ceb40371b912c37e75046e55c536d5c150","schema_version":"1.0","event_id":"sha256:640aaf8910a46b612f84478bf8d4d2ceb40371b912c37e75046e55c536d5c150"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/P6GOFWTNHOSVL62OFH4WGU45C6/bundle.json","state_url":"https://pith.science/pith/P6GOFWTNHOSVL62OFH4WGU45C6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/P6GOFWTNHOSVL62OFH4WGU45C6/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-31T23:51:38Z","links":{"resolver":"https://pith.science/pith/P6GOFWTNHOSVL62OFH4WGU45C6","bundle":"https://pith.science/pith/P6GOFWTNHOSVL62OFH4WGU45C6/bundle.json","state":"https://pith.science/pith/P6GOFWTNHOSVL62OFH4WGU45C6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/P6GOFWTNHOSVL62OFH4WGU45C6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:P6GOFWTNHOSVL62OFH4WGU45C6","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":"514479031dde650c7c2d8f23dddcbc766fb1087fcd0af04207dc7344ff70c555","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T11:49:59Z","title_canon_sha256":"9b9262574a9f5ca6f56d84d16307d0efc2de1aaea6ab2b479e880bab4d4cdfdc"},"schema_version":"1.0","source":{"id":"1306.2171","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.2171","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"arxiv_version","alias_value":"1306.2171v1","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.2171","created_at":"2026-05-18T03:21:22Z"},{"alias_kind":"pith_short_12","alias_value":"P6GOFWTNHOSV","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"P6GOFWTNHOSVL62O","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"P6GOFWTN","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:640aaf8910a46b612f84478bf8d4d2ceb40371b912c37e75046e55c536d5c150","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":"The aim of the paper is to examine the computational complexity and algorithmics of enumeration, the task to output all solutions of a given problem, from the point of view of parameterized complexity. First we define formally different notions of efficient enumeration in the context of parameterized complexity. Second we show how different algorithmic paradigms can be used in order to get parameter-efficient enumeration algorithms in a number of examples. These paradigms use well-known principles from the design of parameterized decision as well as enumeration techniques, like for instance ke","authors_text":"Arne Meier, Heribert Vollmer, Johannes Schmidt, Julian-Steffen M\\\"uller, Nadia Creignou","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T11:49:59Z","title":"Paradigms for Parameterized Enumeration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.2171","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:a44156f4b6eee338b11234cd9ca1c7a8fbfa1824adeb9f89e4ab22577061a5e4","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":"514479031dde650c7c2d8f23dddcbc766fb1087fcd0af04207dc7344ff70c555","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-10T11:49:59Z","title_canon_sha256":"9b9262574a9f5ca6f56d84d16307d0efc2de1aaea6ab2b479e880bab4d4cdfdc"},"schema_version":"1.0","source":{"id":"1306.2171","kind":"arxiv","version":1}},"canonical_sha256":"7f8ce2da6d3ba555fb4e29f963539d17af3871b18eec19fe82402803663db4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7f8ce2da6d3ba555fb4e29f963539d17af3871b18eec19fe82402803663db4b0","first_computed_at":"2026-05-18T03:21:22.142050Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:21:22.142050Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JJDyoczmjjocTcDqnqBy4UKDvYws+8mGwoDMcHdzJk9m2k4Xj3mX8/fYO3fJXntV3pdR4fOZnk+/6gkBWEt3Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:21:22.142540Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.2171","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a44156f4b6eee338b11234cd9ca1c7a8fbfa1824adeb9f89e4ab22577061a5e4","sha256:640aaf8910a46b612f84478bf8d4d2ceb40371b912c37e75046e55c536d5c150"],"state_sha256":"0bfb2de854890bad06853ed47c4921412e612bc52e0c8c9768babacc817ce02e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wb/EWoJeXyqcGPo1JoF1VAvyPbG6Xvd07LZCR50ZZuXEikLx0cwWHJE52bBVt/TML2AE1iVuiKtuavr1EGAaCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:51:38.559811Z","bundle_sha256":"df735ea27eb4cdb2d149caa911574e6064716f792614dc83eca435790747461c"}}