{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:GEDG7KM2LUWUDXNB6V2P2ZKRFX","short_pith_number":"pith:GEDG7KM2","schema_version":"1.0","canonical_sha256":"31066fa99a5d2d41dda1f574fd65512deabe0e52ee16e8b37889a0a1dbed1d1c","source":{"kind":"arxiv","id":"1011.0468","version":1},"attestation_state":"computed","paper":{"title":"Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Gary L. Miller, Mihail N. Kolountzakis, Richard Peng","submitted_at":"2010-11-01T23:16:05Z","abstract_excerpt":"The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph models (e.g., exponential random graph model) and in important real world applications such as spam detection, uncovering of the hidden thematic structure of the Web and link recommendation. Counting triangles in graphs with millions and billions of edges requires algorithms which run fast, use small amount of space, provide accurate estimates of the number of triangles and preferably are parallelizable.\n  In this paper "},"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":"1011.0468","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-01T23:16:05Z","cross_cats_sorted":["cs.SI","physics.soc-ph"],"title_canon_sha256":"9cc66c02eec1207da2cdcc6a52741c2f8044005c5e9886b9df3c5df11d6d401a","abstract_canon_sha256":"df7cdeb5930d8307a26d635e116a5d79f40cee97dcc7406ef7c19015715868a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:04:53.887546Z","signature_b64":"pRKSlPI9cjH0UbLmUjDCDIuuM37cWCvZHTbaR4qHrPFx+rmNjJEV2shFTyc3S+1nCxe7KeiTETX0Zy+XtIEwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31066fa99a5d2d41dda1f574fd65512deabe0e52ee16e8b37889a0a1dbed1d1c","last_reissued_at":"2026-05-18T02:04:53.887114Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:04:53.887114Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","physics.soc-ph"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Gary L. Miller, Mihail N. Kolountzakis, Richard Peng","submitted_at":"2010-11-01T23:16:05Z","abstract_excerpt":"The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph models (e.g., exponential random graph model) and in important real world applications such as spam detection, uncovering of the hidden thematic structure of the Web and link recommendation. Counting triangles in graphs with millions and billions of edges requires algorithms which run fast, use small amount of space, provide accurate estimates of the number of triangles and preferably are parallelizable.\n  In this paper "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.0468","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":"1011.0468","created_at":"2026-05-18T02:04:53.887171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.0468v1","created_at":"2026-05-18T02:04:53.887171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.0468","created_at":"2026-05-18T02:04:53.887171+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEDG7KM2LUWU","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEDG7KM2LUWUDXNB","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEDG7KM2","created_at":"2026-05-18T12:26:07.630475+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/GEDG7KM2LUWUDXNB6V2P2ZKRFX","json":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX.json","graph_json":"https://pith.science/api/pith-number/GEDG7KM2LUWUDXNB6V2P2ZKRFX/graph.json","events_json":"https://pith.science/api/pith-number/GEDG7KM2LUWUDXNB6V2P2ZKRFX/events.json","paper":"https://pith.science/paper/GEDG7KM2"},"agent_actions":{"view_html":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX","download_json":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX.json","view_paper":"https://pith.science/paper/GEDG7KM2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.0468&json=true","fetch_graph":"https://pith.science/api/pith-number/GEDG7KM2LUWUDXNB6V2P2ZKRFX/graph.json","fetch_events":"https://pith.science/api/pith-number/GEDG7KM2LUWUDXNB6V2P2ZKRFX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX/action/storage_attestation","attest_author":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX/action/author_attestation","sign_citation":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX/action/citation_signature","submit_replication":"https://pith.science/pith/GEDG7KM2LUWUDXNB6V2P2ZKRFX/action/replication_record"}},"created_at":"2026-05-18T02:04:53.887171+00:00","updated_at":"2026-05-18T02:04:53.887171+00:00"}