{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2003:VKJVPMROEAI2PDZ27LPXNM7YZL","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":"185235c716d979a79b78c08a9ab1da703c3b0ef20f8507764c88a084d651a8df","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2003-10-25T16:03:58Z","title_canon_sha256":"9def693d7ab10ee85ac87f7794e79b761d959d4272e8ea116febf7db3896907a"},"schema_version":"1.0","source":{"id":"cs/0310049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0310049","created_at":"2026-05-18T03:35:54Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0310049v1","created_at":"2026-05-18T03:35:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0310049","created_at":"2026-05-18T03:35:54Z"},{"alias_kind":"pith_short_12","alias_value":"VKJVPMROEAI2","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_16","alias_value":"VKJVPMROEAI2PDZ2","created_at":"2026-05-18T12:25:52Z"},{"alias_kind":"pith_short_8","alias_value":"VKJVPMRO","created_at":"2026-05-18T12:25:52Z"}],"graph_snapshots":[{"event_id":"sha256:9dc760863348c33644ca1411da266ac96b29006c94503d7a0a881cadafceb3a6","target":"graph","created_at":"2026-05-18T03:35:54Z","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":"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.","authors_text":"M. Zaversnik, V. Batagelj","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"cs.DS","submitted_at":"2003-10-25T16:03:58Z","title":"An O(m) Algorithm for Cores Decomposition of Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0310049","kind":"arxiv","version":1},"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:7488e1f3164420d20119a921a2b10d1873fbb53aca5302349aceb02947d80af3","target":"record","created_at":"2026-05-18T03:35:54Z","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":"185235c716d979a79b78c08a9ab1da703c3b0ef20f8507764c88a084d651a8df","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"cs.DS","submitted_at":"2003-10-25T16:03:58Z","title_canon_sha256":"9def693d7ab10ee85ac87f7794e79b761d959d4272e8ea116febf7db3896907a"},"schema_version":"1.0","source":{"id":"cs/0310049","kind":"arxiv","version":1}},"canonical_sha256":"aa9357b22e2011a78f3afadf76b3f8cafec25bac1b5edde3a8d718b698b66b44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aa9357b22e2011a78f3afadf76b3f8cafec25bac1b5edde3a8d718b698b66b44","first_computed_at":"2026-05-18T03:35:54.938744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:54.938744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LxleDlqzSYqcyyYYfAmiy3iR08osvTLNyH5oVP+BNzRPBjCJmgAzjgrAcfhYnDbLsnpK6pVnAsqjxiJnKPc4Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:54.939532Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0310049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7488e1f3164420d20119a921a2b10d1873fbb53aca5302349aceb02947d80af3","sha256:9dc760863348c33644ca1411da266ac96b29006c94503d7a0a881cadafceb3a6"],"state_sha256":"58aba703772c625009d9873e9208a467cccecc4dfabfbbd69ae9c5cb565db2ed"}