{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WVR5T44VG4VPR6W34I6GBD4M4W","short_pith_number":"pith:WVR5T44V","schema_version":"1.0","canonical_sha256":"b563d9f395372af8fadbe23c608f8ce5818f330c84c0dc7f40dd58f976332759","source":{"kind":"arxiv","id":"1212.5981","version":2},"attestation_state":"computed","paper":{"title":"Core organization of directed complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math-ph","math.MP","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"J. F. F. Mendes, N. Azimi-Tafreshi, S. N. Dorogovtsev","submitted_at":"2012-12-25T01:17:14Z","abstract_excerpt":"The recursive removal of leaves (dead end vertices) and their neighbors from an undirected network results, when this pruning algorithm stops, in a so-called core of the network. This specific subgraph should be distinguished from $k$-cores, which are principally different subgraphs in networks. If the vertex mean degree of a network is sufficiently large, the core is a giant cluster containing a finite fraction of vertices. We find that generalization of this pruning algorithm to directed networks provides a significantly more complex picture of cores. By implementing a rate equation approach"},"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":"1212.5981","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-12-25T01:17:14Z","cross_cats_sorted":["cs.SI","math-ph","math.MP","physics.soc-ph"],"title_canon_sha256":"8e0fd1ac84e4f6429b0b9f839dff0a1247bd08826dd5fb26f56fdb8091e477f4","abstract_canon_sha256":"9cff245da171cf91c9c9bb42e9cf9459143872718480da3b9a167c006d1ea63b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:52:28.621931Z","signature_b64":"E+Q8haUX8aLbWx7TSv8zm1uFObOlqHhaahJi44aVl3zXIpVPsbUBfjVzTAWIcgSpdFiWjzeh3oOUHkGi/tn+DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b563d9f395372af8fadbe23c608f8ce5818f330c84c0dc7f40dd58f976332759","last_reissued_at":"2026-05-18T01:52:28.621521Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:52:28.621521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Core organization of directed complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI","math-ph","math.MP","physics.soc-ph"],"primary_cat":"cond-mat.dis-nn","authors_text":"J. F. F. Mendes, N. Azimi-Tafreshi, S. N. Dorogovtsev","submitted_at":"2012-12-25T01:17:14Z","abstract_excerpt":"The recursive removal of leaves (dead end vertices) and their neighbors from an undirected network results, when this pruning algorithm stops, in a so-called core of the network. This specific subgraph should be distinguished from $k$-cores, which are principally different subgraphs in networks. If the vertex mean degree of a network is sufficiently large, the core is a giant cluster containing a finite fraction of vertices. We find that generalization of this pruning algorithm to directed networks provides a significantly more complex picture of cores. By implementing a rate equation approach"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.5981","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":"1212.5981","created_at":"2026-05-18T01:52:28.621584+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.5981v2","created_at":"2026-05-18T01:52:28.621584+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.5981","created_at":"2026-05-18T01:52:28.621584+00:00"},{"alias_kind":"pith_short_12","alias_value":"WVR5T44VG4VP","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_16","alias_value":"WVR5T44VG4VPR6W3","created_at":"2026-05-18T12:27:27.928770+00:00"},{"alias_kind":"pith_short_8","alias_value":"WVR5T44V","created_at":"2026-05-18T12:27:27.928770+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/WVR5T44VG4VPR6W34I6GBD4M4W","json":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W.json","graph_json":"https://pith.science/api/pith-number/WVR5T44VG4VPR6W34I6GBD4M4W/graph.json","events_json":"https://pith.science/api/pith-number/WVR5T44VG4VPR6W34I6GBD4M4W/events.json","paper":"https://pith.science/paper/WVR5T44V"},"agent_actions":{"view_html":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W","download_json":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W.json","view_paper":"https://pith.science/paper/WVR5T44V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.5981&json=true","fetch_graph":"https://pith.science/api/pith-number/WVR5T44VG4VPR6W34I6GBD4M4W/graph.json","fetch_events":"https://pith.science/api/pith-number/WVR5T44VG4VPR6W34I6GBD4M4W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W/action/storage_attestation","attest_author":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W/action/author_attestation","sign_citation":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W/action/citation_signature","submit_replication":"https://pith.science/pith/WVR5T44VG4VPR6W34I6GBD4M4W/action/replication_record"}},"created_at":"2026-05-18T01:52:28.621584+00:00","updated_at":"2026-05-18T01:52:28.621584+00:00"}