{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3NDSPD5CYIHS3C6GNE42N7FQEU","short_pith_number":"pith:3NDSPD5C","canonical_record":{"source":{"id":"1301.1318","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-07T19:52:14Z","cross_cats_sorted":[],"title_canon_sha256":"1937c13957371a21f6fc6127dfe252b8704477580f6208480e07a194a106608b","abstract_canon_sha256":"b591c10341f2f44d3635ed322944a80d0bb700888f4f8db976e1ffc989e0d82f"},"schema_version":"1.0"},"canonical_sha256":"db47278fa2c20f2d8bc66939a6fcb025346a3c17b4e35e08105d59872dff6257","source":{"kind":"arxiv","id":"1301.1318","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1318","created_at":"2026-05-18T03:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1318v4","created_at":"2026-05-18T03:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1318","created_at":"2026-05-18T03:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"3NDSPD5CYIHS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3NDSPD5CYIHS3C6G","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3NDSPD5C","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3NDSPD5CYIHS3C6GNE42N7FQEU","target":"record","payload":{"canonical_record":{"source":{"id":"1301.1318","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-07T19:52:14Z","cross_cats_sorted":[],"title_canon_sha256":"1937c13957371a21f6fc6127dfe252b8704477580f6208480e07a194a106608b","abstract_canon_sha256":"b591c10341f2f44d3635ed322944a80d0bb700888f4f8db976e1ffc989e0d82f"},"schema_version":"1.0"},"canonical_sha256":"db47278fa2c20f2d8bc66939a6fcb025346a3c17b4e35e08105d59872dff6257","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:01:10.964562Z","signature_b64":"GTobvSQ6sJjOKtcs95vg24nOclHjyBQ5L5yCH4mPW43zi4EA9Wh7wzHKndS7kW4dOnxRNXAiZni0Uf8lgLHDAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db47278fa2c20f2d8bc66939a6fcb025346a3c17b4e35e08105d59872dff6257","last_reissued_at":"2026-05-18T03:01:10.963843Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:01:10.963843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.1318","source_version":4,"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-18T03:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YqRAp7UNLBXpjiOPuK8gJ9ab5h4vwg9u+pEsMSyixMQ+V3MT78CEOupJMbsTeuuj+peJY3mwRCBkhmPiOn3hAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:24:27.870697Z"},"content_sha256":"f624a230cc33d59ea88ce9bd789da9235969beba78230cfa9ececf6308370ab5","schema_version":"1.0","event_id":"sha256:f624a230cc33d59ea88ce9bd789da9235969beba78230cfa9ececf6308370ab5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3NDSPD5CYIHS3C6GNE42N7FQEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Eigen-updating for Spectral Graph Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Charanpal Dhanjal (LIP6), Romaric Gaudel (LIFL), St\\'ephan Cl\\'emen\\c{c}on (LTCI)","submitted_at":"2013-01-07T19:52:14Z","abstract_excerpt":"Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large scale networks and for visualisation purposes. Whereas a large number of dedicated techniques have been recently proposed for static graphs, the design of on-line graph clustering methods tailored for evolving networks is a challenging problem, and much less documented in the literature. Motivated by the broad variety of applications concerned, ranging from th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1318","kind":"arxiv","version":4},"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-18T03:01:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDrbjlSqRjrHgSuJpBqpE6x+38wBblznqF5gksu4jm1cQ3hwcIo+WZ5kVsrnrI1mlnWf73JTlEw5g5fMBz8GAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T08:24:27.871047Z"},"content_sha256":"e455fa37ea2770bf54cb83b6757a722d05ad3912f4770d9d8b264142c2b4a032","schema_version":"1.0","event_id":"sha256:e455fa37ea2770bf54cb83b6757a722d05ad3912f4770d9d8b264142c2b4a032"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3NDSPD5CYIHS3C6GNE42N7FQEU/bundle.json","state_url":"https://pith.science/pith/3NDSPD5CYIHS3C6GNE42N7FQEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3NDSPD5CYIHS3C6GNE42N7FQEU/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-26T08:24:27Z","links":{"resolver":"https://pith.science/pith/3NDSPD5CYIHS3C6GNE42N7FQEU","bundle":"https://pith.science/pith/3NDSPD5CYIHS3C6GNE42N7FQEU/bundle.json","state":"https://pith.science/pith/3NDSPD5CYIHS3C6GNE42N7FQEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3NDSPD5CYIHS3C6GNE42N7FQEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3NDSPD5CYIHS3C6GNE42N7FQEU","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":"b591c10341f2f44d3635ed322944a80d0bb700888f4f8db976e1ffc989e0d82f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-07T19:52:14Z","title_canon_sha256":"1937c13957371a21f6fc6127dfe252b8704477580f6208480e07a194a106608b"},"schema_version":"1.0","source":{"id":"1301.1318","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.1318","created_at":"2026-05-18T03:01:10Z"},{"alias_kind":"arxiv_version","alias_value":"1301.1318v4","created_at":"2026-05-18T03:01:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.1318","created_at":"2026-05-18T03:01:10Z"},{"alias_kind":"pith_short_12","alias_value":"3NDSPD5CYIHS","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3NDSPD5CYIHS3C6G","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3NDSPD5C","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:e455fa37ea2770bf54cb83b6757a722d05ad3912f4770d9d8b264142c2b4a032","target":"graph","created_at":"2026-05-18T03:01:10Z","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":"Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large scale networks and for visualisation purposes. Whereas a large number of dedicated techniques have been recently proposed for static graphs, the design of on-line graph clustering methods tailored for evolving networks is a challenging problem, and much less documented in the literature. Motivated by the broad variety of applications concerned, ranging from th","authors_text":"Charanpal Dhanjal (LIP6), Romaric Gaudel (LIFL), St\\'ephan Cl\\'emen\\c{c}on (LTCI)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-07T19:52:14Z","title":"Efficient Eigen-updating for Spectral Graph Clustering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.1318","kind":"arxiv","version":4},"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:f624a230cc33d59ea88ce9bd789da9235969beba78230cfa9ececf6308370ab5","target":"record","created_at":"2026-05-18T03:01:10Z","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":"b591c10341f2f44d3635ed322944a80d0bb700888f4f8db976e1ffc989e0d82f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-01-07T19:52:14Z","title_canon_sha256":"1937c13957371a21f6fc6127dfe252b8704477580f6208480e07a194a106608b"},"schema_version":"1.0","source":{"id":"1301.1318","kind":"arxiv","version":4}},"canonical_sha256":"db47278fa2c20f2d8bc66939a6fcb025346a3c17b4e35e08105d59872dff6257","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"db47278fa2c20f2d8bc66939a6fcb025346a3c17b4e35e08105d59872dff6257","first_computed_at":"2026-05-18T03:01:10.963843Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:01:10.963843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GTobvSQ6sJjOKtcs95vg24nOclHjyBQ5L5yCH4mPW43zi4EA9Wh7wzHKndS7kW4dOnxRNXAiZni0Uf8lgLHDAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:01:10.964562Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.1318","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f624a230cc33d59ea88ce9bd789da9235969beba78230cfa9ececf6308370ab5","sha256:e455fa37ea2770bf54cb83b6757a722d05ad3912f4770d9d8b264142c2b4a032"],"state_sha256":"d716800c43c5f694d71432dbd0586c0387f8c38d0fa46747fc155b5ac63eca73"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5UCVCyOOf+IuO6/KfkSSzxqhXrcHMSGOk4ZNoWRg2+EOXzCUXPLr0xxjLTjePGqMKew2DjMtNz4Gw4AcWuPsDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T08:24:27.873007Z","bundle_sha256":"d27b9b8488fabfcca8301686d7880f4d03de78db4301911b1ce3aae8c73f4a27"}}