{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JVMJKZAQLYP5SLQC3N2K4LONW2","short_pith_number":"pith:JVMJKZAQ","schema_version":"1.0","canonical_sha256":"4d589564105e1fd92e02db74ae2dcdb68f812e4bc136e123887898014428ccbc","source":{"kind":"arxiv","id":"1301.5887","version":3},"attestation_state":"computed","paper":{"title":"Counting Triangles in Massive Graphs with MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Ali Pinar, Christine Task, C. Seshadhri, Tamara G. Kolda, Todd Plantenga","submitted_at":"2013-01-24T20:32:25Z","abstract_excerpt":"Graphs and networks are used to model interactions in a variety of contexts. There is a growing need to quickly assess the characteristics of a graph in order to understand its underlying structure. Some of the most useful metrics are triangle-based and give a measure of the connectedness of mutual friends. This is often summarized in terms of clustering coefficients, which measure the likelihood that two neighbors of a node are themselves connected. Computing these measures exactly for large-scale networks is prohibitively expensive in both memory and time. However, a recent wedge sampling al"},"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":"1301.5887","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2013-01-24T20:32:25Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"883bc20cab361f3095e898ab630524a7e440086889fb674814e1203409391a5c","abstract_canon_sha256":"16da30e205e01a910341c3cae61bd26557594161b74afe9144ce83c6344186a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:32:31.185440Z","signature_b64":"aIyaCR26mQjyXCiGrOXhLvqjALFf6Qc8tWRVOGwOC31yWM7xgPit13/eW/bbR4UKc5Dg7yYMU4f087S4MeYIDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d589564105e1fd92e02db74ae2dcdb68f812e4bc136e123887898014428ccbc","last_reissued_at":"2026-05-18T02:32:31.185029Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:32:31.185029Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Triangles in Massive Graphs with MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SI","authors_text":"Ali Pinar, Christine Task, C. Seshadhri, Tamara G. Kolda, Todd Plantenga","submitted_at":"2013-01-24T20:32:25Z","abstract_excerpt":"Graphs and networks are used to model interactions in a variety of contexts. There is a growing need to quickly assess the characteristics of a graph in order to understand its underlying structure. Some of the most useful metrics are triangle-based and give a measure of the connectedness of mutual friends. This is often summarized in terms of clustering coefficients, which measure the likelihood that two neighbors of a node are themselves connected. Computing these measures exactly for large-scale networks is prohibitively expensive in both memory and time. However, a recent wedge sampling al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.5887","kind":"arxiv","version":3},"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":"1301.5887","created_at":"2026-05-18T02:32:31.185087+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.5887v3","created_at":"2026-05-18T02:32:31.185087+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.5887","created_at":"2026-05-18T02:32:31.185087+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVMJKZAQLYP5","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVMJKZAQLYP5SLQC","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVMJKZAQ","created_at":"2026-05-18T12:27:49.015174+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/JVMJKZAQLYP5SLQC3N2K4LONW2","json":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2.json","graph_json":"https://pith.science/api/pith-number/JVMJKZAQLYP5SLQC3N2K4LONW2/graph.json","events_json":"https://pith.science/api/pith-number/JVMJKZAQLYP5SLQC3N2K4LONW2/events.json","paper":"https://pith.science/paper/JVMJKZAQ"},"agent_actions":{"view_html":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2","download_json":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2.json","view_paper":"https://pith.science/paper/JVMJKZAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.5887&json=true","fetch_graph":"https://pith.science/api/pith-number/JVMJKZAQLYP5SLQC3N2K4LONW2/graph.json","fetch_events":"https://pith.science/api/pith-number/JVMJKZAQLYP5SLQC3N2K4LONW2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2/action/storage_attestation","attest_author":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2/action/author_attestation","sign_citation":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2/action/citation_signature","submit_replication":"https://pith.science/pith/JVMJKZAQLYP5SLQC3N2K4LONW2/action/replication_record"}},"created_at":"2026-05-18T02:32:31.185087+00:00","updated_at":"2026-05-18T02:32:31.185087+00:00"}