{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:FJ3SM7CYHXCCHSS2JGJQNTCTZQ","short_pith_number":"pith:FJ3SM7CY","schema_version":"1.0","canonical_sha256":"2a77267c583dc423ca5a499306cc53cc33e015e24a0d6ee254a45a4ebace16a4","source":{"kind":"arxiv","id":"2008.03831","version":2},"attestation_state":"computed","paper":{"title":"A Random Growth Model with any Real or Theoretical Degree Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Fr\\'ed\\'eric Giroire, St\\'ephane P\\'erennes, Thibaud Trolliet","submitted_at":"2020-08-09T22:48:59Z","abstract_excerpt":"The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distribution. The degree distribution can either be theoretical or extracted from a real-world network. The main idea is to invert the recurrence equation commonly used to compute the degree distribution in order to find a convenient attachment function for node connections - commonly chosen as linear. We compute this attachment function for some classical di"},"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":"2008.03831","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2020-08-09T22:48:59Z","cross_cats_sorted":[],"title_canon_sha256":"d301717c6d8f8eb6a712bb370db52732891d3b6fe991ef209f6f49c71a019073","abstract_canon_sha256":"b04d45f8106a13d3678ba4c76e5c04d4b5d06d1336c3fa556e2e056884442da9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:57:19.195593Z","signature_b64":"F3bLAjoJGwCYdecAHy6ZIkzn2p6lP4tngEp3l5pvJQRXzd0yD0nEcsrqy91TuSagrwoMoFSvBDdStbIrKIEDBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a77267c583dc423ca5a499306cc53cc33e015e24a0d6ee254a45a4ebace16a4","last_reissued_at":"2026-07-05T01:57:19.195183Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:57:19.195183Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Random Growth Model with any Real or Theoretical Degree Distribution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SI","authors_text":"Fr\\'ed\\'eric Giroire, St\\'ephane P\\'erennes, Thibaud Trolliet","submitted_at":"2020-08-09T22:48:59Z","abstract_excerpt":"The degree distributions of complex networks are usually considered to be power law. However, it is not the case for a large number of them. We thus propose a new model able to build random growing networks with (almost) any wanted degree distribution. The degree distribution can either be theoretical or extracted from a real-world network. The main idea is to invert the recurrence equation commonly used to compute the degree distribution in order to find a convenient attachment function for node connections - commonly chosen as linear. We compute this attachment function for some classical di"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.03831","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.03831/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.03831","created_at":"2026-07-05T01:57:19.195240+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.03831v2","created_at":"2026-07-05T01:57:19.195240+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.03831","created_at":"2026-07-05T01:57:19.195240+00:00"},{"alias_kind":"pith_short_12","alias_value":"FJ3SM7CYHXCC","created_at":"2026-07-05T01:57:19.195240+00:00"},{"alias_kind":"pith_short_16","alias_value":"FJ3SM7CYHXCCHSS2","created_at":"2026-07-05T01:57:19.195240+00:00"},{"alias_kind":"pith_short_8","alias_value":"FJ3SM7CY","created_at":"2026-07-05T01:57:19.195240+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/FJ3SM7CYHXCCHSS2JGJQNTCTZQ","json":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ.json","graph_json":"https://pith.science/api/pith-number/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/graph.json","events_json":"https://pith.science/api/pith-number/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/events.json","paper":"https://pith.science/paper/FJ3SM7CY"},"agent_actions":{"view_html":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ","download_json":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ.json","view_paper":"https://pith.science/paper/FJ3SM7CY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.03831&json=true","fetch_graph":"https://pith.science/api/pith-number/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/graph.json","fetch_events":"https://pith.science/api/pith-number/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/action/storage_attestation","attest_author":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/action/author_attestation","sign_citation":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/action/citation_signature","submit_replication":"https://pith.science/pith/FJ3SM7CYHXCCHSS2JGJQNTCTZQ/action/replication_record"}},"created_at":"2026-07-05T01:57:19.195240+00:00","updated_at":"2026-07-05T01:57:19.195240+00:00"}