{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:A2HPJXR2UQQ5KTZKW3LKNQHWJS","short_pith_number":"pith:A2HPJXR2","canonical_record":{"source":{"id":"2412.03008","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-12-04T03:56:14Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"e89c7c7e5dc1cf21bc2cdb613e6bc93f58713146ff128dd51d8ed96c6ea74f76","abstract_canon_sha256":"cf7b6c08106bfc53a4b23dd57645d2e09f717e9601ec8d51a8ac11e9e1571527"},"schema_version":"1.0"},"canonical_sha256":"068ef4de3aa421d54f2ab6d6a6c0f64caf96ec3b2100a535d477d13b4869b8c1","source":{"kind":"arxiv","id":"2412.03008","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03008","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03008v2","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03008","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"A2HPJXR2UQQ5","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"pith_short_16","alias_value":"A2HPJXR2UQQ5KTZK","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"pith_short_8","alias_value":"A2HPJXR2","created_at":"2026-06-04T01:08:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:A2HPJXR2UQQ5KTZKW3LKNQHWJS","target":"record","payload":{"canonical_record":{"source":{"id":"2412.03008","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-12-04T03:56:14Z","cross_cats_sorted":["cs.DS","cs.LG"],"title_canon_sha256":"e89c7c7e5dc1cf21bc2cdb613e6bc93f58713146ff128dd51d8ed96c6ea74f76","abstract_canon_sha256":"cf7b6c08106bfc53a4b23dd57645d2e09f717e9601ec8d51a8ac11e9e1571527"},"schema_version":"1.0"},"canonical_sha256":"068ef4de3aa421d54f2ab6d6a6c0f64caf96ec3b2100a535d477d13b4869b8c1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:08:26.826415Z","signature_b64":"0JmV9078OxV+/sVRCTvk81zFB4ATRD9FS40lyjXIAh2Qvt35IpU77GH65b/CQOATUwmc2zfwSJcvYM8HjXD/CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"068ef4de3aa421d54f2ab6d6a6c0f64caf96ec3b2100a535d477d13b4869b8c1","last_reissued_at":"2026-06-04T01:08:26.825625Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:08:26.825625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2412.03008","source_version":2,"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-06-04T01:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4cjRL9/cdMckYkWkWxHeEhXF2CDxezZSUBiK5+JOO05T61Ho4SNCmDG0x3e14XmPVGM63vchHusj8a5YSThOAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:08:28.583370Z"},"content_sha256":"d405bc253e4ce1c65984bd03a34ecbe700bac6cf18660357ecdbb69749171bf5","schema_version":"1.0","event_id":"sha256:d405bc253e4ce1c65984bd03a34ecbe700bac6cf18660357ecdbb69749171bf5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:A2HPJXR2UQQ5KTZKW3LKNQHWJS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Clustering on Complex Graphs and Complex Hypergraphs","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.DS","cs.LG"],"primary_cat":"cs.SI","authors_text":"Dongqi Fu, Hengyu Liu, Jingrui He, Zihao Li","submitted_at":"2024-12-04T03:56:14Z","abstract_excerpt":"Local/seeded clustering aims to find a compact cluster near the given starting instances. While most existing studies on graph clustering assume a discrete graph setting (i.e., unweighted, undirected graphs without self-loops), real-world graphs can be more complex. In this paper, we extend the classic non-approximating Andersen-Chung-Lang (ACL) clustering algorithm beyond discrete graphs and generalize its quadratic optimality to a wider range of complex graphs, including weighted, directed, and self-looped graphs and hypergraphs with edge-dependent vertex weights. Specifically, by leveraging"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03008","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2412.03008/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-04T01:08:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dBW1hR1urohcz65Am3ILRJEvdEZK5SgR5rEx27qswAXgFNNOjEoUN6SrGXkodRBfPkjTtfmLVgLShDHALSSwBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T13:08:28.583738Z"},"content_sha256":"588c19d2c96e0d18ec3a98eb09956506cdbfd22f3ebde5aabf4ce0a09276ad9e","schema_version":"1.0","event_id":"sha256:588c19d2c96e0d18ec3a98eb09956506cdbfd22f3ebde5aabf4ce0a09276ad9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/bundle.json","state_url":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/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-29T13:08:28Z","links":{"resolver":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS","bundle":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/bundle.json","state":"https://pith.science/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A2HPJXR2UQQ5KTZKW3LKNQHWJS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:A2HPJXR2UQQ5KTZKW3LKNQHWJS","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":"cf7b6c08106bfc53a4b23dd57645d2e09f717e9601ec8d51a8ac11e9e1571527","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-12-04T03:56:14Z","title_canon_sha256":"e89c7c7e5dc1cf21bc2cdb613e6bc93f58713146ff128dd51d8ed96c6ea74f76"},"schema_version":"1.0","source":{"id":"2412.03008","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2412.03008","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"arxiv_version","alias_value":"2412.03008v2","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2412.03008","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"pith_short_12","alias_value":"A2HPJXR2UQQ5","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"pith_short_16","alias_value":"A2HPJXR2UQQ5KTZK","created_at":"2026-06-04T01:08:26Z"},{"alias_kind":"pith_short_8","alias_value":"A2HPJXR2","created_at":"2026-06-04T01:08:26Z"}],"graph_snapshots":[{"event_id":"sha256:588c19d2c96e0d18ec3a98eb09956506cdbfd22f3ebde5aabf4ce0a09276ad9e","target":"graph","created_at":"2026-06-04T01:08:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2412.03008/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Local/seeded clustering aims to find a compact cluster near the given starting instances. While most existing studies on graph clustering assume a discrete graph setting (i.e., unweighted, undirected graphs without self-loops), real-world graphs can be more complex. In this paper, we extend the classic non-approximating Andersen-Chung-Lang (ACL) clustering algorithm beyond discrete graphs and generalize its quadratic optimality to a wider range of complex graphs, including weighted, directed, and self-looped graphs and hypergraphs with edge-dependent vertex weights. Specifically, by leveraging","authors_text":"Dongqi Fu, Hengyu Liu, Jingrui He, Zihao Li","cross_cats":["cs.DS","cs.LG"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-12-04T03:56:14Z","title":"Local Clustering on Complex Graphs and Complex Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2412.03008","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:d405bc253e4ce1c65984bd03a34ecbe700bac6cf18660357ecdbb69749171bf5","target":"record","created_at":"2026-06-04T01:08:26Z","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":"cf7b6c08106bfc53a4b23dd57645d2e09f717e9601ec8d51a8ac11e9e1571527","cross_cats_sorted":["cs.DS","cs.LG"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SI","submitted_at":"2024-12-04T03:56:14Z","title_canon_sha256":"e89c7c7e5dc1cf21bc2cdb613e6bc93f58713146ff128dd51d8ed96c6ea74f76"},"schema_version":"1.0","source":{"id":"2412.03008","kind":"arxiv","version":2}},"canonical_sha256":"068ef4de3aa421d54f2ab6d6a6c0f64caf96ec3b2100a535d477d13b4869b8c1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"068ef4de3aa421d54f2ab6d6a6c0f64caf96ec3b2100a535d477d13b4869b8c1","first_computed_at":"2026-06-04T01:08:26.825625Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:08:26.825625Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0JmV9078OxV+/sVRCTvk81zFB4ATRD9FS40lyjXIAh2Qvt35IpU77GH65b/CQOATUwmc2zfwSJcvYM8HjXD/CQ==","signature_status":"signed_v1","signed_at":"2026-06-04T01:08:26.826415Z","signed_message":"canonical_sha256_bytes"},"source_id":"2412.03008","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d405bc253e4ce1c65984bd03a34ecbe700bac6cf18660357ecdbb69749171bf5","sha256:588c19d2c96e0d18ec3a98eb09956506cdbfd22f3ebde5aabf4ce0a09276ad9e"],"state_sha256":"c12c1706207da0929a03d14b1dbd714183489fcd4e972c7ef76b9ae8fdbb089c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21xlDXcgr6mTFMxKLlviP+48m3pcaRv75tjU7uvxhRtqugriuiYTIVQij1EiY+YHWsxe+cvoVfVYH7HRhoAeDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T13:08:28.585645Z","bundle_sha256":"3474d515addfe3f36a60c709b124bec19e793d59d39b24d0fc5e7d741c427496"}}