{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EOJ5RNKBTZQR3RLSZFXXM74ISD","short_pith_number":"pith:EOJ5RNKB","schema_version":"1.0","canonical_sha256":"2393d8b5419e611dc572c96f767f8890cf13bcd982810a0a2f4c93c156287aa9","source":{"kind":"arxiv","id":"1407.7729","version":2},"attestation_state":"computed","paper":{"title":"A Network Model characterized by a Latent Attribute Structure with Competition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","physics.data-an","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Corrado Monti, Irene Crimaldi, Paolo Boldi","submitted_at":"2014-07-29T14:09:39Z","abstract_excerpt":"The quest for a model that is able to explain, describe, analyze and simulate real-world complex networks is of uttermost practical as well as theoretical interest. In this paper we introduce and study a network model that is based on a latent attribute structure: each node is characterized by a number of features and the probability of the existence of an edge between two nodes depends on the features they share. Features are chosen according to a process of Indian-Buffet type but with an additional random \"fitness\" parameter attached to each node, that determines its ability to transmit its "},"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":"1407.7729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2014-07-29T14:09:39Z","cross_cats_sorted":["math.PR","physics.data-an","physics.soc-ph"],"title_canon_sha256":"59eb023922b5b3d1207ab113138e06f8580c9a7b30d337013f6075681bdb3129","abstract_canon_sha256":"bd477f77399ab1ff749a7d4117167ab005189a868f5180dad1d563c3aef19111"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:47.457533Z","signature_b64":"GwJQXCAvYbxydDorHBRVMbinghjco8lKk40SPIIAMwSuVKQjUorvRJ0igY4LqF81jxaXAfID6CkiRaEiMy6nDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2393d8b5419e611dc572c96f767f8890cf13bcd982810a0a2f4c93c156287aa9","last_reissued_at":"2026-05-18T02:42:47.457037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:47.457037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Network Model characterized by a Latent Attribute Structure with Competition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","physics.data-an","physics.soc-ph"],"primary_cat":"cs.SI","authors_text":"Corrado Monti, Irene Crimaldi, Paolo Boldi","submitted_at":"2014-07-29T14:09:39Z","abstract_excerpt":"The quest for a model that is able to explain, describe, analyze and simulate real-world complex networks is of uttermost practical as well as theoretical interest. In this paper we introduce and study a network model that is based on a latent attribute structure: each node is characterized by a number of features and the probability of the existence of an edge between two nodes depends on the features they share. Features are chosen according to a process of Indian-Buffet type but with an additional random \"fitness\" parameter attached to each node, that determines its ability to transmit its "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7729","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":"1407.7729","created_at":"2026-05-18T02:42:47.457100+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7729v2","created_at":"2026-05-18T02:42:47.457100+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7729","created_at":"2026-05-18T02:42:47.457100+00:00"},{"alias_kind":"pith_short_12","alias_value":"EOJ5RNKBTZQR","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EOJ5RNKBTZQR3RLS","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EOJ5RNKB","created_at":"2026-05-18T12:28:28.263976+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/EOJ5RNKBTZQR3RLSZFXXM74ISD","json":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD.json","graph_json":"https://pith.science/api/pith-number/EOJ5RNKBTZQR3RLSZFXXM74ISD/graph.json","events_json":"https://pith.science/api/pith-number/EOJ5RNKBTZQR3RLSZFXXM74ISD/events.json","paper":"https://pith.science/paper/EOJ5RNKB"},"agent_actions":{"view_html":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD","download_json":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD.json","view_paper":"https://pith.science/paper/EOJ5RNKB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7729&json=true","fetch_graph":"https://pith.science/api/pith-number/EOJ5RNKBTZQR3RLSZFXXM74ISD/graph.json","fetch_events":"https://pith.science/api/pith-number/EOJ5RNKBTZQR3RLSZFXXM74ISD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD/action/storage_attestation","attest_author":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD/action/author_attestation","sign_citation":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD/action/citation_signature","submit_replication":"https://pith.science/pith/EOJ5RNKBTZQR3RLSZFXXM74ISD/action/replication_record"}},"created_at":"2026-05-18T02:42:47.457100+00:00","updated_at":"2026-05-18T02:42:47.457100+00:00"}