{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:WIKK6TQZZ6QQ2GKTGGKPRMLQUG","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":"532be768d40bbc18c3a58cb631a814303f806f33518cbea8d08f3283712f0d37","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-05T14:24:48Z","title_canon_sha256":"78b4b2cdb8d9f9d84aadc18dc3778bda1fa99c160194791f98b43e1d7fce48c3"},"schema_version":"1.0","source":{"id":"2403.02997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.02997","created_at":"2026-07-05T07:52:25Z"},{"alias_kind":"arxiv_version","alias_value":"2403.02997v1","created_at":"2026-07-05T07:52:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02997","created_at":"2026-07-05T07:52:25Z"},{"alias_kind":"pith_short_12","alias_value":"WIKK6TQZZ6QQ","created_at":"2026-07-05T07:52:25Z"},{"alias_kind":"pith_short_16","alias_value":"WIKK6TQZZ6QQ2GKT","created_at":"2026-07-05T07:52:25Z"},{"alias_kind":"pith_short_8","alias_value":"WIKK6TQZ","created_at":"2026-07-05T07:52:25Z"}],"graph_snapshots":[{"event_id":"sha256:a85af97a82747f6a320b623eb32f645172f186ed1149336428956e950e13b9b0","target":"graph","created_at":"2026-07-05T07:52:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.02997/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Listing and counting triangles in graphs is a key algorithmic kernel for network analyses, including community detection, clustering coefficients, k-trusses, and triangle centrality. In this paper, we propose the novel concept of a cover-edge set that can be used to find triangles more efficiently. Leveraging the breadth-first search (BFS) method, we can quickly generate a compact cover-edge set. Novel sequential and parallel triangle counting algorithms that employ cover-edge sets are presented. The novel sequential algorithm performs competitively with the fastest previous approaches on both","authors_text":"Ahmet Gundogdu, Anant Gupta, Anya Ganeshan, David A. Bader, Fuhuan Li, Jason Lew, Oliver Alvarado Rodriguez, Palina Pauliuchenka, Sai Sri Vastav Minnal, Valmik Nahata, ZhiHui Du","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-05T14:24:48Z","title":"Cover Edge-Based Novel Triangle Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02997","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:8ae1e11fed7c0db72843c06563f0a210c630c2aca5e3c610c29ffb63b28c0785","target":"record","created_at":"2026-07-05T07:52:25Z","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":"532be768d40bbc18c3a58cb631a814303f806f33518cbea8d08f3283712f0d37","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-05T14:24:48Z","title_canon_sha256":"78b4b2cdb8d9f9d84aadc18dc3778bda1fa99c160194791f98b43e1d7fce48c3"},"schema_version":"1.0","source":{"id":"2403.02997","kind":"arxiv","version":1}},"canonical_sha256":"b214af4e19cfa10d19533194f8b170a199bc1c2092b3a653bdc438b34c8d0e49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b214af4e19cfa10d19533194f8b170a199bc1c2092b3a653bdc438b34c8d0e49","first_computed_at":"2026-07-05T07:52:25.296958Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:52:25.296958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zmL4qjZUOjvH8s8bTpE2w7pYV4+q50ud2gW0aekhYZsk96xV4LiwqIPtwa5MKeqGf13uxN8mNKyHTXrJhK1jCw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:52:25.297340Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.02997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ae1e11fed7c0db72843c06563f0a210c630c2aca5e3c610c29ffb63b28c0785","sha256:a85af97a82747f6a320b623eb32f645172f186ed1149336428956e950e13b9b0"],"state_sha256":"f005dce8d2e5f6cd47e73b38f5903807ed7acc2311a273ff5737d844e4d815fe"}