{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:XKOWCRVREWMYKWPRJJRLGB3RAJ","short_pith_number":"pith:XKOWCRVR","schema_version":"1.0","canonical_sha256":"ba9d6146b125998559f14a62b307710246cfded87a1be21d49e4e8271f19a36d","source":{"kind":"arxiv","id":"1507.07856","version":1},"attestation_state":"computed","paper":{"title":"A Classification of Connected f -factor Problems inside NP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"C.S. Rahul, N.S. Narayanaswamy","submitted_at":"2015-07-28T17:21:06Z","abstract_excerpt":"Given an undirected graph G = (V, E) with n vertices, and a function f : V -> N, we consider the problem of finding a connected f -factor in G. In this work we design an algorithm to check for the existence of a connected f -factor, for the case where f (v) >= n/g(n), for all v in V and g(n) is polylogarithmic in n. The running time of our algorithm is O(n^{2g(n)}. As a consequence of this algorithm we conclude that the complexity of connected f -factor for the case we consider is unlikely to be NP-Complete unless the Exponential Time Hypothesis (ETH) is false. Secondly, under the assumption o"},"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":"1507.07856","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-28T17:21:06Z","cross_cats_sorted":[],"title_canon_sha256":"b992965cd39bf1dd96cf608a2af5b21825f2fb9b89e04f10291f3a95c4ce1b18","abstract_canon_sha256":"1a466667da4adf005895c3dcea071d3d753432e90422b1c94829623dccd42417"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:11.755337Z","signature_b64":"FfIqt4ljsYU/AToO2M40UP1N3XE3Gq4I0DKnsqwy7L+M+jtYrmr26DqWVBw0INrl569j2/dbMY+LZUAwo5qtDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba9d6146b125998559f14a62b307710246cfded87a1be21d49e4e8271f19a36d","last_reissued_at":"2026-05-18T01:36:11.754813Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:11.754813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Classification of Connected f -factor Problems inside NP","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"C.S. Rahul, N.S. Narayanaswamy","submitted_at":"2015-07-28T17:21:06Z","abstract_excerpt":"Given an undirected graph G = (V, E) with n vertices, and a function f : V -> N, we consider the problem of finding a connected f -factor in G. In this work we design an algorithm to check for the existence of a connected f -factor, for the case where f (v) >= n/g(n), for all v in V and g(n) is polylogarithmic in n. The running time of our algorithm is O(n^{2g(n)}. As a consequence of this algorithm we conclude that the complexity of connected f -factor for the case we consider is unlikely to be NP-Complete unless the Exponential Time Hypothesis (ETH) is false. Secondly, under the assumption o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07856","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":"1507.07856","created_at":"2026-05-18T01:36:11.754882+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.07856v1","created_at":"2026-05-18T01:36:11.754882+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07856","created_at":"2026-05-18T01:36:11.754882+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKOWCRVREWMY","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKOWCRVREWMYKWPR","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKOWCRVR","created_at":"2026-05-18T12:29:50.041715+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/XKOWCRVREWMYKWPRJJRLGB3RAJ","json":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ.json","graph_json":"https://pith.science/api/pith-number/XKOWCRVREWMYKWPRJJRLGB3RAJ/graph.json","events_json":"https://pith.science/api/pith-number/XKOWCRVREWMYKWPRJJRLGB3RAJ/events.json","paper":"https://pith.science/paper/XKOWCRVR"},"agent_actions":{"view_html":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ","download_json":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ.json","view_paper":"https://pith.science/paper/XKOWCRVR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.07856&json=true","fetch_graph":"https://pith.science/api/pith-number/XKOWCRVREWMYKWPRJJRLGB3RAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/XKOWCRVREWMYKWPRJJRLGB3RAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/action/storage_attestation","attest_author":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/action/author_attestation","sign_citation":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/action/citation_signature","submit_replication":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/action/replication_record"}},"created_at":"2026-05-18T01:36:11.754882+00:00","updated_at":"2026-05-18T01:36:11.754882+00:00"}