{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ETH5WOQC5YVOAI3RLNURG3QL5R","short_pith_number":"pith:ETH5WOQC","schema_version":"1.0","canonical_sha256":"24cfdb3a02ee2ae023715b69136e0bec47f9c9a9e5a7b12cb75b3a800c078462","source":{"kind":"arxiv","id":"1709.06723","version":1},"attestation_state":"computed","paper":{"title":"SBG-Sketch: A Self-Balanced Sketch for Labeled-Graph Stream Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bruno Ribeiro, Mohamed S. Hassan, Walid G. Aref","submitted_at":"2017-09-20T04:37:02Z","abstract_excerpt":"Applications in various domains rely on processing graph streams, e.g., communication logs of a cloud-troubleshooting system, road-network traffic updates, and interactions on a social network. A labeled-graph stream refers to a sequence of streamed edges that form a labeled graph. Label-aware applications need to filter the graph stream before performing a graph operation. Due to the large volume and high velocity of these streams, it is often more practical to incrementally build a lossy-compressed version of the graph, and use this lossy version to approximately evaluate graph queries. Chal"},"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":"1709.06723","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2017-09-20T04:37:02Z","cross_cats_sorted":[],"title_canon_sha256":"34fc3571b8f51322f2afec16d1f7fe453707f105e72691e7793cbf583b867d42","abstract_canon_sha256":"982256c885b98fc24234499af857a9f9150bfb8beb22a900051a54d771d93e6b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:40.697265Z","signature_b64":"2S9HTufd5KTm6kfNt0CB7A6euw2+fwMcTJlR0e63+Wipd0oy7EgkG/aEDNUHEnsyY/GvM9j5ErLhGUL3H7uwCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24cfdb3a02ee2ae023715b69136e0bec47f9c9a9e5a7b12cb75b3a800c078462","last_reissued_at":"2026-05-18T00:34:40.696478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:40.696478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SBG-Sketch: A Self-Balanced Sketch for Labeled-Graph Stream Summarization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bruno Ribeiro, Mohamed S. Hassan, Walid G. Aref","submitted_at":"2017-09-20T04:37:02Z","abstract_excerpt":"Applications in various domains rely on processing graph streams, e.g., communication logs of a cloud-troubleshooting system, road-network traffic updates, and interactions on a social network. A labeled-graph stream refers to a sequence of streamed edges that form a labeled graph. Label-aware applications need to filter the graph stream before performing a graph operation. Due to the large volume and high velocity of these streams, it is often more practical to incrementally build a lossy-compressed version of the graph, and use this lossy version to approximately evaluate graph queries. Chal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06723","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":"1709.06723","created_at":"2026-05-18T00:34:40.696626+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06723v1","created_at":"2026-05-18T00:34:40.696626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06723","created_at":"2026-05-18T00:34:40.696626+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETH5WOQC5YVO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETH5WOQC5YVOAI3R","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETH5WOQC","created_at":"2026-05-18T12:31:12.930513+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/ETH5WOQC5YVOAI3RLNURG3QL5R","json":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R.json","graph_json":"https://pith.science/api/pith-number/ETH5WOQC5YVOAI3RLNURG3QL5R/graph.json","events_json":"https://pith.science/api/pith-number/ETH5WOQC5YVOAI3RLNURG3QL5R/events.json","paper":"https://pith.science/paper/ETH5WOQC"},"agent_actions":{"view_html":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R","download_json":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R.json","view_paper":"https://pith.science/paper/ETH5WOQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06723&json=true","fetch_graph":"https://pith.science/api/pith-number/ETH5WOQC5YVOAI3RLNURG3QL5R/graph.json","fetch_events":"https://pith.science/api/pith-number/ETH5WOQC5YVOAI3RLNURG3QL5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R/action/storage_attestation","attest_author":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R/action/author_attestation","sign_citation":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R/action/citation_signature","submit_replication":"https://pith.science/pith/ETH5WOQC5YVOAI3RLNURG3QL5R/action/replication_record"}},"created_at":"2026-05-18T00:34:40.696626+00:00","updated_at":"2026-05-18T00:34:40.696626+00:00"}