{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:AHU65TF6FU2N4MUANLZZODIN5H","short_pith_number":"pith:AHU65TF6","schema_version":"1.0","canonical_sha256":"01e9eeccbe2d34de32806af3970d0de9eb94501338dbe5e613c92e5a4696e2a0","source":{"kind":"arxiv","id":"1312.0723","version":2},"attestation_state":"computed","paper":{"title":"The Input/Output Complexity of Triangle Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Rasmus Pagh","submitted_at":"2013-12-03T07:54:00Z","abstract_excerpt":"We consider the well-known problem of enumerating all triangles of an undirected graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges, $M<E$ the size of internal memory, and $B$ the block size. The best results obtained previously are sort$(E^{3/2})$ I/Os (Dementiev, PhD thesis 2006) and $O(E^2/(MB))$ I/Os (Hu et al., SIGMOD 2013), where sort$(n)$ denotes the number of I/Os for sorting $n$ items. We improve the I/O complexity to $O(E^{3/2}/(\\sqrt{M} B))$ expected I/Os, which improves the previous bounds by a factor $\\min(\\sqrt{E/M"},"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":"1312.0723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-03T07:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"0e81fe5ce587c1d9eac8742efde838dc5e02ca1edba93fe81f7e57752e4d17d1","abstract_canon_sha256":"89d3ea86a4c2eada9c7dd1cec44f4a763ffcc9f76e0142919d21572c22e02007"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:49.658269Z","signature_b64":"3G2SJHSh2Xh1ywSF58fOEdnOK1Qd6hUzzKGOTKfc5nezm2r+phlLljCk9sifbAjg32pZEuGJqRcB3DZtck7DAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01e9eeccbe2d34de32806af3970d0de9eb94501338dbe5e613c92e5a4696e2a0","last_reissued_at":"2026-05-18T02:55:49.657821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:49.657821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Input/Output Complexity of Triangle Enumeration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Francesco Silvestri, Rasmus Pagh","submitted_at":"2013-12-03T07:54:00Z","abstract_excerpt":"We consider the well-known problem of enumerating all triangles of an undirected graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let $E$ be the number of edges, $M<E$ the size of internal memory, and $B$ the block size. The best results obtained previously are sort$(E^{3/2})$ I/Os (Dementiev, PhD thesis 2006) and $O(E^2/(MB))$ I/Os (Hu et al., SIGMOD 2013), where sort$(n)$ denotes the number of I/Os for sorting $n$ items. We improve the I/O complexity to $O(E^{3/2}/(\\sqrt{M} B))$ expected I/Os, which improves the previous bounds by a factor $\\min(\\sqrt{E/M"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0723","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":"1312.0723","created_at":"2026-05-18T02:55:49.657886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0723v2","created_at":"2026-05-18T02:55:49.657886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0723","created_at":"2026-05-18T02:55:49.657886+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHU65TF6FU2N","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHU65TF6FU2N4MUA","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHU65TF6","created_at":"2026-05-18T12:27:38.830355+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/AHU65TF6FU2N4MUANLZZODIN5H","json":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H.json","graph_json":"https://pith.science/api/pith-number/AHU65TF6FU2N4MUANLZZODIN5H/graph.json","events_json":"https://pith.science/api/pith-number/AHU65TF6FU2N4MUANLZZODIN5H/events.json","paper":"https://pith.science/paper/AHU65TF6"},"agent_actions":{"view_html":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H","download_json":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H.json","view_paper":"https://pith.science/paper/AHU65TF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0723&json=true","fetch_graph":"https://pith.science/api/pith-number/AHU65TF6FU2N4MUANLZZODIN5H/graph.json","fetch_events":"https://pith.science/api/pith-number/AHU65TF6FU2N4MUANLZZODIN5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/action/storage_attestation","attest_author":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/action/author_attestation","sign_citation":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/action/citation_signature","submit_replication":"https://pith.science/pith/AHU65TF6FU2N4MUANLZZODIN5H/action/replication_record"}},"created_at":"2026-05-18T02:55:49.657886+00:00","updated_at":"2026-05-18T02:55:49.657886+00:00"}