{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:57EOIOVOEWIB5FVP6WQV5IHNSC","short_pith_number":"pith:57EOIOVO","schema_version":"1.0","canonical_sha256":"efc8e43aae25901e96aff5a15ea0ed90847039c6acda3422db271fde42a2de4d","source":{"kind":"arxiv","id":"1501.06689","version":1},"attestation_state":"computed","paper":{"title":"General-Purpose Join Algorithms for Listing Triangles in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel Zinn","submitted_at":"2015-01-27T08:47:25Z","abstract_excerpt":"We investigate applying general-purpose join algorithms to the triangle listing problem in an out-of-core context. In particular, we focus on Leapfrog Triejoin (LFTJ) by Veldhuizen 2014, a recently proposed, worst-case optimal algorithm. We present \"boxing\": a novel, yet conceptually simple, approach for feeding input data to LFTJ. Our extensive analysis shows that this approach is I/O efficient, being worst-case optimal (in a certain sense). Furthermore, if input data is only a constant factor larger than the available memory, then a boxed LFTJ essentially maintains the CPU data-complexity of"},"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":"1501.06689","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2015-01-27T08:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"b8640b751a3c65e828f0bcc3ba1dd40783afaf99dda1dabf2bc79106283b8fc8","abstract_canon_sha256":"90b7afddfa152e52fbbf60eabf99ccfbf7df821b096b3ab95e30460eba67ece3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:39.344490Z","signature_b64":"sB+SPMrHzxH3xmS8D3SAzzZlq8/8zTZEadOT1uRLOR8ZoN7jBZM7zHvy1S662iom9taJO70FmgHg1jgWXYnJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"efc8e43aae25901e96aff5a15ea0ed90847039c6acda3422db271fde42a2de4d","last_reissued_at":"2026-05-18T02:28:39.343845Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:39.343845Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"General-Purpose Join Algorithms for Listing Triangles in Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Daniel Zinn","submitted_at":"2015-01-27T08:47:25Z","abstract_excerpt":"We investigate applying general-purpose join algorithms to the triangle listing problem in an out-of-core context. In particular, we focus on Leapfrog Triejoin (LFTJ) by Veldhuizen 2014, a recently proposed, worst-case optimal algorithm. We present \"boxing\": a novel, yet conceptually simple, approach for feeding input data to LFTJ. Our extensive analysis shows that this approach is I/O efficient, being worst-case optimal (in a certain sense). Furthermore, if input data is only a constant factor larger than the available memory, then a boxed LFTJ essentially maintains the CPU data-complexity of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.06689","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":"1501.06689","created_at":"2026-05-18T02:28:39.343941+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.06689v1","created_at":"2026-05-18T02:28:39.343941+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.06689","created_at":"2026-05-18T02:28:39.343941+00:00"},{"alias_kind":"pith_short_12","alias_value":"57EOIOVOEWIB","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"57EOIOVOEWIB5FVP","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"57EOIOVO","created_at":"2026-05-18T12:29:05.191682+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/57EOIOVOEWIB5FVP6WQV5IHNSC","json":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC.json","graph_json":"https://pith.science/api/pith-number/57EOIOVOEWIB5FVP6WQV5IHNSC/graph.json","events_json":"https://pith.science/api/pith-number/57EOIOVOEWIB5FVP6WQV5IHNSC/events.json","paper":"https://pith.science/paper/57EOIOVO"},"agent_actions":{"view_html":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC","download_json":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC.json","view_paper":"https://pith.science/paper/57EOIOVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.06689&json=true","fetch_graph":"https://pith.science/api/pith-number/57EOIOVOEWIB5FVP6WQV5IHNSC/graph.json","fetch_events":"https://pith.science/api/pith-number/57EOIOVOEWIB5FVP6WQV5IHNSC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC/action/storage_attestation","attest_author":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC/action/author_attestation","sign_citation":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC/action/citation_signature","submit_replication":"https://pith.science/pith/57EOIOVOEWIB5FVP6WQV5IHNSC/action/replication_record"}},"created_at":"2026-05-18T02:28:39.343941+00:00","updated_at":"2026-05-18T02:28:39.343941+00:00"}