{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZLBNMTFPLXIHXXRQHOS3TF5RJG","short_pith_number":"pith:ZLBNMTFP","schema_version":"1.0","canonical_sha256":"cac2d64caf5dd07bde303ba5b997b149ab3292561bf50dbc0f97626530bdfe71","source":{"kind":"arxiv","id":"1406.6447","version":2},"attestation_state":"computed","paper":{"title":"Carrying capacity in growing networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"H. L. Casa Grande, M. O. Hase","submitted_at":"2014-06-25T03:21:25Z","abstract_excerpt":"In this work, a growing network model that can generate a random network with finite degree in infinite time is studied. The dynamics are governed by a rule where the degree increases under a scheme similar to the Malthus-Verhulst model in the context of population growth. The degree distribution is analysed in both stationary and time-dependent regimes through some exact results and simulations, and a scaling behaviour is found in asymptotically large time. For finite times, the time-dependent degree distribution displays an accumulation of hubs as a result of competition between attractive a"},"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":"1406.6447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.soc-ph","submitted_at":"2014-06-25T03:21:25Z","cross_cats_sorted":["cond-mat.stat-mech","cs.SI"],"title_canon_sha256":"2ab32799509c4502301043195f826facbbbb6643b6d6b3879287f60cd310bcde","abstract_canon_sha256":"4717754defb4bcd63b216eb21091d64bbece6e612239a5fb9506d534cb3a766a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:32.741000Z","signature_b64":"SdreCwBDEKNFmKXfFJ0e1LW8uaRD3FLcA6tsAq7RPqyCuxzZQCcF/lmCIVBqokKPGKHolwiiKOauYQ8Q8oXYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cac2d64caf5dd07bde303ba5b997b149ab3292561bf50dbc0f97626530bdfe71","last_reissued_at":"2026-05-18T01:15:32.740260Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:32.740260Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Carrying capacity in growing networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cs.SI"],"primary_cat":"physics.soc-ph","authors_text":"H. L. Casa Grande, M. O. Hase","submitted_at":"2014-06-25T03:21:25Z","abstract_excerpt":"In this work, a growing network model that can generate a random network with finite degree in infinite time is studied. The dynamics are governed by a rule where the degree increases under a scheme similar to the Malthus-Verhulst model in the context of population growth. The degree distribution is analysed in both stationary and time-dependent regimes through some exact results and simulations, and a scaling behaviour is found in asymptotically large time. For finite times, the time-dependent degree distribution displays an accumulation of hubs as a result of competition between attractive a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6447","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":"1406.6447","created_at":"2026-05-18T01:15:32.740390+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6447v2","created_at":"2026-05-18T01:15:32.740390+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6447","created_at":"2026-05-18T01:15:32.740390+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZLBNMTFPLXIH","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZLBNMTFPLXIHXXRQ","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZLBNMTFP","created_at":"2026-05-18T12:28:59.999130+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/ZLBNMTFPLXIHXXRQHOS3TF5RJG","json":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG.json","graph_json":"https://pith.science/api/pith-number/ZLBNMTFPLXIHXXRQHOS3TF5RJG/graph.json","events_json":"https://pith.science/api/pith-number/ZLBNMTFPLXIHXXRQHOS3TF5RJG/events.json","paper":"https://pith.science/paper/ZLBNMTFP"},"agent_actions":{"view_html":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG","download_json":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG.json","view_paper":"https://pith.science/paper/ZLBNMTFP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6447&json=true","fetch_graph":"https://pith.science/api/pith-number/ZLBNMTFPLXIHXXRQHOS3TF5RJG/graph.json","fetch_events":"https://pith.science/api/pith-number/ZLBNMTFPLXIHXXRQHOS3TF5RJG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG/action/storage_attestation","attest_author":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG/action/author_attestation","sign_citation":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG/action/citation_signature","submit_replication":"https://pith.science/pith/ZLBNMTFPLXIHXXRQHOS3TF5RJG/action/replication_record"}},"created_at":"2026-05-18T01:15:32.740390+00:00","updated_at":"2026-05-18T01:15:32.740390+00:00"}