{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IL3MPFZ4U7E3IT2BUHVUGJIZEQ","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":"f9db139d349d1898447f743c7b1b378c2e56644e6ef07f260a83260f33dd9800","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-26T16:06:17Z","title_canon_sha256":"4bcf4e98b2a56b14a884acea86721a801686f3d5085ab0407ee20975720f1b85"},"schema_version":"1.0","source":{"id":"1811.10470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10470","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10470v2","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10470","created_at":"2026-05-17T23:57:46Z"},{"alias_kind":"pith_short_12","alias_value":"IL3MPFZ4U7E3","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IL3MPFZ4U7E3IT2B","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IL3MPFZ4","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:71f690f9f69c6e423b7ef95cd81fe2fbf5f454219f160c5d8179e5dbecb14623","target":"graph","created_at":"2026-05-17T23:57:46Z","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":"Statistical analysis of large and sparse graphs is a challenging problem in data science due to the high dimensionality and nonlinearity of the problem. This paper presents a fast and scalable algorithm for partitioning such graphs into disjoint groups based on observed graph distances from a set of reference nodes. The resulting partition provides a low-dimensional approximation of the full distance matrix which helps to reveal global structural properties of the graph using only small samples of the distance matrix. The presented algorithm is inspired by the information-theoretic minimum des","authors_text":"Hannu Reittu, Lasse Leskel\\\"a, Marco Fiorucci, Tomi R\\\"aty","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-26T16:06:17Z","title":"Analysis of large sparse graphs using regular decomposition of graph distance matrices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10470","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:5ed10e6320c5cf7fee035cee01c22296c3dc855169614e657c581ceed8dfbd4c","target":"record","created_at":"2026-05-17T23:57:46Z","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":"f9db139d349d1898447f743c7b1b378c2e56644e6ef07f260a83260f33dd9800","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-26T16:06:17Z","title_canon_sha256":"4bcf4e98b2a56b14a884acea86721a801686f3d5085ab0407ee20975720f1b85"},"schema_version":"1.0","source":{"id":"1811.10470","kind":"arxiv","version":2}},"canonical_sha256":"42f6c7973ca7c9b44f41a1eb432519240a2766adfe9e35bb08502f3dcce085cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42f6c7973ca7c9b44f41a1eb432519240a2766adfe9e35bb08502f3dcce085cd","first_computed_at":"2026-05-17T23:57:46.392098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:46.392098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z6OkdjdGUlfMiCFGb6Pe/fAMDAu/ETmuBgPIzoHwwycR1C39nSHDFTsYmsh71aoL7i8NnWEu8yLyyIpUHLTzBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:46.392757Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ed10e6320c5cf7fee035cee01c22296c3dc855169614e657c581ceed8dfbd4c","sha256:71f690f9f69c6e423b7ef95cd81fe2fbf5f454219f160c5d8179e5dbecb14623"],"state_sha256":"c4b42648deb53a038ca074a5a3bc5eade350671f9b64fe7e8e73159187a28a80"}