{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DTYENLPZD574GKIH4XL3Z7V36D","short_pith_number":"pith:DTYENLPZ","schema_version":"1.0","canonical_sha256":"1cf046adf91f7fc32907e5d7bcfebbf0f1b19ed22cfb97eefc257fe8c92fe6fc","source":{"kind":"arxiv","id":"1805.10520","version":1},"attestation_state":"computed","paper":{"title":"NetSim -- The framework for complex network generator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Akanda Wahid -Ul- Ashraf, Katarzyna Musial, Marcin Budka","submitted_at":"2018-05-26T18:53:07Z","abstract_excerpt":"Networks are everywhere and their many types, including social networks, the Internet, food webs etc., have been studied for the last few decades. However, in real-world networks, it's hard to find examples that can be easily comparable, i.e. have the same density or even number of nodes and edges. We propose a flexible and extensible NetSim framework to understand how properties in different types of networks change with varying number of edges and vertices. Our approach enables to simulate three classical network models (random, small-world and scale-free) with easily adjustable model parame"},"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":"1805.10520","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-05-26T18:53:07Z","cross_cats_sorted":[],"title_canon_sha256":"6196518952eefa50cec62cbe2f989eaf240249844b06e2667092f57c410699d3","abstract_canon_sha256":"503accde8f10b6804e9661b9102e21bacd97a01d2f16a65402520971b56a973e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:52.273575Z","signature_b64":"VCXrbdVwCix4tMhOeGnpd8sRFg4QrI64xxW7iCVjJcpYt3J9l14SESzgBD5okJlEt/vBUDxO7KBJOnZ5WxQOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cf046adf91f7fc32907e5d7bcfebbf0f1b19ed22cfb97eefc257fe8c92fe6fc","last_reissued_at":"2026-05-18T00:14:52.272873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:52.272873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NetSim -- The framework for complex network generator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Akanda Wahid -Ul- Ashraf, Katarzyna Musial, Marcin Budka","submitted_at":"2018-05-26T18:53:07Z","abstract_excerpt":"Networks are everywhere and their many types, including social networks, the Internet, food webs etc., have been studied for the last few decades. However, in real-world networks, it's hard to find examples that can be easily comparable, i.e. have the same density or even number of nodes and edges. We propose a flexible and extensible NetSim framework to understand how properties in different types of networks change with varying number of edges and vertices. Our approach enables to simulate three classical network models (random, small-world and scale-free) with easily adjustable model parame"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10520","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":"1805.10520","created_at":"2026-05-18T00:14:52.272966+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.10520v1","created_at":"2026-05-18T00:14:52.272966+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10520","created_at":"2026-05-18T00:14:52.272966+00:00"},{"alias_kind":"pith_short_12","alias_value":"DTYENLPZD574","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DTYENLPZD574GKIH","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DTYENLPZ","created_at":"2026-05-18T12:32:19.392346+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/DTYENLPZD574GKIH4XL3Z7V36D","json":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D.json","graph_json":"https://pith.science/api/pith-number/DTYENLPZD574GKIH4XL3Z7V36D/graph.json","events_json":"https://pith.science/api/pith-number/DTYENLPZD574GKIH4XL3Z7V36D/events.json","paper":"https://pith.science/paper/DTYENLPZ"},"agent_actions":{"view_html":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D","download_json":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D.json","view_paper":"https://pith.science/paper/DTYENLPZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.10520&json=true","fetch_graph":"https://pith.science/api/pith-number/DTYENLPZD574GKIH4XL3Z7V36D/graph.json","fetch_events":"https://pith.science/api/pith-number/DTYENLPZD574GKIH4XL3Z7V36D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D/action/storage_attestation","attest_author":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D/action/author_attestation","sign_citation":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D/action/citation_signature","submit_replication":"https://pith.science/pith/DTYENLPZD574GKIH4XL3Z7V36D/action/replication_record"}},"created_at":"2026-05-18T00:14:52.272966+00:00","updated_at":"2026-05-18T00:14:52.272966+00:00"}