{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:LR26QDRYZOW53SBCX6CRTW53O3","short_pith_number":"pith:LR26QDRY","schema_version":"1.0","canonical_sha256":"5c75e80e38cbadddc822bf8519dbbb76de64b100287488efced1ae3922a6dc75","source":{"kind":"arxiv","id":"1407.1116","version":1},"attestation_state":"computed","paper":{"title":"Why do simple algorithms for triangle enumeration work in the real world?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alyson G. Wilson, C. Seshadhri, Cynthia A. Phillips, Daniel J. Nordman, Jonathan W. Berry, Luke A. Fostvedt","submitted_at":"2014-07-04T03:07:54Z","abstract_excerpt":"Listing all triangles is a fundamental graph operation. Triangles can have important interpretations in real-world graphs, especially social and other interaction networks. Despite the lack of provably efficient (linear, or slightly super-linear) worst-case algorithms for this problem, practitioners run simple, efficient heuristics to find all triangles in graphs with millions of vertices. How are these heuristics exploiting the structure of these special graphs to provide major speedups in running time?\n  We study one of the most prevalent algorithms used by practitioners. A trivial algorithm"},"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":"1407.1116","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-04T03:07:54Z","cross_cats_sorted":["cs.DM","cs.DS","physics.soc-ph"],"title_canon_sha256":"1a82bac48d1bf4b9194a2ae91b1f17bbccce5018aa37abe90c250a88ea392f1b","abstract_canon_sha256":"8033b7be38451158030c4a18f432784ccfc45e3a3d6edffaec9846a018d6540a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:18.706606Z","signature_b64":"G+bcMoy5UvGuoORJbzZTh7zVKhp7GhvUET/frqOWqgqODPtTdl1gbRsgi9oDoIkf5YIojBA4uAhr5j3MLyzRDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c75e80e38cbadddc822bf8519dbbb76de64b100287488efced1ae3922a6dc75","last_reissued_at":"2026-05-18T02:48:18.706113Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:18.706113Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Why do simple algorithms for triangle enumeration work in the real world?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Alyson G. Wilson, C. Seshadhri, Cynthia A. Phillips, Daniel J. Nordman, Jonathan W. Berry, Luke A. Fostvedt","submitted_at":"2014-07-04T03:07:54Z","abstract_excerpt":"Listing all triangles is a fundamental graph operation. Triangles can have important interpretations in real-world graphs, especially social and other interaction networks. Despite the lack of provably efficient (linear, or slightly super-linear) worst-case algorithms for this problem, practitioners run simple, efficient heuristics to find all triangles in graphs with millions of vertices. How are these heuristics exploiting the structure of these special graphs to provide major speedups in running time?\n  We study one of the most prevalent algorithms used by practitioners. A trivial algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1116","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":""},"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":"1407.1116","created_at":"2026-05-18T02:48:18.706185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1116v1","created_at":"2026-05-18T02:48:18.706185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1116","created_at":"2026-05-18T02:48:18.706185+00:00"},{"alias_kind":"pith_short_12","alias_value":"LR26QDRYZOW5","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"LR26QDRYZOW53SBC","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"LR26QDRY","created_at":"2026-05-18T12:28:38.356838+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/LR26QDRYZOW53SBCX6CRTW53O3","json":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3.json","graph_json":"https://pith.science/api/pith-number/LR26QDRYZOW53SBCX6CRTW53O3/graph.json","events_json":"https://pith.science/api/pith-number/LR26QDRYZOW53SBCX6CRTW53O3/events.json","paper":"https://pith.science/paper/LR26QDRY"},"agent_actions":{"view_html":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3","download_json":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3.json","view_paper":"https://pith.science/paper/LR26QDRY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1116&json=true","fetch_graph":"https://pith.science/api/pith-number/LR26QDRYZOW53SBCX6CRTW53O3/graph.json","fetch_events":"https://pith.science/api/pith-number/LR26QDRYZOW53SBCX6CRTW53O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3/action/storage_attestation","attest_author":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3/action/author_attestation","sign_citation":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3/action/citation_signature","submit_replication":"https://pith.science/pith/LR26QDRYZOW53SBCX6CRTW53O3/action/replication_record"}},"created_at":"2026-05-18T02:48:18.706185+00:00","updated_at":"2026-05-18T02:48:18.706185+00:00"}