{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:XYEOPJUSOKKLOH6UXHVGZG7M2I","short_pith_number":"pith:XYEOPJUS","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"},"canonical_sha256":"be08e7a6927294b71fd4b9ea6c9becd217d596854505fbe3dcd69fdfa4492f64","source":{"kind":"arxiv","id":"1410.4876","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:XYEOPJUSOKKLOH6UXHVGZG7M2I","target":"record","payload":{"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"},"canonical_sha256":"be08e7a6927294b71fd4b9ea6c9becd217d596854505fbe3dcd69fdfa4492f64","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"},"source_kind":"arxiv","source_id":"1410.4876","source_version":2,"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:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"goopl1EyGuSuKWuhg8nfm3lfN6JuDvAl5tBrltz7M/Wty0OgZ2aMCz0W6597dgb3R1nJwL5sA2jc7LVhyu8hCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:37:09.302184Z"},"content_sha256":"b5254a80c09b9af22fed5f527915a58d856d0fd3e02f5580aac82605749e64db","schema_version":"1.0","event_id":"sha256:b5254a80c09b9af22fed5f527915a58d856d0fd3e02f5580aac82605749e64db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:XYEOPJUSOKKLOH6UXHVGZG7M2I","target":"graph","payload":{"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"},"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:38:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YRv3l9Kx4oe8XDAFllq0yHx+rQJyOtMNUX8dYsEwl5bXQmy8DJJSOl4VNrDqFTjec0T18HsUr2ydEAR34BfiBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T01:37:09.302940Z"},"content_sha256":"791a7c14e9811b1e55f9bb1a217b6477b95698a3920e62d277daaa500a8ee43b","schema_version":"1.0","event_id":"sha256:791a7c14e9811b1e55f9bb1a217b6477b95698a3920e62d277daaa500a8ee43b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/bundle.json","state_url":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/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-10T01:37:09Z","links":{"resolver":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I","bundle":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/bundle.json","state":"https://pith.science/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XYEOPJUSOKKLOH6UXHVGZG7M2I/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pngyXOhssjSz91Toeikiw1uJaHkEs3jWawLlm5HFPojQyCL8LFx5HnRlTYwNl3qLkxRu7q9+nbVFlJScENOCCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T01:37:09.308102Z","bundle_sha256":"d16427e0ff4062107e8406a9109a6feaa48a9a3d3eee2e226b94fbef7df99a78"}}