{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:FBCASRLL2JS67LPDOGOFY4OWNR","short_pith_number":"pith:FBCASRLL","schema_version":"1.0","canonical_sha256":"284409456bd265efade3719c5c71d66c728ad897d4f3a9b7c7bc7913e18a61d8","source":{"kind":"arxiv","id":"2105.08980","version":1},"attestation_state":"computed","paper":{"title":"Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth","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-05-19T08:26:18Z","abstract_excerpt":"For the General Factor problem we are given an undirected graph $G$ and for each vertex $v\\in V(G)$ a finite set $B_v$ of non-negative integers. The task is to decide if there is a subset $S\\subseteq E(G)$ such that $deg_S(v)\\in B_v$ for all vertices $v$ of $G$. The maxgap of a finite integer set $B$ is the largest $d\\ge 0$ such that there is an $a\\ge 0$ with $[a,a+d+1]\\cap B=\\{a,a+d+1\\}$. Cornu\\'ejols (1988) showed that if the maxgap of all sets $B_v$ is at most 1, then the decision version of General Factor is poly-time solvable. Dudycz and Paluch (2018) extended this result for the minimiza"},"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":"2105.08980","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2021-05-19T08:26:18Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3f0dc93b4c018ba70c34ddd7d3076ad6d3e1b4c6dca890b85135bbfabb0746c2","abstract_canon_sha256":"53ef6acf17b7d2ba9cf6c235068f5ad51ae2085b87a4d92fe042e68b1ff6b35a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:23:41.658558Z","signature_b64":"6PqATs4H95V8FprL0eNKvyqTleRE7A8BvxIaxwDeoQqgaY2lPBVh01dpD/sDQ4oahKvxH4KKPeFTS9FX9REyCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"284409456bd265efade3719c5c71d66c728ad897d4f3a9b7c7bc7913e18a61d8","last_reissued_at":"2026-07-05T03:23:41.657987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:23:41.657987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degrees and Gaps: Tight Complexity Results of General Factor Problems Parameterized by Treewidth and Cutwidth","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-05-19T08:26:18Z","abstract_excerpt":"For the General Factor problem we are given an undirected graph $G$ and for each vertex $v\\in V(G)$ a finite set $B_v$ of non-negative integers. The task is to decide if there is a subset $S\\subseteq E(G)$ such that $deg_S(v)\\in B_v$ for all vertices $v$ of $G$. The maxgap of a finite integer set $B$ is the largest $d\\ge 0$ such that there is an $a\\ge 0$ with $[a,a+d+1]\\cap B=\\{a,a+d+1\\}$. Cornu\\'ejols (1988) showed that if the maxgap of all sets $B_v$ is at most 1, then the decision version of General Factor is poly-time solvable. Dudycz and Paluch (2018) extended this result for the minimiza"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.08980","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.08980/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":"2105.08980","created_at":"2026-07-05T03:23:41.658043+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.08980v1","created_at":"2026-07-05T03:23:41.658043+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.08980","created_at":"2026-07-05T03:23:41.658043+00:00"},{"alias_kind":"pith_short_12","alias_value":"FBCASRLL2JS6","created_at":"2026-07-05T03:23:41.658043+00:00"},{"alias_kind":"pith_short_16","alias_value":"FBCASRLL2JS67LPD","created_at":"2026-07-05T03:23:41.658043+00:00"},{"alias_kind":"pith_short_8","alias_value":"FBCASRLL","created_at":"2026-07-05T03:23:41.658043+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/FBCASRLL2JS67LPDOGOFY4OWNR","json":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR.json","graph_json":"https://pith.science/api/pith-number/FBCASRLL2JS67LPDOGOFY4OWNR/graph.json","events_json":"https://pith.science/api/pith-number/FBCASRLL2JS67LPDOGOFY4OWNR/events.json","paper":"https://pith.science/paper/FBCASRLL"},"agent_actions":{"view_html":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR","download_json":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR.json","view_paper":"https://pith.science/paper/FBCASRLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.08980&json=true","fetch_graph":"https://pith.science/api/pith-number/FBCASRLL2JS67LPDOGOFY4OWNR/graph.json","fetch_events":"https://pith.science/api/pith-number/FBCASRLL2JS67LPDOGOFY4OWNR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR/action/storage_attestation","attest_author":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR/action/author_attestation","sign_citation":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR/action/citation_signature","submit_replication":"https://pith.science/pith/FBCASRLL2JS67LPDOGOFY4OWNR/action/replication_record"}},"created_at":"2026-07-05T03:23:41.658043+00:00","updated_at":"2026-07-05T03:23:41.658043+00:00"}