{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BCK42GOFGTCL64ZT25MAA5KR7G","short_pith_number":"pith:BCK42GOF","canonical_record":{"source":{"id":"1810.07324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-10-17T00:11:20Z","cross_cats_sorted":[],"title_canon_sha256":"a411eccf4744f8a3e6f950a467443b444291baa447ce91619d16c9bdce5a9c0f","abstract_canon_sha256":"a68ca45b888d0240a9576a22b1769f0c5b64ec36ee77246ead5ed3968769b89c"},"schema_version":"1.0"},"canonical_sha256":"0895cd19c534c4bf7333d758007551f98eb1c265f5c6fba402cf0bde4bdb6596","source":{"kind":"arxiv","id":"1810.07324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07324","created_at":"2026-05-18T00:02:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07324v1","created_at":"2026-05-18T00:02:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07324","created_at":"2026-05-18T00:02:58Z"},{"alias_kind":"pith_short_12","alias_value":"BCK42GOFGTCL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BCK42GOFGTCL64ZT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BCK42GOF","created_at":"2026-05-18T12:32:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BCK42GOFGTCL64ZT25MAA5KR7G","target":"record","payload":{"canonical_record":{"source":{"id":"1810.07324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-10-17T00:11:20Z","cross_cats_sorted":[],"title_canon_sha256":"a411eccf4744f8a3e6f950a467443b444291baa447ce91619d16c9bdce5a9c0f","abstract_canon_sha256":"a68ca45b888d0240a9576a22b1769f0c5b64ec36ee77246ead5ed3968769b89c"},"schema_version":"1.0"},"canonical_sha256":"0895cd19c534c4bf7333d758007551f98eb1c265f5c6fba402cf0bde4bdb6596","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:58.818722Z","signature_b64":"0nhbImVF647UpZtDGt1JkEXGZQgJSv3jpvFyCjdBDiYG+orx7aoJuW2GzAITF7Comrq0Ztf5olo0/t8NomG8AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0895cd19c534c4bf7333d758007551f98eb1c265f5c6fba402cf0bde4bdb6596","last_reissued_at":"2026-05-18T00:02:58.818292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:58.818292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.07324","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-18T00:02:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FMrW892ZJFPOwjXde52V1TTrWZwOkM7HLU2NoKFaluzPD+UVBT2U5BxWTLXBOr2CY4zsXN8lWkcBhvktwIflBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:32:14.318307Z"},"content_sha256":"3828b486661322eb716ea0fa238994f1bdcffd73a0541430bdf01ae1abdd4849","schema_version":"1.0","event_id":"sha256:3828b486661322eb716ea0fa238994f1bdcffd73a0541430bdf01ae1abdd4849"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BCK42GOFGTCL64ZT25MAA5KR7G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Short Introduction to Local Graph Clustering Methods and Software","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"David F. Gleich, Kimon Fountoulakis, Michael W. Mahoney","submitted_at":"2018-10-17T00:11:20Z","abstract_excerpt":"Graph clustering has many important applications in computing, but due to the increasing sizes of graphs, even traditionally fast clustering methods can be computationally expensive for real-world graphs of interest. Scalability problems led to the development of local graph clustering algorithms that come with a variety of theoretical guarantees. Rather than return a global clustering of the entire graph, local clustering algorithms return a single cluster around a given seed node or set of seed nodes. These algorithms improve scalability because they use time and memory resources that depend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07324","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-18T00:02:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6552lk3JrgNmGSZoeQPtif6TFEfMrsOJLvurDYnw08A7rj5PL4hZwbBmqdp2D7MEdQkkhUoJzvztcD/XzGUAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:32:14.318679Z"},"content_sha256":"174ae8b270ea584c41b20419fdabe11848f30fa5136aff29d27312e989e5d1f6","schema_version":"1.0","event_id":"sha256:174ae8b270ea584c41b20419fdabe11848f30fa5136aff29d27312e989e5d1f6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/bundle.json","state_url":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BCK42GOFGTCL64ZT25MAA5KR7G/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-02T04:32:14Z","links":{"resolver":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G","bundle":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/bundle.json","state":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BCK42GOFGTCL64ZT25MAA5KR7G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BCK42GOFGTCL64ZT25MAA5KR7G","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":"a68ca45b888d0240a9576a22b1769f0c5b64ec36ee77246ead5ed3968769b89c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-10-17T00:11:20Z","title_canon_sha256":"a411eccf4744f8a3e6f950a467443b444291baa447ce91619d16c9bdce5a9c0f"},"schema_version":"1.0","source":{"id":"1810.07324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.07324","created_at":"2026-05-18T00:02:58Z"},{"alias_kind":"arxiv_version","alias_value":"1810.07324v1","created_at":"2026-05-18T00:02:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07324","created_at":"2026-05-18T00:02:58Z"},{"alias_kind":"pith_short_12","alias_value":"BCK42GOFGTCL","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"BCK42GOFGTCL64ZT","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"BCK42GOF","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:174ae8b270ea584c41b20419fdabe11848f30fa5136aff29d27312e989e5d1f6","target":"graph","created_at":"2026-05-18T00:02:58Z","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":"Graph clustering has many important applications in computing, but due to the increasing sizes of graphs, even traditionally fast clustering methods can be computationally expensive for real-world graphs of interest. Scalability problems led to the development of local graph clustering algorithms that come with a variety of theoretical guarantees. Rather than return a global clustering of the entire graph, local clustering algorithms return a single cluster around a given seed node or set of seed nodes. These algorithms improve scalability because they use time and memory resources that depend","authors_text":"David F. Gleich, Kimon Fountoulakis, Michael W. Mahoney","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-10-17T00:11:20Z","title":"A Short Introduction to Local Graph Clustering Methods and Software"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.07324","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:3828b486661322eb716ea0fa238994f1bdcffd73a0541430bdf01ae1abdd4849","target":"record","created_at":"2026-05-18T00:02:58Z","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":"a68ca45b888d0240a9576a22b1769f0c5b64ec36ee77246ead5ed3968769b89c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-10-17T00:11:20Z","title_canon_sha256":"a411eccf4744f8a3e6f950a467443b444291baa447ce91619d16c9bdce5a9c0f"},"schema_version":"1.0","source":{"id":"1810.07324","kind":"arxiv","version":1}},"canonical_sha256":"0895cd19c534c4bf7333d758007551f98eb1c265f5c6fba402cf0bde4bdb6596","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0895cd19c534c4bf7333d758007551f98eb1c265f5c6fba402cf0bde4bdb6596","first_computed_at":"2026-05-18T00:02:58.818292Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:58.818292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0nhbImVF647UpZtDGt1JkEXGZQgJSv3jpvFyCjdBDiYG+orx7aoJuW2GzAITF7Comrq0Ztf5olo0/t8NomG8AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:58.818722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.07324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3828b486661322eb716ea0fa238994f1bdcffd73a0541430bdf01ae1abdd4849","sha256:174ae8b270ea584c41b20419fdabe11848f30fa5136aff29d27312e989e5d1f6"],"state_sha256":"aa0a283dc96d53f44b910f2e125f5cf57b94511007c97e248b6d3e11767a2f4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p00rCi2Kui6YcgIjsENDRn1FLkZxW3UTYktP/Md2LkbtT3ZtyJUXzb3QDxOnSzs3R2z9hV/ymAiSaPcqetzdAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:32:14.320987Z","bundle_sha256":"6b6e5a9a0aeae3828cc5e5664b2ee06a77d3ffea59d0b17512e357e6873717be"}}