{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TP5DHD5YM6D2JGCMLN6Z33SLGI","short_pith_number":"pith:TP5DHD5Y","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"},"canonical_sha256":"9bfa338fb86787a4984c5b7d9dee4b32026eb4ab63f2f9c289f6dfbf2caada86","source":{"kind":"arxiv","id":"2110.09369","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.09369","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2110.09369v2","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.09369","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"TP5DHD5YM6D2","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"pith_short_16","alias_value":"TP5DHD5YM6D2JGCM","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"pith_short_8","alias_value":"TP5DHD5Y","created_at":"2026-07-05T05:39:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TP5DHD5YM6D2JGCMLN6Z33SLGI","target":"record","payload":{"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"},"canonical_sha256":"9bfa338fb86787a4984c5b7d9dee4b32026eb4ab63f2f9c289f6dfbf2caada86","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"},"source_kind":"arxiv","source_id":"2110.09369","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-07-05T05:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ts6r7aYPnV7CdoZpGDmZmMWQoioPaeRyHoMCzOwOdFVe+aVSh7J3J/DXqAS4Jf4q8B2TWriEM8cCwVE15r5YCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:32:52.955779Z"},"content_sha256":"286bb20be2f7a2e1f2fda9b68935bbfe959f2b67ae11e3dd857f8527578ed937","schema_version":"1.0","event_id":"sha256:286bb20be2f7a2e1f2fda9b68935bbfe959f2b67ae11e3dd857f8527578ed937"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TP5DHD5YM6D2JGCMLN6Z33SLGI","target":"graph","payload":{"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"},"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-07-05T05:39:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k61qTxKVHmLwMM8ks91CcSOktniX/FnPOmCKgrvHc2UJohsKxaiBvR0uBlPQX8QbHzRQs/DbFBskftksDpbYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:32:52.956153Z"},"content_sha256":"fe7118a05ab4a6a7f897bdd1ba96509e69914c769432cc0b896f307f186c4e70","schema_version":"1.0","event_id":"sha256:fe7118a05ab4a6a7f897bdd1ba96509e69914c769432cc0b896f307f186c4e70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/bundle.json","state_url":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/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-07-09T04:32:52Z","links":{"resolver":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI","bundle":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/bundle.json","state":"https://pith.science/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TP5DHD5YM6D2JGCMLN6Z33SLGI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TP5DHD5YM6D2JGCMLN6Z33SLGI","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":"499d376d5296c9be0f1bb8ec5e7fb144942bd528ab7ad352ea9e2caee707bc37","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-10-18T14:53:45Z","title_canon_sha256":"7ba418401a9d7f1b589a6d9ede14c89b1829c86ff95c0ed9a767e600800e95a7"},"schema_version":"1.0","source":{"id":"2110.09369","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.09369","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"arxiv_version","alias_value":"2110.09369v2","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.09369","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"pith_short_12","alias_value":"TP5DHD5YM6D2","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"pith_short_16","alias_value":"TP5DHD5YM6D2JGCM","created_at":"2026-07-05T05:39:11Z"},{"alias_kind":"pith_short_8","alias_value":"TP5DHD5Y","created_at":"2026-07-05T05:39:11Z"}],"graph_snapshots":[{"event_id":"sha256:fe7118a05ab4a6a7f897bdd1ba96509e69914c769432cc0b896f307f186c4e70","target":"graph","created_at":"2026-07-05T05:39:11Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2110.09369/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"D\\'aniel Marx, Govind S. Sankar, Philipp Schepper","cross_cats":["cs.DS"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-10-18T14:53:45Z","title":"Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.09369","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:286bb20be2f7a2e1f2fda9b68935bbfe959f2b67ae11e3dd857f8527578ed937","target":"record","created_at":"2026-07-05T05:39:11Z","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":"499d376d5296c9be0f1bb8ec5e7fb144942bd528ab7ad352ea9e2caee707bc37","cross_cats_sorted":["cs.DS"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-10-18T14:53:45Z","title_canon_sha256":"7ba418401a9d7f1b589a6d9ede14c89b1829c86ff95c0ed9a767e600800e95a7"},"schema_version":"1.0","source":{"id":"2110.09369","kind":"arxiv","version":2}},"canonical_sha256":"9bfa338fb86787a4984c5b7d9dee4b32026eb4ab63f2f9c289f6dfbf2caada86","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bfa338fb86787a4984c5b7d9dee4b32026eb4ab63f2f9c289f6dfbf2caada86","first_computed_at":"2026-07-05T05:39:11.126749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:39:11.126749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aN9XevIamghsPkc4N7aInSzi4Fe6Jr68ek77QEnl/tk8WBhVvnDePVNGOp4oRqrNq1ZZIG86NvBUAcH6PkQ8CA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:39:11.127291Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.09369","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:286bb20be2f7a2e1f2fda9b68935bbfe959f2b67ae11e3dd857f8527578ed937","sha256:fe7118a05ab4a6a7f897bdd1ba96509e69914c769432cc0b896f307f186c4e70"],"state_sha256":"d4ab3f6c7cc978947354f4f09416cf0dda2809ba1361e468db9b96c96aaeb8dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jilOQ4QeKKPSEqFrsBYssJcZhMIdpK/78WXAOqza6+Hu+S7Dikr5PGDa1XGqOqrOg2R8Tt4Xn4gw6DYNenGeBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T04:32:52.958245Z","bundle_sha256":"690186cbdfd294ad9539d0b1a8267fc7f5439c9669c3baf79ba443cd427edfa8"}}