{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2XHOBOUU3DVLBMYLAWLEPW5YSG","short_pith_number":"pith:2XHOBOUU","schema_version":"1.0","canonical_sha256":"d5cee0ba94d8eab0b30b059647dbb89199deac7c88acf42ba5bc2f29a566627c","source":{"kind":"arxiv","id":"1710.10042","version":1},"attestation_state":"computed","paper":{"title":"Generating global network structures by triad types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Ale\\v{s} \\v{Z}iberna, Anu\\v{s}ka Ferligoj, Marjan Cugmas","submitted_at":"2017-10-27T09:33:35Z","abstract_excerpt":"This paper addresses the question of whether it is possible to generate networks with a given global structure (defined by selected blockmodels, i.e., cohesive, core-periphery, hierarchical and transitivity), considering only different types of triads. Two methods are used to generate networks: (i) the method of relocating links; and (ii) the Monte Carlo Multi Chain algorithm implemented in the \"ergm\" package implemented in R. Although all types of triads can generate networks with the selected blockmodel types, the selection of only a subset of triads improves the generated networks' blockmod"},"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":"1710.10042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-10-27T09:33:35Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"19f70ef3993293ccb380a2e6fd516aa6627b0ad9e02ad8572c70857913db2255","abstract_canon_sha256":"bd3a44c54a7dabac1b141e75f1125022d73ab354fda1d37000c3075634c73fc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:50.326452Z","signature_b64":"XxlsTMudRL7KfZswgrldYSEC6tOC6H3pk5Ube0A7CPTA4spWLYUHSHNpAaH+yARzJ93fYjgwmOouCVTq5KEnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5cee0ba94d8eab0b30b059647dbb89199deac7c88acf42ba5bc2f29a566627c","last_reissued_at":"2026-05-18T00:11:50.325711Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:50.325711Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generating global network structures by triad types","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"Ale\\v{s} \\v{Z}iberna, Anu\\v{s}ka Ferligoj, Marjan Cugmas","submitted_at":"2017-10-27T09:33:35Z","abstract_excerpt":"This paper addresses the question of whether it is possible to generate networks with a given global structure (defined by selected blockmodels, i.e., cohesive, core-periphery, hierarchical and transitivity), considering only different types of triads. Two methods are used to generate networks: (i) the method of relocating links; and (ii) the Monte Carlo Multi Chain algorithm implemented in the \"ergm\" package implemented in R. Although all types of triads can generate networks with the selected blockmodel types, the selection of only a subset of triads improves the generated networks' blockmod"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10042","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":"1710.10042","created_at":"2026-05-18T00:11:50.325842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10042v1","created_at":"2026-05-18T00:11:50.325842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10042","created_at":"2026-05-18T00:11:50.325842+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XHOBOUU3DVL","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XHOBOUU3DVLBMYL","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XHOBOUU","created_at":"2026-05-18T12:30:55.937587+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/2XHOBOUU3DVLBMYLAWLEPW5YSG","json":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG.json","graph_json":"https://pith.science/api/pith-number/2XHOBOUU3DVLBMYLAWLEPW5YSG/graph.json","events_json":"https://pith.science/api/pith-number/2XHOBOUU3DVLBMYLAWLEPW5YSG/events.json","paper":"https://pith.science/paper/2XHOBOUU"},"agent_actions":{"view_html":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG","download_json":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG.json","view_paper":"https://pith.science/paper/2XHOBOUU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10042&json=true","fetch_graph":"https://pith.science/api/pith-number/2XHOBOUU3DVLBMYLAWLEPW5YSG/graph.json","fetch_events":"https://pith.science/api/pith-number/2XHOBOUU3DVLBMYLAWLEPW5YSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG/action/storage_attestation","attest_author":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG/action/author_attestation","sign_citation":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG/action/citation_signature","submit_replication":"https://pith.science/pith/2XHOBOUU3DVLBMYLAWLEPW5YSG/action/replication_record"}},"created_at":"2026-05-18T00:11:50.325842+00:00","updated_at":"2026-05-18T00:11:50.325842+00:00"}