{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:WUWS6Z3IETY5IWGEDEBVKLRCT4","short_pith_number":"pith:WUWS6Z3I","canonical_record":{"source":{"id":"1708.08436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-28T17:46:48Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"92d06a2d22dec68558d5335259a238ab767a04c60ceed8c2680d07736ff93c7c","abstract_canon_sha256":"9e179e63f262c79dbdb4f21455b7c659bef766a992ae16b5791e485c4b0600bd"},"schema_version":"1.0"},"canonical_sha256":"b52d2f676824f1d458c41903552e229f35c71c2ed8747969bbdabf3c57c7061c","source":{"kind":"arxiv","id":"1708.08436","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08436","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08436v3","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08436","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"WUWS6Z3IETY5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WUWS6Z3IETY5IWGE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WUWS6Z3I","created_at":"2026-05-18T12:31:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:WUWS6Z3IETY5IWGEDEBVKLRCT4","target":"record","payload":{"canonical_record":{"source":{"id":"1708.08436","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-28T17:46:48Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"92d06a2d22dec68558d5335259a238ab767a04c60ceed8c2680d07736ff93c7c","abstract_canon_sha256":"9e179e63f262c79dbdb4f21455b7c659bef766a992ae16b5791e485c4b0600bd"},"schema_version":"1.0"},"canonical_sha256":"b52d2f676824f1d458c41903552e229f35c71c2ed8747969bbdabf3c57c7061c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:01.204661Z","signature_b64":"9xcBpoGLhI74e1axCFKSyt4/jgKZUv1psn9cwmQzgMOnkcFrDwKhQA9/m0Q5qvAU9X9KqHIPGLks1R4qq858Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b52d2f676824f1d458c41903552e229f35c71c2ed8747969bbdabf3c57c7061c","last_reissued_at":"2026-05-17T23:55:01.204138Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:01.204138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.08436","source_version":3,"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-17T23:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X+AhjmAoa1ii6TM20FhxIeE6nR/ZwxGzzXLChpbMsotNtFIakYs7DtEYevygaHv6ps7lWtyURjK/efq7+ZIuCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:53:32.320780Z"},"content_sha256":"473531b083d7332d2cd5dec1024ca6153309b720bdf879cc92bd72b604fde500","schema_version":"1.0","event_id":"sha256:473531b083d7332d2cd5dec1024ca6153309b720bdf879cc92bd72b604fde500"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:WUWS6Z3IETY5IWGEDEBVKLRCT4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Sparsification of Simplicial Complexes for Clustering and Label Propagation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.CG","authors_text":"Bei Wang, Braxton Osting, Sourabh Palande","submitted_at":"2017-08-28T17:46:48Z","abstract_excerpt":"As a generalization of the use of graphs to describe pairwise interactions, simplicial complexes can be used to model higher-order interactions between three or more objects in complex systems. There has been a recent surge in activity for the development of data analysis methods applicable to simplicial complexes, including techniques based on computational topology, higher-order random processes, generalized Cheeger inequalities, isoperimetric inequalities, and spectral methods. In particular, spectral learning methods (e.g. label propagation and clustering) that directly operate on simplici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08436","kind":"arxiv","version":3},"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-17T23:55:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ox+LOP/Ew4fLN+GomlQv6SNxaJsMSlqTtV+BaNfz1doHnuundtlOq/BRSGgLS2eoMNTn+2VkWcZGhl9sxQAnDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T08:53:32.321141Z"},"content_sha256":"6200c562a253f4b1c6893ff7c088632048131b3b5b429a420b29ae140e5c1e45","schema_version":"1.0","event_id":"sha256:6200c562a253f4b1c6893ff7c088632048131b3b5b429a420b29ae140e5c1e45"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WUWS6Z3IETY5IWGEDEBVKLRCT4/bundle.json","state_url":"https://pith.science/pith/WUWS6Z3IETY5IWGEDEBVKLRCT4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WUWS6Z3IETY5IWGEDEBVKLRCT4/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-26T08:53:32Z","links":{"resolver":"https://pith.science/pith/WUWS6Z3IETY5IWGEDEBVKLRCT4","bundle":"https://pith.science/pith/WUWS6Z3IETY5IWGEDEBVKLRCT4/bundle.json","state":"https://pith.science/pith/WUWS6Z3IETY5IWGEDEBVKLRCT4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WUWS6Z3IETY5IWGEDEBVKLRCT4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:WUWS6Z3IETY5IWGEDEBVKLRCT4","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":"9e179e63f262c79dbdb4f21455b7c659bef766a992ae16b5791e485c4b0600bd","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-28T17:46:48Z","title_canon_sha256":"92d06a2d22dec68558d5335259a238ab767a04c60ceed8c2680d07736ff93c7c"},"schema_version":"1.0","source":{"id":"1708.08436","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.08436","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"arxiv_version","alias_value":"1708.08436v3","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08436","created_at":"2026-05-17T23:55:01Z"},{"alias_kind":"pith_short_12","alias_value":"WUWS6Z3IETY5","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_16","alias_value":"WUWS6Z3IETY5IWGE","created_at":"2026-05-18T12:31:53Z"},{"alias_kind":"pith_short_8","alias_value":"WUWS6Z3I","created_at":"2026-05-18T12:31:53Z"}],"graph_snapshots":[{"event_id":"sha256:6200c562a253f4b1c6893ff7c088632048131b3b5b429a420b29ae140e5c1e45","target":"graph","created_at":"2026-05-17T23:55:01Z","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":"As a generalization of the use of graphs to describe pairwise interactions, simplicial complexes can be used to model higher-order interactions between three or more objects in complex systems. There has been a recent surge in activity for the development of data analysis methods applicable to simplicial complexes, including techniques based on computational topology, higher-order random processes, generalized Cheeger inequalities, isoperimetric inequalities, and spectral methods. In particular, spectral learning methods (e.g. label propagation and clustering) that directly operate on simplici","authors_text":"Bei Wang, Braxton Osting, Sourabh Palande","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-28T17:46:48Z","title":"Spectral Sparsification of Simplicial Complexes for Clustering and Label Propagation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08436","kind":"arxiv","version":3},"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:473531b083d7332d2cd5dec1024ca6153309b720bdf879cc92bd72b604fde500","target":"record","created_at":"2026-05-17T23:55:01Z","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":"9e179e63f262c79dbdb4f21455b7c659bef766a992ae16b5791e485c4b0600bd","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2017-08-28T17:46:48Z","title_canon_sha256":"92d06a2d22dec68558d5335259a238ab767a04c60ceed8c2680d07736ff93c7c"},"schema_version":"1.0","source":{"id":"1708.08436","kind":"arxiv","version":3}},"canonical_sha256":"b52d2f676824f1d458c41903552e229f35c71c2ed8747969bbdabf3c57c7061c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b52d2f676824f1d458c41903552e229f35c71c2ed8747969bbdabf3c57c7061c","first_computed_at":"2026-05-17T23:55:01.204138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:01.204138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9xcBpoGLhI74e1axCFKSyt4/jgKZUv1psn9cwmQzgMOnkcFrDwKhQA9/m0Q5qvAU9X9KqHIPGLks1R4qq858Cg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:01.204661Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.08436","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:473531b083d7332d2cd5dec1024ca6153309b720bdf879cc92bd72b604fde500","sha256:6200c562a253f4b1c6893ff7c088632048131b3b5b429a420b29ae140e5c1e45"],"state_sha256":"2be6b314d1d97e82d70b05f6872a053d8cd0802dbf10d62acaed68e7d6513431"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4fzGtSYvM1To8w522IItNm81RWr53aETMMDZXUogcDJhuHtac4KfT33iiVV91DyU/1cD1RzbNjubC0A6AxajCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T08:53:32.324289Z","bundle_sha256":"ed96a5705e4cdd2e099344e82c082343b760b254708139644664037cd155d61a"}}