{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CMGX67ASXOR62GLLBHSIWPFDP2","short_pith_number":"pith:CMGX67AS","canonical_record":{"source":{"id":"1706.04660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-14T20:34:14Z","cross_cats_sorted":[],"title_canon_sha256":"ae1456fdfa6635b6769fa69851f3c84b851ef533694a13fbed887fa6424410ac","abstract_canon_sha256":"6f110d53c05a66d93d1845240920000eb5061851ce72d0b839168fefdc1c069c"},"schema_version":"1.0"},"canonical_sha256":"130d7f7c12bba3ed196b09e48b3ca37e96954ff40ab5717f1ab5d28d40319f40","source":{"kind":"arxiv","id":"1706.04660","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04660","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04660v2","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04660","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"CMGX67ASXOR6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMGX67ASXOR62GLL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMGX67AS","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CMGX67ASXOR62GLLBHSIWPFDP2","target":"record","payload":{"canonical_record":{"source":{"id":"1706.04660","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-14T20:34:14Z","cross_cats_sorted":[],"title_canon_sha256":"ae1456fdfa6635b6769fa69851f3c84b851ef533694a13fbed887fa6424410ac","abstract_canon_sha256":"6f110d53c05a66d93d1845240920000eb5061851ce72d0b839168fefdc1c069c"},"schema_version":"1.0"},"canonical_sha256":"130d7f7c12bba3ed196b09e48b3ca37e96954ff40ab5717f1ab5d28d40319f40","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:20.940417Z","signature_b64":"LAxbg/WkMoQE9do5dpomEPhnjGlh+sP6PXXXH5BqvSUD1+ZPIdcmlIP+Rw5lLpG6+QOmg7GZKRiQFoknMMEQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"130d7f7c12bba3ed196b09e48b3ca37e96954ff40ab5717f1ab5d28d40319f40","last_reissued_at":"2026-05-18T00:22:20.939947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:20.939947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.04660","source_version":2,"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-18T00:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Hqie02iUVZbAbfBjB2Llj4shnaUVi1C+xcI2qMIL8EvAf3VhTV3Q8bU3i8QNmm5q1hp11W44+7vEKFU2PvKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:51:45.689208Z"},"content_sha256":"3a8e5d25de8eefeee9dd3478e9d1b57d0248db71ab61974e5ab738781c3d7d5f","schema_version":"1.0","event_id":"sha256:3a8e5d25de8eefeee9dd3478e9d1b57d0248db71ab61974e5ab738781c3d7d5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CMGX67ASXOR62GLLBHSIWPFDP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Counting Triangles through Edge Sampling in Large Dynamic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Guyue Han, Harish Sethu","submitted_at":"2017-06-14T20:34:14Z","abstract_excerpt":"Traditional frameworks for dynamic graphs have relied on processing only the stream of edges added into or deleted from an evolving graph, but not any additional related information such as the degrees or neighbor lists of nodes incident to the edges. In this paper, we propose a new edge sampling framework for big-graph analytics in dynamic graphs which enhances the traditional model by enabling the use of additional related information. To demonstrate the advantages of this framework, we present a new sampling algorithm, called Edge Sample and Discard (ESD). It generates an unbiased estimate "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04660","kind":"arxiv","version":2},"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-18T00:22:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BICGThYFw7Bnv9ug0JkPMu8yfOlQWX1iF2bK5k1tdevl9D4DZ+DALygjTnlHDqt9wQa9WbsFJ3VTcMGTLmwnAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T12:51:45.689566Z"},"content_sha256":"3aec6d8ebad87249815951da2520526447e72182ef7ae34349de7c9f00d648a4","schema_version":"1.0","event_id":"sha256:3aec6d8ebad87249815951da2520526447e72182ef7ae34349de7c9f00d648a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMGX67ASXOR62GLLBHSIWPFDP2/bundle.json","state_url":"https://pith.science/pith/CMGX67ASXOR62GLLBHSIWPFDP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMGX67ASXOR62GLLBHSIWPFDP2/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-06-08T12:51:45Z","links":{"resolver":"https://pith.science/pith/CMGX67ASXOR62GLLBHSIWPFDP2","bundle":"https://pith.science/pith/CMGX67ASXOR62GLLBHSIWPFDP2/bundle.json","state":"https://pith.science/pith/CMGX67ASXOR62GLLBHSIWPFDP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMGX67ASXOR62GLLBHSIWPFDP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CMGX67ASXOR62GLLBHSIWPFDP2","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":"6f110d53c05a66d93d1845240920000eb5061851ce72d0b839168fefdc1c069c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-14T20:34:14Z","title_canon_sha256":"ae1456fdfa6635b6769fa69851f3c84b851ef533694a13fbed887fa6424410ac"},"schema_version":"1.0","source":{"id":"1706.04660","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.04660","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"arxiv_version","alias_value":"1706.04660v2","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.04660","created_at":"2026-05-18T00:22:20Z"},{"alias_kind":"pith_short_12","alias_value":"CMGX67ASXOR6","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMGX67ASXOR62GLL","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMGX67AS","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:3aec6d8ebad87249815951da2520526447e72182ef7ae34349de7c9f00d648a4","target":"graph","created_at":"2026-05-18T00:22:20Z","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":"Traditional frameworks for dynamic graphs have relied on processing only the stream of edges added into or deleted from an evolving graph, but not any additional related information such as the degrees or neighbor lists of nodes incident to the edges. In this paper, we propose a new edge sampling framework for big-graph analytics in dynamic graphs which enhances the traditional model by enabling the use of additional related information. To demonstrate the advantages of this framework, we present a new sampling algorithm, called Edge Sample and Discard (ESD). It generates an unbiased estimate ","authors_text":"Guyue Han, Harish Sethu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-14T20:34:14Z","title":"On Counting Triangles through Edge Sampling in Large Dynamic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.04660","kind":"arxiv","version":2},"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:3a8e5d25de8eefeee9dd3478e9d1b57d0248db71ab61974e5ab738781c3d7d5f","target":"record","created_at":"2026-05-18T00:22:20Z","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":"6f110d53c05a66d93d1845240920000eb5061851ce72d0b839168fefdc1c069c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-06-14T20:34:14Z","title_canon_sha256":"ae1456fdfa6635b6769fa69851f3c84b851ef533694a13fbed887fa6424410ac"},"schema_version":"1.0","source":{"id":"1706.04660","kind":"arxiv","version":2}},"canonical_sha256":"130d7f7c12bba3ed196b09e48b3ca37e96954ff40ab5717f1ab5d28d40319f40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"130d7f7c12bba3ed196b09e48b3ca37e96954ff40ab5717f1ab5d28d40319f40","first_computed_at":"2026-05-18T00:22:20.939947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:22:20.939947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LAxbg/WkMoQE9do5dpomEPhnjGlh+sP6PXXXH5BqvSUD1+ZPIdcmlIP+Rw5lLpG6+QOmg7GZKRiQFoknMMEQBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:22:20.940417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.04660","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a8e5d25de8eefeee9dd3478e9d1b57d0248db71ab61974e5ab738781c3d7d5f","sha256:3aec6d8ebad87249815951da2520526447e72182ef7ae34349de7c9f00d648a4"],"state_sha256":"06ada4bd5c8b9894e29dc8a017d1989a570928e3b24cc6ca7b1623b398d13f88"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8OeqWJd0N162Gdazqz3o4DjKiSwgqc9Zx76vLip4uDj1c42aHc5Z30FY21eNfpuK5lQLsArSwiQCmwwTquMuBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T12:51:45.691575Z","bundle_sha256":"d5e5dbbdf750984e4e0fae59ff10435bfae9104f42eb10baa1c7f94b1dc44f65"}}