{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2IKOYKZAKPIG6NRASX2BQFQZF4","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":"ae78d15a6f6290b2b77d4405abfafad8d336c1de1114471b257b1763bbdb0359","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-12-05T15:20:37Z","title_canon_sha256":"39b62ec7007822518bb9473d1629c514400d481db868b1b91bcf3953c9efb368"},"schema_version":"1.0","source":{"id":"1812.02037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.02037","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"arxiv_version","alias_value":"1812.02037v1","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.02037","created_at":"2026-05-17T23:58:59Z"},{"alias_kind":"pith_short_12","alias_value":"2IKOYKZAKPIG","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_16","alias_value":"2IKOYKZAKPIG6NRA","created_at":"2026-05-18T12:32:02Z"},{"alias_kind":"pith_short_8","alias_value":"2IKOYKZA","created_at":"2026-05-18T12:32:02Z"}],"graph_snapshots":[{"event_id":"sha256:27edfd9109e1c63e1c9997347d16fbe64d9d505f37fca22552e7b464c2735824","target":"graph","created_at":"2026-05-17T23:58:59Z","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":"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","authors_text":"C. S. Rahul, M. S. Ramanujan, N. S. Narayanaswamy, R. Ganian, S. Ordyniak","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-12-05T15:20:37Z","title":"On the Complexity Landscape of Connected f -Factor Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.02037","kind":"arxiv","version":1},"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:9800c0687e5655562873160cc1dd6f8eed63dea4d2c5661d09e6187f178df463","target":"record","created_at":"2026-05-17T23:58:59Z","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":"ae78d15a6f6290b2b77d4405abfafad8d336c1de1114471b257b1763bbdb0359","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2018-12-05T15:20:37Z","title_canon_sha256":"39b62ec7007822518bb9473d1629c514400d481db868b1b91bcf3953c9efb368"},"schema_version":"1.0","source":{"id":"1812.02037","kind":"arxiv","version":1}},"canonical_sha256":"d214ec2b2053d06f362095f41816192f20da7df1f97293c7e1d2901a7f7936c7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d214ec2b2053d06f362095f41816192f20da7df1f97293c7e1d2901a7f7936c7","first_computed_at":"2026-05-17T23:58:59.908207Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:59.908207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yf6kPt7LWfX0lbKsAFgp58Dal+L57v3k1Ze4RcuVx27nIFjIYzI9l3kQ8oRRTzigP77aZpm0r/NR1Vht2I/+AQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:59.908857Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.02037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9800c0687e5655562873160cc1dd6f8eed63dea4d2c5661d09e6187f178df463","sha256:27edfd9109e1c63e1c9997347d16fbe64d9d505f37fca22552e7b464c2735824"],"state_sha256":"b5fae44f201c784e2717a483fb68ef8226c96eb0411a10e375e9c983f54767d4"}