{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:WIKK6TQZZ6QQ2GKTGGKPRMLQUG","short_pith_number":"pith:WIKK6TQZ","schema_version":"1.0","canonical_sha256":"b214af4e19cfa10d19533194f8b170a199bc1c2092b3a653bdc438b34c8d0e49","source":{"kind":"arxiv","id":"2403.02997","version":1},"attestation_state":"computed","paper":{"title":"Cover Edge-Based Novel Triangle Counting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","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","submitted_at":"2024-03-05T14:24:48Z","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"},"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":"2403.02997","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2024-03-05T14:24:48Z","cross_cats_sorted":[],"title_canon_sha256":"78b4b2cdb8d9f9d84aadc18dc3778bda1fa99c160194791f98b43e1d7fce48c3","abstract_canon_sha256":"532be768d40bbc18c3a58cb631a814303f806f33518cbea8d08f3283712f0d37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:25.297340Z","signature_b64":"zmL4qjZUOjvH8s8bTpE2w7pYV4+q50ud2gW0aekhYZsk96xV4LiwqIPtwa5MKeqGf13uxN8mNKyHTXrJhK1jCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b214af4e19cfa10d19533194f8b170a199bc1c2092b3a653bdc438b34c8d0e49","last_reissued_at":"2026-07-05T07:52:25.296958Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:25.296958Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cover Edge-Based Novel Triangle Counting","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","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","submitted_at":"2024-03-05T14:24:48Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.02997","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.02997/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2403.02997","created_at":"2026-07-05T07:52:25.297015+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.02997v1","created_at":"2026-07-05T07:52:25.297015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.02997","created_at":"2026-07-05T07:52:25.297015+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIKK6TQZZ6QQ","created_at":"2026-07-05T07:52:25.297015+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIKK6TQZZ6QQ2GKT","created_at":"2026-07-05T07:52:25.297015+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIKK6TQZ","created_at":"2026-07-05T07:52:25.297015+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/WIKK6TQZZ6QQ2GKTGGKPRMLQUG","json":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG.json","graph_json":"https://pith.science/api/pith-number/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/graph.json","events_json":"https://pith.science/api/pith-number/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/events.json","paper":"https://pith.science/paper/WIKK6TQZ"},"agent_actions":{"view_html":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG","download_json":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG.json","view_paper":"https://pith.science/paper/WIKK6TQZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.02997&json=true","fetch_graph":"https://pith.science/api/pith-number/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/graph.json","fetch_events":"https://pith.science/api/pith-number/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/action/storage_attestation","attest_author":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/action/author_attestation","sign_citation":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/action/citation_signature","submit_replication":"https://pith.science/pith/WIKK6TQZZ6QQ2GKTGGKPRMLQUG/action/replication_record"}},"created_at":"2026-07-05T07:52:25.297015+00:00","updated_at":"2026-07-05T07:52:25.297015+00:00"}