{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ","short_pith_number":"pith:KKIZKJ6Q","canonical_record":{"source":{"id":"1309.5009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-19T14:58:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8c6bb465577d747f52f804bd8ccb82330379f45afe40264aa6584f3a650bafbc","abstract_canon_sha256":"0a3c9ec77bc61886f9f41dd953665907d92733af8e64649aa55da012087a21d0"},"schema_version":"1.0"},"canonical_sha256":"52919527d04fc14ab5d7d1529d2abe5c15b22f60bf1f80ff1b96f535761996e4","source":{"kind":"arxiv","id":"1309.5009","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5009","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5009v2","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5009","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"KKIZKJ6QJ7AU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KKIZKJ6QJ7AUVNOX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KKIZKJ6Q","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ","target":"record","payload":{"canonical_record":{"source":{"id":"1309.5009","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-19T14:58:51Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8c6bb465577d747f52f804bd8ccb82330379f45afe40264aa6584f3a650bafbc","abstract_canon_sha256":"0a3c9ec77bc61886f9f41dd953665907d92733af8e64649aa55da012087a21d0"},"schema_version":"1.0"},"canonical_sha256":"52919527d04fc14ab5d7d1529d2abe5c15b22f60bf1f80ff1b96f535761996e4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:12.456804Z","signature_b64":"jbL30uzjNl5wwv1rw+cemYp1EHuKGhZWgOISrxPi8lmAQ1TTQ8py8etIwg6OJB/ad7x9E1DHcF6U1Y5bPsbvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"52919527d04fc14ab5d7d1529d2abe5c15b22f60bf1f80ff1b96f535761996e4","last_reissued_at":"2026-05-18T03:11:12.456152Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:12.456152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1309.5009","source_version":2,"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:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c6b4srkwmY12tzvZY5uS3fAP0BTB7MPOLolq/ypLQIbDELLm7cM4zWIcdoLX/c9XZnoTdlEull+AkyNaMdNcAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:43:01.463550Z"},"content_sha256":"ee25e7c7548d298f51f24b5bb86e0b4caf8eb3fd30fa7153bd721cff0ac000f8","schema_version":"1.0","event_id":"sha256:ee25e7c7548d298f51f24b5bb86e0b4caf8eb3fd30fa7153bd721cff0ac000f8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parameterized Enumeration with Ordering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Arne Meier, Fr\\'ed\\'eric Olive, Heribert Vollmer, Julian-Steffen M\\\"uller, Nadia Creignou, Ra\\\"ida Ktari","submitted_at":"2013-09-19T14:58:51Z","abstract_excerpt":"The classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of efficiently solvable parameterized enumeration problems. In this paper we focus on ordered enumeration and will show how to obtain Delay-FPT and Total-FPT enumeration algorithms for several important problems. We propose a generic algorithmic strategy, combining well-known principles stemming from both parameterized algorithmics and enumeration, which shows that, under certain preconditions, the existence of a so-called neighbourhood function among the solutions imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5009","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"},"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:11:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"25lSHVzia86F9Xnz3PWFAqexZ+9YyKsv1SumDyQHTCS7cRkn1IxWAvmu5+J1pbHP0Sb/AZBlgE5jcHl0uygsDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:43:01.463912Z"},"content_sha256":"3402419ec26e2edc99ba460167ab720c9d5a93fe582c1b399710d254aef7a9cf","schema_version":"1.0","event_id":"sha256:3402419ec26e2edc99ba460167ab720c9d5a93fe582c1b399710d254aef7a9cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ/bundle.json","state_url":"https://pith.science/pith/KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ/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-06-01T06:43:01Z","links":{"resolver":"https://pith.science/pith/KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ","bundle":"https://pith.science/pith/KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ/bundle.json","state":"https://pith.science/pith/KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:KKIZKJ6QJ7AUVNOX2FJJ2KV6LQ","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":"0a3c9ec77bc61886f9f41dd953665907d92733af8e64649aa55da012087a21d0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-19T14:58:51Z","title_canon_sha256":"8c6bb465577d747f52f804bd8ccb82330379f45afe40264aa6584f3a650bafbc"},"schema_version":"1.0","source":{"id":"1309.5009","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5009","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5009v2","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5009","created_at":"2026-05-18T03:11:12Z"},{"alias_kind":"pith_short_12","alias_value":"KKIZKJ6QJ7AU","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"KKIZKJ6QJ7AUVNOX","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"KKIZKJ6Q","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:3402419ec26e2edc99ba460167ab720c9d5a93fe582c1b399710d254aef7a9cf","target":"graph","created_at":"2026-05-18T03:11:12Z","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 classes Delay-FPT and Total-FPT recently have been introduced into parameterized complexity in order to capture the notion of efficiently solvable parameterized enumeration problems. In this paper we focus on ordered enumeration and will show how to obtain Delay-FPT and Total-FPT enumeration algorithms for several important problems. We propose a generic algorithmic strategy, combining well-known principles stemming from both parameterized algorithmics and enumeration, which shows that, under certain preconditions, the existence of a so-called neighbourhood function among the solutions imp","authors_text":"Arne Meier, Fr\\'ed\\'eric Olive, Heribert Vollmer, Julian-Steffen M\\\"uller, Nadia Creignou, Ra\\\"ida Ktari","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-19T14:58:51Z","title":"Parameterized Enumeration with Ordering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5009","kind":"arxiv","version":2},"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:ee25e7c7548d298f51f24b5bb86e0b4caf8eb3fd30fa7153bd721cff0ac000f8","target":"record","created_at":"2026-05-18T03:11:12Z","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":"0a3c9ec77bc61886f9f41dd953665907d92733af8e64649aa55da012087a21d0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-09-19T14:58:51Z","title_canon_sha256":"8c6bb465577d747f52f804bd8ccb82330379f45afe40264aa6584f3a650bafbc"},"schema_version":"1.0","source":{"id":"1309.5009","kind":"arxiv","version":2}},"canonical_sha256":"52919527d04fc14ab5d7d1529d2abe5c15b22f60bf1f80ff1b96f535761996e4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"52919527d04fc14ab5d7d1529d2abe5c15b22f60bf1f80ff1b96f535761996e4","first_computed_at":"2026-05-18T03:11:12.456152Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:12.456152Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jbL30uzjNl5wwv1rw+cemYp1EHuKGhZWgOISrxPi8lmAQ1TTQ8py8etIwg6OJB/ad7x9E1DHcF6U1Y5bPsbvBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:12.456804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5009","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee25e7c7548d298f51f24b5bb86e0b4caf8eb3fd30fa7153bd721cff0ac000f8","sha256:3402419ec26e2edc99ba460167ab720c9d5a93fe582c1b399710d254aef7a9cf"],"state_sha256":"4621c2932d28259aa4984ac0ae352901bee21b9380198577a2886ebe47c3fa1f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5T3h4aGNvVV86nxJO/3uzYct+qimbfikpX+KFBb1EI/Zlfhp55cLvOQ14FhDxayk4qIBIZ25KqHubrl0y32KDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:43:01.466021Z","bundle_sha256":"a7e0c2ca0fc2b98de7a767dfc939e9b1d66d1dcde1139930baad779d83c28d05"}}