{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:XV7ZSSEB5MZYJIZ7EUQU7TVTZH","short_pith_number":"pith:XV7ZSSEB","canonical_record":{"source":{"id":"1201.6567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"2e4721b68f1393ec45cef0d2da47dd1cc23138b633a1cfdc17c28ca9be76040b","abstract_canon_sha256":"5aec1a69d81f77e445ef8a6fef6ba36bacbdabd9bd630b7b466fc511a7b83786"},"schema_version":"1.0"},"canonical_sha256":"bd7f994881eb3384a33f25214fceb3c9cd10cf9dec2c0aa3480c2edd1b49f4c3","source":{"kind":"arxiv","id":"1201.6567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6567","created_at":"2026-05-18T04:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6567v1","created_at":"2026-05-18T04:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6567","created_at":"2026-05-18T04:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"XV7ZSSEB5MZY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XV7ZSSEB5MZYJIZ7","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XV7ZSSEB","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:XV7ZSSEB5MZYJIZ7EUQU7TVTZH","target":"record","payload":{"canonical_record":{"source":{"id":"1201.6567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:10:03Z","cross_cats_sorted":[],"title_canon_sha256":"2e4721b68f1393ec45cef0d2da47dd1cc23138b633a1cfdc17c28ca9be76040b","abstract_canon_sha256":"5aec1a69d81f77e445ef8a6fef6ba36bacbdabd9bd630b7b466fc511a7b83786"},"schema_version":"1.0"},"canonical_sha256":"bd7f994881eb3384a33f25214fceb3c9cd10cf9dec2c0aa3480c2edd1b49f4c3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:30.153147Z","signature_b64":"tUYvhJXkSOM3DresGDXKLIN8W3+2BARyJlQs6Z7SYbbfvFVnhbqTo8qrB1WG5Cu9AF1Uhb+vJisXSeCKYAnTDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd7f994881eb3384a33f25214fceb3c9cd10cf9dec2c0aa3480c2edd1b49f4c3","last_reissued_at":"2026-05-18T04:03:30.152597Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:30.152597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.6567","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-18T04:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xKo7E5zW4erc90/WCtUVOC110S51mfRVVXoRdOYPK4zpWm4NYgZXeL92jaj+QCi39t1Oy1xsoeqwF/4sf5aHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:25:24.618918Z"},"content_sha256":"03d61f3749e2917779a247ae91a29a741b26b599d5ef7fdd9c6bf304fc63def9","schema_version":"1.0","event_id":"sha256:03d61f3749e2917779a247ae91a29a741b26b599d5ef7fdd9c6bf304fc63def9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:XV7ZSSEB5MZYJIZ7EUQU7TVTZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Densest Subgraph in Streaming and MapReduce","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii","submitted_at":"2012-01-31T15:10:03Z","abstract_excerpt":"The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph in the streaming model. For any epsilon>0, our algorithms make O((log n)/log (1+epsilon)) passes over the input and find a subgraph whose density is guaranteed to be within a factor 2(1+epsilon) of the optimum. Our algorithms are also easily parallelizable and we illustrate this by realizing them in the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6567","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-18T04:03:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dFFxx0ip7swVO2gkM8oWB/16XBpTjrcZgYRcCF20F/cbT+M7tfQTkUyQiEsslyJoeQxr7M1+cJYau/r2NDMCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T01:25:24.619523Z"},"content_sha256":"b24f9b99cc940b50659089739df720f309db822bf046743421b06dfc3382a513","schema_version":"1.0","event_id":"sha256:b24f9b99cc940b50659089739df720f309db822bf046743421b06dfc3382a513"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XV7ZSSEB5MZYJIZ7EUQU7TVTZH/bundle.json","state_url":"https://pith.science/pith/XV7ZSSEB5MZYJIZ7EUQU7TVTZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XV7ZSSEB5MZYJIZ7EUQU7TVTZH/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-08T01:25:24Z","links":{"resolver":"https://pith.science/pith/XV7ZSSEB5MZYJIZ7EUQU7TVTZH","bundle":"https://pith.science/pith/XV7ZSSEB5MZYJIZ7EUQU7TVTZH/bundle.json","state":"https://pith.science/pith/XV7ZSSEB5MZYJIZ7EUQU7TVTZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XV7ZSSEB5MZYJIZ7EUQU7TVTZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:XV7ZSSEB5MZYJIZ7EUQU7TVTZH","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":"5aec1a69d81f77e445ef8a6fef6ba36bacbdabd9bd630b7b466fc511a7b83786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:10:03Z","title_canon_sha256":"2e4721b68f1393ec45cef0d2da47dd1cc23138b633a1cfdc17c28ca9be76040b"},"schema_version":"1.0","source":{"id":"1201.6567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6567","created_at":"2026-05-18T04:03:30Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6567v1","created_at":"2026-05-18T04:03:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6567","created_at":"2026-05-18T04:03:30Z"},{"alias_kind":"pith_short_12","alias_value":"XV7ZSSEB5MZY","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"XV7ZSSEB5MZYJIZ7","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"XV7ZSSEB","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:b24f9b99cc940b50659089739df720f309db822bf046743421b06dfc3382a513","target":"graph","created_at":"2026-05-18T04:03:30Z","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":"The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph in the streaming model. For any epsilon>0, our algorithms make O((log n)/log (1+epsilon)) passes over the input and find a subgraph whose density is guaranteed to be within a factor 2(1+epsilon) of the optimum. Our algorithms are also easily parallelizable and we illustrate this by realizing them in the","authors_text":"Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:10:03Z","title":"Densest Subgraph in Streaming and MapReduce"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6567","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:03d61f3749e2917779a247ae91a29a741b26b599d5ef7fdd9c6bf304fc63def9","target":"record","created_at":"2026-05-18T04:03:30Z","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":"5aec1a69d81f77e445ef8a6fef6ba36bacbdabd9bd630b7b466fc511a7b83786","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-01-31T15:10:03Z","title_canon_sha256":"2e4721b68f1393ec45cef0d2da47dd1cc23138b633a1cfdc17c28ca9be76040b"},"schema_version":"1.0","source":{"id":"1201.6567","kind":"arxiv","version":1}},"canonical_sha256":"bd7f994881eb3384a33f25214fceb3c9cd10cf9dec2c0aa3480c2edd1b49f4c3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd7f994881eb3384a33f25214fceb3c9cd10cf9dec2c0aa3480c2edd1b49f4c3","first_computed_at":"2026-05-18T04:03:30.152597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:30.152597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tUYvhJXkSOM3DresGDXKLIN8W3+2BARyJlQs6Z7SYbbfvFVnhbqTo8qrB1WG5Cu9AF1Uhb+vJisXSeCKYAnTDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:30.153147Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:03d61f3749e2917779a247ae91a29a741b26b599d5ef7fdd9c6bf304fc63def9","sha256:b24f9b99cc940b50659089739df720f309db822bf046743421b06dfc3382a513"],"state_sha256":"2b69754363a55eb64134bdc7d7a49cd1253e12af61b37e64b9fb165939939786"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nwyBu/5TjYTcnr/n8jmZaGMn6x2DTXhSMf77pbob247HENsk1DThAi/OT/S8hsQX5UpxW53LIVCQ6qYbgOtGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T01:25:24.623167Z","bundle_sha256":"1ebb907cc1e41c7327247d16bb4bc3e663fa3019a5c2f9a258e030df297bb04b"}}