{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TP5DHD5YM6D2JGCMLN6Z33SLGI","short_pith_number":"pith:TP5DHD5Y","schema_version":"1.0","canonical_sha256":"9bfa338fb86787a4984c5b7d9dee4b32026eb4ab63f2f9c289f6dfbf2caada86","source":{"kind":"arxiv","id":"2110.09369","version":2},"attestation_state":"computed","paper":{"title":"Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"D\\'aniel Marx, Govind S. Sankar, Philipp Schepper","submitted_at":"2021-10-18T14:53:45Z","abstract_excerpt":"In the general AntiFactor problem, a graph $G$ is given with a set $X_v\\subseteq \\mathbb{N}$ of forbidden degrees for every vertex $v$ and the task is to find a set $S$ of edges such that the degree of $v$ in $S$ is not in the set $X_v$. Standard techniques (dynamic programming + fast convolution) can be used to show that if $M$ is the largest forbidden degree, then the problem can be solved in time $(M+2)^k\\cdot n^{O(1)}$ if a tree decomposition of width $k$ is given. However, significantly faster algorithms are possible if the sets $X_v$ are sparse: our main algorithmic result shows that if "},"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":"2110.09369","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-10-18T14:53:45Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7ba418401a9d7f1b589a6d9ede14c89b1829c86ff95c0ed9a767e600800e95a7","abstract_canon_sha256":"499d376d5296c9be0f1bb8ec5e7fb144942bd528ab7ad352ea9e2caee707bc37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:39:11.127291Z","signature_b64":"aN9XevIamghsPkc4N7aInSzi4Fe6Jr68ek77QEnl/tk8WBhVvnDePVNGOp4oRqrNq1ZZIG86NvBUAcH6PkQ8CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bfa338fb86787a4984c5b7d9dee4b32026eb4ab63f2f9c289f6dfbf2caada86","last_reissued_at":"2026-07-05T05:39:11.126749Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:39:11.126749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"D\\'aniel Marx, Govind S. Sankar, Philipp Schepper","submitted_at":"2021-10-18T14:53:45Z","abstract_excerpt":"In the general AntiFactor problem, a graph $G$ is given with a set $X_v\\subseteq \\mathbb{N}$ of forbidden degrees for every vertex $v$ and the task is to find a set $S$ of edges such that the degree of $v$ in $S$ is not in the set $X_v$. Standard techniques (dynamic programming + fast convolution) can be used to show that if $M$ is the largest forbidden degree, then the problem can be solved in time $(M+2)^k\\cdot n^{O(1)}$ if a tree decomposition of width $k$ is given. However, significantly faster algorithms are possible if the sets $X_v$ are sparse: our main algorithmic result shows that if "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.09369","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2110.09369/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2110.09369","created_at":"2026-07-05T05:39:11.126841+00:00"},{"alias_kind":"arxiv_version","alias_value":"2110.09369v2","created_at":"2026-07-05T05:39:11.126841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.09369","created_at":"2026-07-05T05:39:11.126841+00:00"},{"alias_kind":"pith_short_12","alias_value":"TP5DHD5YM6D2","created_at":"2026-07-05T05:39:11.126841+00:00"},{"alias_kind":"pith_short_16","alias_value":"TP5DHD5YM6D2JGCM","created_at":"2026-07-05T05:39:11.126841+00:00"},{"alias_kind":"pith_short_8","alias_value":"TP5DHD5Y","created_at":"2026-07-05T05:39:11.126841+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/TP5DHD5YM6D2JGCMLN6Z33SLGI","json":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI.json","graph_json":"https://pith.science/api/pith-number/TP5DHD5YM6D2JGCMLN6Z33SLGI/graph.json","events_json":"https://pith.science/api/pith-number/TP5DHD5YM6D2JGCMLN6Z33SLGI/events.json","paper":"https://pith.science/paper/TP5DHD5Y"},"agent_actions":{"view_html":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI","download_json":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI.json","view_paper":"https://pith.science/paper/TP5DHD5Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2110.09369&json=true","fetch_graph":"https://pith.science/api/pith-number/TP5DHD5YM6D2JGCMLN6Z33SLGI/graph.json","fetch_events":"https://pith.science/api/pith-number/TP5DHD5YM6D2JGCMLN6Z33SLGI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/action/storage_attestation","attest_author":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/action/author_attestation","sign_citation":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/action/citation_signature","submit_replication":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/action/replication_record"}},"created_at":"2026-07-05T05:39:11.126841+00:00","updated_at":"2026-07-05T05:39:11.126841+00:00"}