{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:Y3EUYZJ4PF27ZYO3XMN2H5QG54","short_pith_number":"pith:Y3EUYZJ4","schema_version":"1.0","canonical_sha256":"c6c94c653c7975fce1dbbb1ba3f606ef0935f62197cf39c666275c2cd7d0159a","source":{"kind":"arxiv","id":"1812.05912","version":1},"attestation_state":"computed","paper":{"title":"Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Artur Ziviani, Felipe S. Abrah\\~ao, Klaus Wehmuth","submitted_at":"2018-12-13T03:39:58Z","abstract_excerpt":"We study emergent information in populations of randomly generated networked computable systems that follow a Susceptible-Infected-Susceptible contagion (or infection) model of imitation of the fittest neighbor. These networks have a scale-free degree distribution in the form of a power-law following the Barab\\'{a}si-Albert model. We show that there is a lower bound for the stationary prevalence (or average density of infected nodes) that triggers an unlimited increase of the expected emergent algorithmic complexity (or information) of a node as the population size grows."},"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":"1812.05912","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2018-12-13T03:39:58Z","cross_cats_sorted":["physics.soc-ph"],"title_canon_sha256":"6fd1fdb8f361dd377c81eb5277b4f4feb39288ddced1b26c301275d76a9f507c","abstract_canon_sha256":"e59e7363db5ce807b7d747a9598ba01f70b013eb1c21a0f1684dcc6f99459db6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:17.825122Z","signature_b64":"2zsa89oTuVXELgWqb7FPCHEbfGBMTiKJ2+PwIq4hADVRsSULrJ/Z8SmbmWmCZXz90o8rIYHQ3A6MS/Amerm5Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6c94c653c7975fce1dbbb1ba3f606ef0935f62197cf39c666275c2cd7d0159a","last_reissued_at":"2026-05-17T23:58:17.824691Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:17.824691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expected Emergence of Algorithmic Information from a Lower Bound for Stationary Prevalence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Artur Ziviani, Felipe S. Abrah\\~ao, Klaus Wehmuth","submitted_at":"2018-12-13T03:39:58Z","abstract_excerpt":"We study emergent information in populations of randomly generated networked computable systems that follow a Susceptible-Infected-Susceptible contagion (or infection) model of imitation of the fittest neighbor. These networks have a scale-free degree distribution in the form of a power-law following the Barab\\'{a}si-Albert model. We show that there is a lower bound for the stationary prevalence (or average density of infected nodes) that triggers an unlimited increase of the expected emergent algorithmic complexity (or information) of a node as the population size grows."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05912","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":"1812.05912","created_at":"2026-05-17T23:58:17.824757+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05912v1","created_at":"2026-05-17T23:58:17.824757+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05912","created_at":"2026-05-17T23:58:17.824757+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3EUYZJ4PF27","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3EUYZJ4PF27ZYO3","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3EUYZJ4","created_at":"2026-05-18T12:33:04.347982+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/Y3EUYZJ4PF27ZYO3XMN2H5QG54","json":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54.json","graph_json":"https://pith.science/api/pith-number/Y3EUYZJ4PF27ZYO3XMN2H5QG54/graph.json","events_json":"https://pith.science/api/pith-number/Y3EUYZJ4PF27ZYO3XMN2H5QG54/events.json","paper":"https://pith.science/paper/Y3EUYZJ4"},"agent_actions":{"view_html":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54","download_json":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54.json","view_paper":"https://pith.science/paper/Y3EUYZJ4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05912&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3EUYZJ4PF27ZYO3XMN2H5QG54/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3EUYZJ4PF27ZYO3XMN2H5QG54/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54/action/storage_attestation","attest_author":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54/action/author_attestation","sign_citation":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54/action/citation_signature","submit_replication":"https://pith.science/pith/Y3EUYZJ4PF27ZYO3XMN2H5QG54/action/replication_record"}},"created_at":"2026-05-17T23:58:17.824757+00:00","updated_at":"2026-05-17T23:58:17.824757+00:00"}