{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2IKOYKZAKPIG6NRASX2BQFQZF4","short_pith_number":"pith:2IKOYKZA","schema_version":"1.0","canonical_sha256":"d214ec2b2053d06f362095f41816192f20da7df1f97293c7e1d2901a7f7936c7","source":{"kind":"arxiv","id":"1812.02037","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity Landscape of Connected f -Factor Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"C. S. Rahul, M. S. Ramanujan, N. S. Narayanaswamy, R. Ganian, S. Ordyniak","submitted_at":"2018-12-05T15:20:37Z","abstract_excerpt":"Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The subgraph H is called a connected f-factor if, in addition, H is connected. A classical result of Tutte(1954) is the polynomial time algorithm to check whether a given graph has a specified f-factor. However, checking for the presence of a connected f-factor is easily seen to generalize HAMILTONIAN CYCLE and hence is NP-complete. In fact, the CONNECTED f-FACTOR pro"},"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":"1812.02037","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-12-05T15:20:37Z","cross_cats_sorted":[],"title_canon_sha256":"39b62ec7007822518bb9473d1629c514400d481db868b1b91bcf3953c9efb368","abstract_canon_sha256":"ae78d15a6f6290b2b77d4405abfafad8d336c1de1114471b257b1763bbdb0359"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:59.908857Z","signature_b64":"yf6kPt7LWfX0lbKsAFgp58Dal+L57v3k1Ze4RcuVx27nIFjIYzI9l3kQ8oRRTzigP77aZpm0r/NR1Vht2I/+AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d214ec2b2053d06f362095f41816192f20da7df1f97293c7e1d2901a7f7936c7","last_reissued_at":"2026-05-17T23:58:59.908207Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:59.908207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity Landscape of Connected f -Factor Problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"C. S. Rahul, M. S. Ramanujan, N. S. Narayanaswamy, R. Ganian, S. Ordyniak","submitted_at":"2018-12-05T15:20:37Z","abstract_excerpt":"Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The subgraph H is called a connected f-factor if, in addition, H is connected. A classical result of Tutte(1954) is the polynomial time algorithm to check whether a given graph has a specified f-factor. However, checking for the presence of a connected f-factor is easily seen to generalize HAMILTONIAN CYCLE and hence is NP-complete. In fact, the CONNECTED f-FACTOR pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02037","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1812.02037","created_at":"2026-05-17T23:58:59.908322+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.02037v1","created_at":"2026-05-17T23:58:59.908322+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02037","created_at":"2026-05-17T23:58:59.908322+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IKOYKZAKPIG","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IKOYKZAKPIG6NRA","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IKOYKZA","created_at":"2026-05-18T12:32:02.567920+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/2IKOYKZAKPIG6NRASX2BQFQZF4","json":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4.json","graph_json":"https://pith.science/api/pith-number/2IKOYKZAKPIG6NRASX2BQFQZF4/graph.json","events_json":"https://pith.science/api/pith-number/2IKOYKZAKPIG6NRASX2BQFQZF4/events.json","paper":"https://pith.science/paper/2IKOYKZA"},"agent_actions":{"view_html":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4","download_json":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4.json","view_paper":"https://pith.science/paper/2IKOYKZA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.02037&json=true","fetch_graph":"https://pith.science/api/pith-number/2IKOYKZAKPIG6NRASX2BQFQZF4/graph.json","fetch_events":"https://pith.science/api/pith-number/2IKOYKZAKPIG6NRASX2BQFQZF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4/action/storage_attestation","attest_author":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4/action/author_attestation","sign_citation":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4/action/citation_signature","submit_replication":"https://pith.science/pith/2IKOYKZAKPIG6NRASX2BQFQZF4/action/replication_record"}},"created_at":"2026-05-17T23:58:59.908322+00:00","updated_at":"2026-05-17T23:58:59.908322+00:00"}