{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NC4PO3CEJEVKW4PGJKHDPDA2M2","short_pith_number":"pith:NC4PO3CE","schema_version":"1.0","canonical_sha256":"68b8f76c44492aab71e64a8e378c1a66b1695864e01d99ca04a6c717bde3ef70","source":{"kind":"arxiv","id":"1506.06671","version":1},"attestation_state":"computed","paper":{"title":"Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.IT","math.IT"],"primary_cat":"cs.SI","authors_text":"Alexandros G. Dimakis, Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich","submitted_at":"2015-06-22T16:34:16Z","abstract_excerpt":"We study the problem of approximating the $3$-profile of a large graph. $3$-profiles are generalizations of triangle counts that specify the number of times a small graph appears as an induced subgraph of a large graph. Our algorithm uses the novel concept of $3$-profile sparsifiers: sparse graphs that can be used to approximate the full $3$-profile counts for a given large graph. Further, we study the problem of estimating local and ego $3$-profiles, two graph quantities that characterize the local neighborhood of each vertex of a graph.\n  Our algorithm is distributed and operates as a vertex"},"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":"1506.06671","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-22T16:34:16Z","cross_cats_sorted":["cs.DC","cs.DS","cs.IT","math.IT"],"title_canon_sha256":"d0b5012695dc701e374cf89a564c7ec195ade844991a9df66b77cbd785859be3","abstract_canon_sha256":"d181fe5552f325f1d9652ebbc0dd10d69c3a39d38bb7b03904b61c1d2c4129f5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:41:44.578740Z","signature_b64":"nxH2UQBgfZCGz8+eiqQPZzuV5t2FHiuhd9kkkKSKHG7aIo6zWFZpK1dnQHerc52R25zvfSY7U1ujQJ/UOR74DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68b8f76c44492aab71e64a8e378c1a66b1695864e01d99ca04a6c717bde3ef70","last_reissued_at":"2026-05-18T01:41:44.578191Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:41:44.578191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.DS","cs.IT","math.IT"],"primary_cat":"cs.SI","authors_text":"Alexandros G. Dimakis, Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich","submitted_at":"2015-06-22T16:34:16Z","abstract_excerpt":"We study the problem of approximating the $3$-profile of a large graph. $3$-profiles are generalizations of triangle counts that specify the number of times a small graph appears as an induced subgraph of a large graph. Our algorithm uses the novel concept of $3$-profile sparsifiers: sparse graphs that can be used to approximate the full $3$-profile counts for a given large graph. Further, we study the problem of estimating local and ego $3$-profiles, two graph quantities that characterize the local neighborhood of each vertex of a graph.\n  Our algorithm is distributed and operates as a vertex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06671","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":"1506.06671","created_at":"2026-05-18T01:41:44.578261+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06671v1","created_at":"2026-05-18T01:41:44.578261+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06671","created_at":"2026-05-18T01:41:44.578261+00:00"},{"alias_kind":"pith_short_12","alias_value":"NC4PO3CEJEVK","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NC4PO3CEJEVKW4PG","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NC4PO3CE","created_at":"2026-05-18T12:29:32.376354+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/NC4PO3CEJEVKW4PGJKHDPDA2M2","json":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2.json","graph_json":"https://pith.science/api/pith-number/NC4PO3CEJEVKW4PGJKHDPDA2M2/graph.json","events_json":"https://pith.science/api/pith-number/NC4PO3CEJEVKW4PGJKHDPDA2M2/events.json","paper":"https://pith.science/paper/NC4PO3CE"},"agent_actions":{"view_html":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2","download_json":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2.json","view_paper":"https://pith.science/paper/NC4PO3CE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06671&json=true","fetch_graph":"https://pith.science/api/pith-number/NC4PO3CEJEVKW4PGJKHDPDA2M2/graph.json","fetch_events":"https://pith.science/api/pith-number/NC4PO3CEJEVKW4PGJKHDPDA2M2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/action/storage_attestation","attest_author":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/action/author_attestation","sign_citation":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/action/citation_signature","submit_replication":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/action/replication_record"}},"created_at":"2026-05-18T01:41:44.578261+00:00","updated_at":"2026-05-18T01:41:44.578261+00:00"}