{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2005:GKNIM2BVJN53UCGV3A3X3MKCSZ","short_pith_number":"pith:GKNIM2BV","canonical_record":{"source":{"id":"cs/0504107","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2005-04-28T13:53:36Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"b6ab5f776ce4d486b60ef25ca92c3bc28da0bdde7e393cc670754ef267a6b350","abstract_canon_sha256":"fa2748fa384bc8773ed9d51d5940958c8a1ec948099dcfa8518a399c63f9b3e2"},"schema_version":"1.0"},"canonical_sha256":"329a8668354b7bba08d5d8377db14296726fc2081228dc1d93c6c43d9f4969a7","source":{"kind":"arxiv","id":"cs/0504107","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0504107","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0504107v2","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0504107","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"GKNIM2BVJN53","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"GKNIM2BVJN53UCGV","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"GKNIM2BV","created_at":"2026-05-18T12:25:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2005:GKNIM2BVJN53UCGV3A3X3MKCSZ","target":"record","payload":{"canonical_record":{"source":{"id":"cs/0504107","kind":"arxiv","version":2},"metadata":{"license":"","primary_cat":"cs.NI","submitted_at":"2005-04-28T13:53:36Z","cross_cats_sorted":["cs.GR"],"title_canon_sha256":"b6ab5f776ce4d486b60ef25ca92c3bc28da0bdde7e393cc670754ef267a6b350","abstract_canon_sha256":"fa2748fa384bc8773ed9d51d5940958c8a1ec948099dcfa8518a399c63f9b3e2"},"schema_version":"1.0"},"canonical_sha256":"329a8668354b7bba08d5d8377db14296726fc2081228dc1d93c6c43d9f4969a7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:55.084109Z","signature_b64":"cRdXJtDOqR0QOKALauJ0ZYM4kCFJ5j7VT+JpUJ9GXfZ/BXVaeACCyK4+aBrCbJ9Ve7fvuepk1oY1zfXqNILWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"329a8668354b7bba08d5d8377db14296726fc2081228dc1d93c6c43d9f4969a7","last_reissued_at":"2026-05-18T01:08:55.083573Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:55.083573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"cs/0504107","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-05-18T01:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oj1P1p+388raA/Shv9RceSAMntg+CbjTGY7srrCrTPZcuoROcfLijajObv2YYH5VS+hABS3E1Ps0qdhRdGOzDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:35:43.068004Z"},"content_sha256":"fc692656efe33a59fc5752fe97a61ca132f37112ac8785b22cdc137b4f40adc5","schema_version":"1.0","event_id":"sha256:fc692656efe33a59fc5752fe97a61ca132f37112ac8785b22cdc137b4f40adc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2005:GKNIM2BVJN53UCGV3A3X3MKCSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k-core decomposition: a tool for the visualization of large scale networks","license":"","headline":"","cross_cats":["cs.GR"],"primary_cat":"cs.NI","authors_text":"Alain Barrat (LPTO), Alessandro Vespignani (LPTO), Jos\\'e Ignacio Alvarez-Hamelin (LPTO), Luca Dall'Asta (LPTO)","submitted_at":"2005-04-28T13:53:36Z","abstract_excerpt":"We use the k-core decomposition to visualize large scale complex networks in two dimensions. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by progressively focusing on their central cores. By using this strategy we develop a general visualization algorithm that can be used to compare the structural properties of various networks and highlight their hierarchical structure. The low computational complexity of the algorithm, O(n+e), where 'n' is the size of the network, and 'e' is the number of edges,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0504107","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":""},"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-18T01:08:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rnpI28IQfl1j0iS6pQ5XrlTiU53U5IQlxdBXuThbqUZUO+ymj8/74NP7rBwxDfvXHeQzeYHw861kxOvwRJh1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T09:35:43.068931Z"},"content_sha256":"57f439f5d28d64495bada4db0424906b03af201c40f171688a9246c675d0ef37","schema_version":"1.0","event_id":"sha256:57f439f5d28d64495bada4db0424906b03af201c40f171688a9246c675d0ef37"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/bundle.json","state_url":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/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-08T09:35:43Z","links":{"resolver":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ","bundle":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/bundle.json","state":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2005:GKNIM2BVJN53UCGV3A3X3MKCSZ","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":"fa2748fa384bc8773ed9d51d5940958c8a1ec948099dcfa8518a399c63f9b3e2","cross_cats_sorted":["cs.GR"],"license":"","primary_cat":"cs.NI","submitted_at":"2005-04-28T13:53:36Z","title_canon_sha256":"b6ab5f776ce4d486b60ef25ca92c3bc28da0bdde7e393cc670754ef267a6b350"},"schema_version":"1.0","source":{"id":"cs/0504107","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0504107","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0504107v2","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0504107","created_at":"2026-05-18T01:08:55Z"},{"alias_kind":"pith_short_12","alias_value":"GKNIM2BVJN53","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_16","alias_value":"GKNIM2BVJN53UCGV","created_at":"2026-05-18T12:25:53Z"},{"alias_kind":"pith_short_8","alias_value":"GKNIM2BV","created_at":"2026-05-18T12:25:53Z"}],"graph_snapshots":[{"event_id":"sha256:57f439f5d28d64495bada4db0424906b03af201c40f171688a9246c675d0ef37","target":"graph","created_at":"2026-05-18T01:08:55Z","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":"We use the k-core decomposition to visualize large scale complex networks in two dimensions. This decomposition, based on a recursive pruning of the least connected vertices, allows to disentangle the hierarchical structure of networks by progressively focusing on their central cores. By using this strategy we develop a general visualization algorithm that can be used to compare the structural properties of various networks and highlight their hierarchical structure. The low computational complexity of the algorithm, O(n+e), where 'n' is the size of the network, and 'e' is the number of edges,","authors_text":"Alain Barrat (LPTO), Alessandro Vespignani (LPTO), Jos\\'e Ignacio Alvarez-Hamelin (LPTO), Luca Dall'Asta (LPTO)","cross_cats":["cs.GR"],"headline":"","license":"","primary_cat":"cs.NI","submitted_at":"2005-04-28T13:53:36Z","title":"k-core decomposition: a tool for the visualization of large scale networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0504107","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:fc692656efe33a59fc5752fe97a61ca132f37112ac8785b22cdc137b4f40adc5","target":"record","created_at":"2026-05-18T01:08:55Z","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":"fa2748fa384bc8773ed9d51d5940958c8a1ec948099dcfa8518a399c63f9b3e2","cross_cats_sorted":["cs.GR"],"license":"","primary_cat":"cs.NI","submitted_at":"2005-04-28T13:53:36Z","title_canon_sha256":"b6ab5f776ce4d486b60ef25ca92c3bc28da0bdde7e393cc670754ef267a6b350"},"schema_version":"1.0","source":{"id":"cs/0504107","kind":"arxiv","version":2}},"canonical_sha256":"329a8668354b7bba08d5d8377db14296726fc2081228dc1d93c6c43d9f4969a7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"329a8668354b7bba08d5d8377db14296726fc2081228dc1d93c6c43d9f4969a7","first_computed_at":"2026-05-18T01:08:55.083573Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:55.083573Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cRdXJtDOqR0QOKALauJ0ZYM4kCFJ5j7VT+JpUJ9GXfZ/BXVaeACCyK4+aBrCbJ9Ve7fvuepk1oY1zfXqNILWBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:55.084109Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0504107","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc692656efe33a59fc5752fe97a61ca132f37112ac8785b22cdc137b4f40adc5","sha256:57f439f5d28d64495bada4db0424906b03af201c40f171688a9246c675d0ef37"],"state_sha256":"f9bec7dc1a86f774ef4a02717ad1e4487253db962e650bd55d06ca1f7b76e0e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+JNlR1btOBHmoJ4eMaLx9VRg/eNR2cHuatNPBOu9AdxQ9v/of5vHKKnAW4A9+l7WSAtr/+CVDM3bFStUVk6AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T09:35:43.073084Z","bundle_sha256":"e688f64d833ace15be6610621921063e5f3771dc9c49f58ef5e773e66ef131d8"}}