{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZGNMXGFJRCSSCLPYN65APBMXYD","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":"d652f90ec3baedea55690e0a0fe48885f2c9ba3d83696145de551c91b6cef854","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T16:20:34Z","title_canon_sha256":"f96432dd45cbf75c5a439fb59834de0e86a3d4b2c225dd4fbfe527a4e239ba37"},"schema_version":"1.0","source":{"id":"1401.0906","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.0906","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"arxiv_version","alias_value":"1401.0906v1","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0906","created_at":"2026-05-18T03:03:11Z"},{"alias_kind":"pith_short_12","alias_value":"ZGNMXGFJRCSS","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZGNMXGFJRCSSCLPY","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZGNMXGFJ","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:ee00074aee396926c95d9255c5b06435265fe0f640fb9f61f55d8a4591f3c6b3","target":"graph","created_at":"2026-05-18T03:03: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":"In this paper, a polynomial time algorithm for finding the set of all cyclic subsets in a graph is presented. The concept of cyclic subsets has already been introduced in an earlier paper. The algorithm finds cyclic subsets in a graph G by conjoining building block subsets of length three in V(G). We prove the correctness of this algorithm and present an asymptotic time complexity analysis of the algorithm's performance.","authors_text":"P. Clarke","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T16:20:34Z","title":"A Search Procedure for Cyclic Subsets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0906","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:cc8b1ec7df2d3effd6f2a9713b36ef8dde6c073da6a16bfa56cfcae96c054cff","target":"record","created_at":"2026-05-18T03:03: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":"d652f90ec3baedea55690e0a0fe48885f2c9ba3d83696145de551c91b6cef854","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-05T16:20:34Z","title_canon_sha256":"f96432dd45cbf75c5a439fb59834de0e86a3d4b2c225dd4fbfe527a4e239ba37"},"schema_version":"1.0","source":{"id":"1401.0906","kind":"arxiv","version":1}},"canonical_sha256":"c99acb98a988a5212df86fba078597c0eb6d36720b48d7cfcefd2ec60bd27efe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c99acb98a988a5212df86fba078597c0eb6d36720b48d7cfcefd2ec60bd27efe","first_computed_at":"2026-05-18T03:03:11.576696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:11.576696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bPXxI6UTzkxOJH4nny2L1/45Qi5k5EDl2n3rwkn+ZBgG982fNWow5sMr+/IlfXFkfjFltk2cEMkkY7GzPSIsAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:11.577356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.0906","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc8b1ec7df2d3effd6f2a9713b36ef8dde6c073da6a16bfa56cfcae96c054cff","sha256:ee00074aee396926c95d9255c5b06435265fe0f640fb9f61f55d8a4591f3c6b3"],"state_sha256":"794d310b503e8e5b53d87e61799bdb0b50c1e023fe46b0b1cca30fc169265544"}