{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:XYEOPJUSOKKLOH6UXHVGZG7M2I","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":"b802898639de48d5d89ab4dd57eb39adc3527cf4eab1e9b284ea44fa9fb4936d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-17T21:48:50Z","title_canon_sha256":"3b0b11bf0ca04297a6f9c890ce231c2e8e206b7a5c5a557aa60ca10f2bdb3280"},"schema_version":"1.0","source":{"id":"1410.4876","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4876","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4876v2","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4876","created_at":"2026-05-18T01:38:54Z"},{"alias_kind":"pith_short_12","alias_value":"XYEOPJUSOKKL","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"XYEOPJUSOKKLOH6U","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"XYEOPJUS","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:791a7c14e9811b1e55f9bb1a217b6477b95698a3920e62d277daaa500a8ee43b","target":"graph","created_at":"2026-05-18T01:38:54Z","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 a finite undirected simple graph, a chordless cycle is an induced subgraph which is a cycle. We propose a GPU parallel algorithm for enumerating all chordless cycles of such a graph. The algorithm, implemented in OpenCL, is based on a previous sequential algorithm developed by the current authors for the same problem. It uses a more compact data structure for solution representation which is suitable for the memory-size limitation of a GPU. Moreover, for graphs with a sufficiently large amount of chordless cycles, the algorithm presents a significant improvement in execution time that outpe","authors_text":"Diane Castonguay, Elis\\^angela Silva Dias, Hugo A. D. do Nascimento, Humberto Longo, Walid Abdala Rfaei Jradi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-17T21:48:50Z","title":"A GPU-based parallel algorithm for enumerating all chordless cycles in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4876","kind":"arxiv","version":2},"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:b5254a80c09b9af22fed5f527915a58d856d0fd3e02f5580aac82605749e64db","target":"record","created_at":"2026-05-18T01:38:54Z","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":"b802898639de48d5d89ab4dd57eb39adc3527cf4eab1e9b284ea44fa9fb4936d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-17T21:48:50Z","title_canon_sha256":"3b0b11bf0ca04297a6f9c890ce231c2e8e206b7a5c5a557aa60ca10f2bdb3280"},"schema_version":"1.0","source":{"id":"1410.4876","kind":"arxiv","version":2}},"canonical_sha256":"be08e7a6927294b71fd4b9ea6c9becd217d596854505fbe3dcd69fdfa4492f64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"be08e7a6927294b71fd4b9ea6c9becd217d596854505fbe3dcd69fdfa4492f64","first_computed_at":"2026-05-18T01:38:54.116373Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:38:54.116373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VxvY/Ee+GJL2nwdmSI5tFG6LL5VSwWyvvuT59FK/b6QEjJJYd4+8Rl0H4N+SEisSr4pnR3qFC8XahRNciWH1CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:38:54.117106Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4876","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5254a80c09b9af22fed5f527915a58d856d0fd3e02f5580aac82605749e64db","sha256:791a7c14e9811b1e55f9bb1a217b6477b95698a3920e62d277daaa500a8ee43b"],"state_sha256":"6227bbea00c89c82b663ba1afe74ee44b50a91174272e0ceac8eacf0854aa130"}