{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:NC4PO3CEJEVKW4PGJKHDPDA2M2","short_pith_number":"pith:NC4PO3CE","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"},"canonical_sha256":"68b8f76c44492aab71e64a8e378c1a66b1695864e01d99ca04a6c717bde3ef70","source":{"kind":"arxiv","id":"1506.06671","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06671","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06671v1","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06671","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"NC4PO3CEJEVK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NC4PO3CEJEVKW4PG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NC4PO3CE","created_at":"2026-05-18T12:29:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:NC4PO3CEJEVKW4PGJKHDPDA2M2","target":"record","payload":{"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"},"canonical_sha256":"68b8f76c44492aab71e64a8e378c1a66b1695864e01d99ca04a6c717bde3ef70","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"},"source_kind":"arxiv","source_id":"1506.06671","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F4AQawq+kKfEUVDHNf+GXiOrNhPZxPKKH76+fiYrG9xYenLTOdTwPOv57jkWG7P3wd/AJYnH8qZ7bE251XhFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:06:12.557080Z"},"content_sha256":"377b490847fb8ac58dccf59f62edb41138aaf4b9f39f1d661d20ad99db64dcfd","schema_version":"1.0","event_id":"sha256:377b490847fb8ac58dccf59f62edb41138aaf4b9f39f1d661d20ad99db64dcfd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:NC4PO3CEJEVKW4PGJKHDPDA2M2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:41:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"769xqFhFrayZplTGg585sRBczLOfsDducZ7RDUz1KXMmwDa93z0Oqthd+vEsX9auUkRuaBngGX23tjOo+jLxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T21:06:12.557662Z"},"content_sha256":"6b5dcc2a202ffdd7a31fb97ffe08d0b4cadaaab28a1eec6cb578b4d5c09fed79","schema_version":"1.0","event_id":"sha256:6b5dcc2a202ffdd7a31fb97ffe08d0b4cadaaab28a1eec6cb578b4d5c09fed79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/bundle.json","state_url":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-19T21:06:12Z","links":{"resolver":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2","bundle":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/bundle.json","state":"https://pith.science/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NC4PO3CEJEVKW4PGJKHDPDA2M2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:NC4PO3CEJEVKW4PGJKHDPDA2M2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d181fe5552f325f1d9652ebbc0dd10d69c3a39d38bb7b03904b61c1d2c4129f5","cross_cats_sorted":["cs.DC","cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-22T16:34:16Z","title_canon_sha256":"d0b5012695dc701e374cf89a564c7ec195ade844991a9df66b77cbd785859be3"},"schema_version":"1.0","source":{"id":"1506.06671","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06671","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06671v1","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06671","created_at":"2026-05-18T01:41:44Z"},{"alias_kind":"pith_short_12","alias_value":"NC4PO3CEJEVK","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_16","alias_value":"NC4PO3CEJEVKW4PG","created_at":"2026-05-18T12:29:32Z"},{"alias_kind":"pith_short_8","alias_value":"NC4PO3CE","created_at":"2026-05-18T12:29:32Z"}],"graph_snapshots":[{"event_id":"sha256:6b5dcc2a202ffdd7a31fb97ffe08d0b4cadaaab28a1eec6cb578b4d5c09fed79","target":"graph","created_at":"2026-05-18T01:41:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexandros G. Dimakis, Ethan R. Elenberg, Karthikeyan Shanmugam, Michael Borokhovich","cross_cats":["cs.DC","cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-22T16:34:16Z","title":"Beyond Triangles: A Distributed Framework for Estimating 3-profiles of Large Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06671","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:377b490847fb8ac58dccf59f62edb41138aaf4b9f39f1d661d20ad99db64dcfd","target":"record","created_at":"2026-05-18T01:41:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d181fe5552f325f1d9652ebbc0dd10d69c3a39d38bb7b03904b61c1d2c4129f5","cross_cats_sorted":["cs.DC","cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2015-06-22T16:34:16Z","title_canon_sha256":"d0b5012695dc701e374cf89a564c7ec195ade844991a9df66b77cbd785859be3"},"schema_version":"1.0","source":{"id":"1506.06671","kind":"arxiv","version":1}},"canonical_sha256":"68b8f76c44492aab71e64a8e378c1a66b1695864e01d99ca04a6c717bde3ef70","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68b8f76c44492aab71e64a8e378c1a66b1695864e01d99ca04a6c717bde3ef70","first_computed_at":"2026-05-18T01:41:44.578191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:41:44.578191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nxH2UQBgfZCGz8+eiqQPZzuV5t2FHiuhd9kkkKSKHG7aIo6zWFZpK1dnQHerc52R25zvfSY7U1ujQJ/UOR74DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:41:44.578740Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06671","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:377b490847fb8ac58dccf59f62edb41138aaf4b9f39f1d661d20ad99db64dcfd","sha256:6b5dcc2a202ffdd7a31fb97ffe08d0b4cadaaab28a1eec6cb578b4d5c09fed79"],"state_sha256":"f7976a75be8900cf1c0c8fe75825b1bbd25df636a3a7f8a665903307f050a797"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rBcUWmItUA3Xs/LSHjB8yhmgLzwxfl7/C8g5HcFj/z7iWM7YlodtuSXIv5Wa+SSnrk0vO9xwIHg+lkP7KJb0Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T21:06:12.560501Z","bundle_sha256":"956480320a6862e3b68969b9b85874051f6f9512f2e6a3d0f875df412aaa9122"}}