{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2003:VKJVPMROEAI2PDZ27LPXNM7YZL","short_pith_number":"pith:VKJVPMRO","schema_version":"1.0","canonical_sha256":"aa9357b22e2011a78f3afadf76b3f8cafec25bac1b5edde3a8d718b698b66b44","source":{"kind":"arxiv","id":"cs/0310049","version":1},"attestation_state":"computed","paper":{"title":"An O(m) Algorithm for Cores Decomposition of Networks","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"M. Zaversnik, V. Batagelj","submitted_at":"2003-10-25T16:03:58Z","abstract_excerpt":"The structure of large networks can be revealed by partitioning them to smaller parts, which are easier to handle. One of such decompositions is based on $k$--cores, proposed in 1983 by Seidman. In the paper an efficient, $O(m)$, $m$ is the number of lines, algorithm for determining the cores decomposition of a given network is presented."},"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/0310049","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2003-10-25T16:03:58Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9def693d7ab10ee85ac87f7794e79b761d959d4272e8ea116febf7db3896907a","abstract_canon_sha256":"185235c716d979a79b78c08a9ab1da703c3b0ef20f8507764c88a084d651a8df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:54.939532Z","signature_b64":"LxleDlqzSYqcyyYYfAmiy3iR08osvTLNyH5oVP+BNzRPBjCJmgAzjgrAcfhYnDbLsnpK6pVnAsqjxiJnKPc4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9357b22e2011a78f3afadf76b3f8cafec25bac1b5edde3a8d718b698b66b44","last_reissued_at":"2026-05-18T03:35:54.938744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:54.938744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An O(m) Algorithm for Cores Decomposition of Networks","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"M. Zaversnik, V. Batagelj","submitted_at":"2003-10-25T16:03:58Z","abstract_excerpt":"The structure of large networks can be revealed by partitioning them to smaller parts, which are easier to handle. One of such decompositions is based on $k$--cores, proposed in 1983 by Seidman. In the paper an efficient, $O(m)$, $m$ is the number of lines, algorithm for determining the cores decomposition of a given network is presented."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0310049","kind":"arxiv","version":1},"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/0310049","created_at":"2026-05-18T03:35:54.938877+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0310049v1","created_at":"2026-05-18T03:35:54.938877+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0310049","created_at":"2026-05-18T03:35:54.938877+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKJVPMROEAI2","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKJVPMROEAI2PDZ2","created_at":"2026-05-18T12:25:52.051335+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKJVPMRO","created_at":"2026-05-18T12:25:52.051335+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2306.07927","citing_title":"A Survey of Densest Subgraph Discovery on Large Graphs","ref_index":14,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15173","citing_title":"Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs","ref_index":9,"is_internal_anchor":true},{"citing_arxiv_id":"2604.06391","citing_title":"Toward a universal foundation model for graph-structured data","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL","json":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL.json","graph_json":"https://pith.science/api/pith-number/VKJVPMROEAI2PDZ27LPXNM7YZL/graph.json","events_json":"https://pith.science/api/pith-number/VKJVPMROEAI2PDZ27LPXNM7YZL/events.json","paper":"https://pith.science/paper/VKJVPMRO"},"agent_actions":{"view_html":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL","download_json":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL.json","view_paper":"https://pith.science/paper/VKJVPMRO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0310049&json=true","fetch_graph":"https://pith.science/api/pith-number/VKJVPMROEAI2PDZ27LPXNM7YZL/graph.json","fetch_events":"https://pith.science/api/pith-number/VKJVPMROEAI2PDZ27LPXNM7YZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL/action/storage_attestation","attest_author":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL/action/author_attestation","sign_citation":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL/action/citation_signature","submit_replication":"https://pith.science/pith/VKJVPMROEAI2PDZ27LPXNM7YZL/action/replication_record"}},"created_at":"2026-05-18T03:35:54.938877+00:00","updated_at":"2026-05-18T03:35:54.938877+00:00"}