{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NBYUUXOJ3UADHZSQ2ELNWTT2RZ","short_pith_number":"pith:NBYUUXOJ","canonical_record":{"source":{"id":"1611.06615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T00:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"7ba370f181711b0ccbde5b2cd97613d10c07434b154872d70657ec85a9356205","abstract_canon_sha256":"b1d6558537a65dd4fbf7d50f31580631476462a06ad16cdce4a18ad583c55b83"},"schema_version":"1.0"},"canonical_sha256":"68714a5dc9dd0033e650d116db4e7a8e63050d79828a92e56c800e9d7f782efd","source":{"kind":"arxiv","id":"1611.06615","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06615","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06615v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06615","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"NBYUUXOJ3UAD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBYUUXOJ3UADHZSQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBYUUXOJ","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NBYUUXOJ3UADHZSQ2ELNWTT2RZ","target":"record","payload":{"canonical_record":{"source":{"id":"1611.06615","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T00:04:11Z","cross_cats_sorted":[],"title_canon_sha256":"7ba370f181711b0ccbde5b2cd97613d10c07434b154872d70657ec85a9356205","abstract_canon_sha256":"b1d6558537a65dd4fbf7d50f31580631476462a06ad16cdce4a18ad583c55b83"},"schema_version":"1.0"},"canonical_sha256":"68714a5dc9dd0033e650d116db4e7a8e63050d79828a92e56c800e9d7f782efd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:37.489849Z","signature_b64":"vk49yMNSLF0CBMIpuTtm1Ws1xrIN19ZW02EVxBeGtwIxY4br5nDI/CsLpeclrGSxyFmPBV46uFgbS19D9uZTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68714a5dc9dd0033e650d116db4e7a8e63050d79828a92e56c800e9d7f782efd","last_reissued_at":"2026-05-18T00:56:37.489245Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:37.489245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.06615","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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLtFnnc7VgagF5ZMOTDBxVPnShSI9YjB3zcYg6ehQuqVbOMNCg9JX3yL+ICugTuE0DfwDRon9fYYHmj1GLAhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:07:21.427273Z"},"content_sha256":"6c5705a3bb8d721a741bae7fc37de3aeb8158bb65cb8552a8ec485ed01b041ba","schema_version":"1.0","event_id":"sha256:6c5705a3bb8d721a741bae7fc37de3aeb8158bb65cb8552a8ec485ed01b041ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NBYUUXOJ3UADHZSQ2ELNWTT2RZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FURL: Fixed-memory and Uncertainty Reducing Local Triangle Counting for Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Minsoo Jung, Sunmin Lee, U Kang, Yongsub Lim","submitted_at":"2016-11-21T00:04:11Z","abstract_excerpt":"How can we accurately estimate local triangles for all nodes in simple and multigraph streams? Local triangle counting in a graph stream is one of the most fundamental tasks in graph mining with important applications including anomaly detection and social network analysis. Although there have been several local triangle counting methods in a graph stream, their estimation has a large variance which results in low accuracy, and they do not consider multigraph streams which have duplicate edges. In this paper, we propose FURL, an accurate local triangle counting method for simple and multigraph"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06615","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:56:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aOZqwFKOFxgPn/8Tg54yyItm88kP6RvY9dzo5F3FYkgLhBhi2B0+sdf7ooDz9cyJfMqabK8YEtBq83i3ePRcCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T14:07:21.427923Z"},"content_sha256":"e5626071dd06bf5d8236744051cee3550d0387873ff7766920a495426f34b39e","schema_version":"1.0","event_id":"sha256:e5626071dd06bf5d8236744051cee3550d0387873ff7766920a495426f34b39e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NBYUUXOJ3UADHZSQ2ELNWTT2RZ/bundle.json","state_url":"https://pith.science/pith/NBYUUXOJ3UADHZSQ2ELNWTT2RZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NBYUUXOJ3UADHZSQ2ELNWTT2RZ/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-27T14:07:21Z","links":{"resolver":"https://pith.science/pith/NBYUUXOJ3UADHZSQ2ELNWTT2RZ","bundle":"https://pith.science/pith/NBYUUXOJ3UADHZSQ2ELNWTT2RZ/bundle.json","state":"https://pith.science/pith/NBYUUXOJ3UADHZSQ2ELNWTT2RZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NBYUUXOJ3UADHZSQ2ELNWTT2RZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NBYUUXOJ3UADHZSQ2ELNWTT2RZ","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":"b1d6558537a65dd4fbf7d50f31580631476462a06ad16cdce4a18ad583c55b83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T00:04:11Z","title_canon_sha256":"7ba370f181711b0ccbde5b2cd97613d10c07434b154872d70657ec85a9356205"},"schema_version":"1.0","source":{"id":"1611.06615","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06615","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06615v2","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06615","created_at":"2026-05-18T00:56:37Z"},{"alias_kind":"pith_short_12","alias_value":"NBYUUXOJ3UAD","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NBYUUXOJ3UADHZSQ","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NBYUUXOJ","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:e5626071dd06bf5d8236744051cee3550d0387873ff7766920a495426f34b39e","target":"graph","created_at":"2026-05-18T00:56:37Z","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":"How can we accurately estimate local triangles for all nodes in simple and multigraph streams? Local triangle counting in a graph stream is one of the most fundamental tasks in graph mining with important applications including anomaly detection and social network analysis. Although there have been several local triangle counting methods in a graph stream, their estimation has a large variance which results in low accuracy, and they do not consider multigraph streams which have duplicate edges. In this paper, we propose FURL, an accurate local triangle counting method for simple and multigraph","authors_text":"Minsoo Jung, Sunmin Lee, U Kang, Yongsub Lim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T00:04:11Z","title":"FURL: Fixed-memory and Uncertainty Reducing Local Triangle Counting for Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06615","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:6c5705a3bb8d721a741bae7fc37de3aeb8158bb65cb8552a8ec485ed01b041ba","target":"record","created_at":"2026-05-18T00:56:37Z","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":"b1d6558537a65dd4fbf7d50f31580631476462a06ad16cdce4a18ad583c55b83","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-21T00:04:11Z","title_canon_sha256":"7ba370f181711b0ccbde5b2cd97613d10c07434b154872d70657ec85a9356205"},"schema_version":"1.0","source":{"id":"1611.06615","kind":"arxiv","version":2}},"canonical_sha256":"68714a5dc9dd0033e650d116db4e7a8e63050d79828a92e56c800e9d7f782efd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68714a5dc9dd0033e650d116db4e7a8e63050d79828a92e56c800e9d7f782efd","first_computed_at":"2026-05-18T00:56:37.489245Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:37.489245Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vk49yMNSLF0CBMIpuTtm1Ws1xrIN19ZW02EVxBeGtwIxY4br5nDI/CsLpeclrGSxyFmPBV46uFgbS19D9uZTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:37.489849Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06615","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c5705a3bb8d721a741bae7fc37de3aeb8158bb65cb8552a8ec485ed01b041ba","sha256:e5626071dd06bf5d8236744051cee3550d0387873ff7766920a495426f34b39e"],"state_sha256":"d1e7738af956b4211663a62af07a4e3df0481e9c751b2e7dd77865936f237a96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YbGjOrR1JNqk/qrjaF8u6cRHdOpAPv07zLWYo57tgSfRJjKB1ziueLrTkaIr4L0ZD7ithtnJZEbO2JWeqhVKBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T14:07:21.431288Z","bundle_sha256":"3f4eaa8421f1b7a17b0611e7b2a9ae98b8404829053171d95ed4c9f8e94c6f08"}}