{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:XYEOPJUSOKKLOH6UXHVGZG7M2I","short_pith_number":"pith:XYEOPJUS","schema_version":"1.0","canonical_sha256":"be08e7a6927294b71fd4b9ea6c9becd217d596854505fbe3dcd69fdfa4492f64","source":{"kind":"arxiv","id":"1410.4876","version":2},"attestation_state":"computed","paper":{"title":"A GPU-based parallel algorithm for enumerating all chordless cycles in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Diane Castonguay, Elis\\^angela Silva Dias, Hugo A. D. do Nascimento, Humberto Longo, Walid Abdala Rfaei Jradi","submitted_at":"2014-10-17T21:48:50Z","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"},"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":"1410.4876","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2014-10-17T21:48:50Z","cross_cats_sorted":[],"title_canon_sha256":"3b0b11bf0ca04297a6f9c890ce231c2e8e206b7a5c5a557aa60ca10f2bdb3280","abstract_canon_sha256":"b802898639de48d5d89ab4dd57eb39adc3527cf4eab1e9b284ea44fa9fb4936d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:38:54.117106Z","signature_b64":"VxvY/Ee+GJL2nwdmSI5tFG6LL5VSwWyvvuT59FK/b6QEjJJYd4+8Rl0H4N+SEisSr4pnR3qFC8XahRNciWH1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be08e7a6927294b71fd4b9ea6c9becd217d596854505fbe3dcd69fdfa4492f64","last_reissued_at":"2026-05-18T01:38:54.116373Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:38:54.116373Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A GPU-based parallel algorithm for enumerating all chordless cycles in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Diane Castonguay, Elis\\^angela Silva Dias, Hugo A. D. do Nascimento, Humberto Longo, Walid Abdala Rfaei Jradi","submitted_at":"2014-10-17T21:48:50Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4876","kind":"arxiv","version":2},"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":"1410.4876","created_at":"2026-05-18T01:38:54.116511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4876v2","created_at":"2026-05-18T01:38:54.116511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4876","created_at":"2026-05-18T01:38:54.116511+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYEOPJUSOKKL","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYEOPJUSOKKLOH6U","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYEOPJUS","created_at":"2026-05-18T12:28:57.508820+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/XYEOPJUSOKKLOH6UXHVGZG7M2I","json":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I.json","graph_json":"https://pith.science/api/pith-number/XYEOPJUSOKKLOH6UXHVGZG7M2I/graph.json","events_json":"https://pith.science/api/pith-number/XYEOPJUSOKKLOH6UXHVGZG7M2I/events.json","paper":"https://pith.science/paper/XYEOPJUS"},"agent_actions":{"view_html":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I","download_json":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I.json","view_paper":"https://pith.science/paper/XYEOPJUS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4876&json=true","fetch_graph":"https://pith.science/api/pith-number/XYEOPJUSOKKLOH6UXHVGZG7M2I/graph.json","fetch_events":"https://pith.science/api/pith-number/XYEOPJUSOKKLOH6UXHVGZG7M2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/action/storage_attestation","attest_author":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/action/author_attestation","sign_citation":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/action/citation_signature","submit_replication":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/action/replication_record"}},"created_at":"2026-05-18T01:38:54.116511+00:00","updated_at":"2026-05-18T01:38:54.116511+00:00"}