{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2005:GKNIM2BVJN53UCGV3A3X3MKCSZ","short_pith_number":"pith:GKNIM2BV","schema_version":"1.0","canonical_sha256":"329a8668354b7bba08d5d8377db14296726fc2081228dc1d93c6c43d9f4969a7","source":{"kind":"arxiv","id":"cs/0504107","version":2},"attestation_state":"computed","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,"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0504107","created_at":"2026-05-18T01:08:55.083662+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0504107v2","created_at":"2026-05-18T01:08:55.083662+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0504107","created_at":"2026-05-18T01:08:55.083662+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKNIM2BVJN53","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKNIM2BVJN53UCGV","created_at":"2026-05-18T12:25:53.335082+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKNIM2BV","created_at":"2026-05-18T12:25:53.335082+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ","json":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ.json","graph_json":"https://pith.science/api/pith-number/GKNIM2BVJN53UCGV3A3X3MKCSZ/graph.json","events_json":"https://pith.science/api/pith-number/GKNIM2BVJN53UCGV3A3X3MKCSZ/events.json","paper":"https://pith.science/paper/GKNIM2BV"},"agent_actions":{"view_html":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ","download_json":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ.json","view_paper":"https://pith.science/paper/GKNIM2BV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0504107&json=true","fetch_graph":"https://pith.science/api/pith-number/GKNIM2BVJN53UCGV3A3X3MKCSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/GKNIM2BVJN53UCGV3A3X3MKCSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/action/storage_attestation","attest_author":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/action/author_attestation","sign_citation":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/action/citation_signature","submit_replication":"https://pith.science/pith/GKNIM2BVJN53UCGV3A3X3MKCSZ/action/replication_record"}},"created_at":"2026-05-18T01:08:55.083662+00:00","updated_at":"2026-05-18T01:08:55.083662+00:00"}