{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:BCK42GOFGTCL64ZT25MAA5KR7G","short_pith_number":"pith:BCK42GOF","schema_version":"1.0","canonical_sha256":"0895cd19c534c4bf7333d758007551f98eb1c265f5c6fba402cf0bde4bdb6596","source":{"kind":"arxiv","id":"1810.07324","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.07324","created_at":"2026-05-18T00:02:58.818365+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.07324v1","created_at":"2026-05-18T00:02:58.818365+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.07324","created_at":"2026-05-18T00:02:58.818365+00:00"},{"alias_kind":"pith_short_12","alias_value":"BCK42GOFGTCL","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"BCK42GOFGTCL64ZT","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"BCK42GOF","created_at":"2026-05-18T12:32:13.499390+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/BCK42GOFGTCL64ZT25MAA5KR7G","json":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G.json","graph_json":"https://pith.science/api/pith-number/BCK42GOFGTCL64ZT25MAA5KR7G/graph.json","events_json":"https://pith.science/api/pith-number/BCK42GOFGTCL64ZT25MAA5KR7G/events.json","paper":"https://pith.science/paper/BCK42GOF"},"agent_actions":{"view_html":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G","download_json":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G.json","view_paper":"https://pith.science/paper/BCK42GOF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.07324&json=true","fetch_graph":"https://pith.science/api/pith-number/BCK42GOFGTCL64ZT25MAA5KR7G/graph.json","fetch_events":"https://pith.science/api/pith-number/BCK42GOFGTCL64ZT25MAA5KR7G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/action/storage_attestation","attest_author":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/action/author_attestation","sign_citation":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/action/citation_signature","submit_replication":"https://pith.science/pith/BCK42GOFGTCL64ZT25MAA5KR7G/action/replication_record"}},"created_at":"2026-05-18T00:02:58.818365+00:00","updated_at":"2026-05-18T00:02:58.818365+00:00"}