{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XKOWCRVREWMYKWPRJJRLGB3RAJ","short_pith_number":"pith:XKOWCRVR","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"},"canonical_sha256":"ba9d6146b125998559f14a62b307710246cfded87a1be21d49e4e8271f19a36d","source":{"kind":"arxiv","id":"1507.07856","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07856","created_at":"2026-05-18T01:36:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07856v1","created_at":"2026-05-18T01:36:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07856","created_at":"2026-05-18T01:36:11Z"},{"alias_kind":"pith_short_12","alias_value":"XKOWCRVREWMY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XKOWCRVREWMYKWPR","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XKOWCRVR","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XKOWCRVREWMYKWPRJJRLGB3RAJ","target":"record","payload":{"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"},"canonical_sha256":"ba9d6146b125998559f14a62b307710246cfded87a1be21d49e4e8271f19a36d","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"},"source_kind":"arxiv","source_id":"1507.07856","source_version":1,"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-05-18T01:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D3/H5L64noCoiN4grFWE/51U6GZyYQlJ7DMZGthC0vhyHGx4XO2g3zWOXaOtrpY3Oosr9wygZnh7l3h99BGUCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:39:24.722076Z"},"content_sha256":"7a0afefb63721aa289c31d4c6ad29053293651d557a8a284cfedaa48cf3bfc6f","schema_version":"1.0","event_id":"sha256:7a0afefb63721aa289c31d4c6ad29053293651d557a8a284cfedaa48cf3bfc6f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XKOWCRVREWMYKWPRJJRLGB3RAJ","target":"graph","payload":{"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"},"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-05-18T01:36:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s5awGUcB/cVxMNQBdu+RpHPgIxUCOuKwNnA44jJ3XAb7CHD4/j2mn1fvQWFhG7KX88WxlNuw2wHlcBZZsmdXAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T22:39:24.722428Z"},"content_sha256":"6549b82c811d5a23b6b79eafa12e93f5f4ccc7a40987fe3cb9455df07bc94b24","schema_version":"1.0","event_id":"sha256:6549b82c811d5a23b6b79eafa12e93f5f4ccc7a40987fe3cb9455df07bc94b24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/bundle.json","state_url":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/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-06-26T22:39:24Z","links":{"resolver":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ","bundle":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/bundle.json","state":"https://pith.science/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XKOWCRVREWMYKWPRJJRLGB3RAJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XKOWCRVREWMYKWPRJJRLGB3RAJ","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":"1a466667da4adf005895c3dcea071d3d753432e90422b1c94829623dccd42417","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-28T17:21:06Z","title_canon_sha256":"b992965cd39bf1dd96cf608a2af5b21825f2fb9b89e04f10291f3a95c4ce1b18"},"schema_version":"1.0","source":{"id":"1507.07856","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.07856","created_at":"2026-05-18T01:36:11Z"},{"alias_kind":"arxiv_version","alias_value":"1507.07856v1","created_at":"2026-05-18T01:36:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.07856","created_at":"2026-05-18T01:36:11Z"},{"alias_kind":"pith_short_12","alias_value":"XKOWCRVREWMY","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XKOWCRVREWMYKWPR","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XKOWCRVR","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:6549b82c811d5a23b6b79eafa12e93f5f4ccc7a40987fe3cb9455df07bc94b24","target":"graph","created_at":"2026-05-18T01:36: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"},"paper":{"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","authors_text":"C.S. Rahul, N.S. Narayanaswamy","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-28T17:21:06Z","title":"A Classification of Connected f -factor Problems inside NP"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.07856","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:7a0afefb63721aa289c31d4c6ad29053293651d557a8a284cfedaa48cf3bfc6f","target":"record","created_at":"2026-05-18T01:36: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":"1a466667da4adf005895c3dcea071d3d753432e90422b1c94829623dccd42417","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-07-28T17:21:06Z","title_canon_sha256":"b992965cd39bf1dd96cf608a2af5b21825f2fb9b89e04f10291f3a95c4ce1b18"},"schema_version":"1.0","source":{"id":"1507.07856","kind":"arxiv","version":1}},"canonical_sha256":"ba9d6146b125998559f14a62b307710246cfded87a1be21d49e4e8271f19a36d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ba9d6146b125998559f14a62b307710246cfded87a1be21d49e4e8271f19a36d","first_computed_at":"2026-05-18T01:36:11.754813Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:11.754813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FfIqt4ljsYU/AToO2M40UP1N3XE3Gq4I0DKnsqwy7L+M+jtYrmr26DqWVBw0INrl569j2/dbMY+LZUAwo5qtDA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:11.755337Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.07856","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7a0afefb63721aa289c31d4c6ad29053293651d557a8a284cfedaa48cf3bfc6f","sha256:6549b82c811d5a23b6b79eafa12e93f5f4ccc7a40987fe3cb9455df07bc94b24"],"state_sha256":"28a16fd0f414b9c9e4d110e828f9cebc40217bf29d01627e34810f00d81c8c10"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"98HpBmhaaD93YjoyVBNbixQyW+AHlPXsT7Gs7cwGAJqDrixqFnb3Bh6mn2h2G2jZL9NOkr7FceFSNxAh53osDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T22:39:24.724124Z","bundle_sha256":"d11770caf0e0a2dea1bafda3035f29e24e7708c1cb73f52a1dabab7d806fe610"}}