{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EXYFRG3ATOAXWZ2NL6II7CHJFJ","short_pith_number":"pith:EXYFRG3A","schema_version":"1.0","canonical_sha256":"25f0589b609b817b674d5f908f88e92a54d5314ddb253ea71be9e8c7ff9aac29","source":{"kind":"arxiv","id":"1809.00296","version":1},"attestation_state":"computed","paper":{"title":"Link deletion in directed complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"G. Ambika, G. Kashyap","submitted_at":"2018-09-02T05:35:15Z","abstract_excerpt":"We present a systematic and detailed study of the robustness of directed networks under random and targeted removal of links. We work with a set of network models of random and scale free type, generated with specific features of clustering and assortativity. Various strategies like random deletion of links, or deletions based on betweenness centrality and degrees of source and target nodes, are used to breakdown the networks. The robustness of the networks to the sustained loss of links is studied in terms of the sizes of the connected components and the inverse path lengths. The effects of c"},"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":"1809.00296","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2018-09-02T05:35:15Z","cross_cats_sorted":[],"title_canon_sha256":"851c5d00a8662bfd8beeb7a37d5101e8e4dea0bcb44e615b590db0428ce5e66c","abstract_canon_sha256":"ec590f302cae76b4a18403e2ab621d4c8e4925985b4ed77e68e3adc3ab873f5b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:15.092202Z","signature_b64":"vMqIk/xyJs/5hpadYm/wtYHS8fQ+htf2yaS2NQ9PYbQj8Nucnjv7gdKmNqJKgQ/XSGvRrFPG6Lnz1Uwoy9/rCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25f0589b609b817b674d5f908f88e92a54d5314ddb253ea71be9e8c7ff9aac29","last_reissued_at":"2026-05-18T00:03:15.091574Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:15.091574Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Link deletion in directed complex networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"physics.soc-ph","authors_text":"G. Ambika, G. Kashyap","submitted_at":"2018-09-02T05:35:15Z","abstract_excerpt":"We present a systematic and detailed study of the robustness of directed networks under random and targeted removal of links. We work with a set of network models of random and scale free type, generated with specific features of clustering and assortativity. Various strategies like random deletion of links, or deletions based on betweenness centrality and degrees of source and target nodes, are used to breakdown the networks. The robustness of the networks to the sustained loss of links is studied in terms of the sizes of the connected components and the inverse path lengths. The effects of c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.00296","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":"1809.00296","created_at":"2026-05-18T00:03:15.091683+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.00296v1","created_at":"2026-05-18T00:03:15.091683+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.00296","created_at":"2026-05-18T00:03:15.091683+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXYFRG3ATOAX","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXYFRG3ATOAXWZ2N","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXYFRG3A","created_at":"2026-05-18T12:32:22.470017+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/EXYFRG3ATOAXWZ2NL6II7CHJFJ","json":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ.json","graph_json":"https://pith.science/api/pith-number/EXYFRG3ATOAXWZ2NL6II7CHJFJ/graph.json","events_json":"https://pith.science/api/pith-number/EXYFRG3ATOAXWZ2NL6II7CHJFJ/events.json","paper":"https://pith.science/paper/EXYFRG3A"},"agent_actions":{"view_html":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ","download_json":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ.json","view_paper":"https://pith.science/paper/EXYFRG3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.00296&json=true","fetch_graph":"https://pith.science/api/pith-number/EXYFRG3ATOAXWZ2NL6II7CHJFJ/graph.json","fetch_events":"https://pith.science/api/pith-number/EXYFRG3ATOAXWZ2NL6II7CHJFJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ/action/storage_attestation","attest_author":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ/action/author_attestation","sign_citation":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ/action/citation_signature","submit_replication":"https://pith.science/pith/EXYFRG3ATOAXWZ2NL6II7CHJFJ/action/replication_record"}},"created_at":"2026-05-18T00:03:15.091683+00:00","updated_at":"2026-05-18T00:03:15.091683+00:00"}