{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RAQCUVKJFRTJB5AKKJDZIIQHF5","short_pith_number":"pith:RAQCUVKJ","schema_version":"1.0","canonical_sha256":"88202a55492c6690f40a52479422072f74e7c3adf1eb5fd3890a91e20c588b87","source":{"kind":"arxiv","id":"2502.01892","version":3},"attestation_state":"computed","paper":{"title":"Improving exponential-family random graph models for bipartite networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Alessandro Lomi, Alex Stivala, Peng Wang","submitted_at":"2025-02-03T23:58:23Z","abstract_excerpt":"Bipartite graphs, representing two-mode networks, arise in many research fields. These networks have two disjoint node sets representing distinct entity types, for example persons and groups, with edges representing associations between the two entity types. In bipartite graphs, the smallest possible cycle is a cycle of length four, and hence four-cycles are the smallest structure to model closure in such networks. Exponential-family random graph models (ERGMs) are a widely used model for social, and other, networks, including specifically bipartite networks. Existing ERGM terms to model four-"},"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":"2502.01892","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-02-03T23:58:23Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"14ef821b7f35c495ac52676d5bedf9509c97d5cf327ae5592163863c3909158a","abstract_canon_sha256":"66d39c076b12bd93eded64b10cf86faa1ec913a4a2ec9c7432d2829cb3a66409"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:49:50.384312Z","signature_b64":"/4Z1wAg4vjACEcbgu1vH84fxSqlCbmI9I8ihImoiyhGm+DCMIgQmW724ByJ4c5DfwtX9WWSuwXZ7eQEAVenFAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88202a55492c6690f40a52479422072f74e7c3adf1eb5fd3890a91e20c588b87","last_reissued_at":"2026-07-05T11:49:50.383836Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:49:50.383836Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improving exponential-family random graph models for bipartite networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.ME","authors_text":"Alessandro Lomi, Alex Stivala, Peng Wang","submitted_at":"2025-02-03T23:58:23Z","abstract_excerpt":"Bipartite graphs, representing two-mode networks, arise in many research fields. These networks have two disjoint node sets representing distinct entity types, for example persons and groups, with edges representing associations between the two entity types. In bipartite graphs, the smallest possible cycle is a cycle of length four, and hence four-cycles are the smallest structure to model closure in such networks. Exponential-family random graph models (ERGMs) are a widely used model for social, and other, networks, including specifically bipartite networks. Existing ERGM terms to model four-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01892","kind":"arxiv","version":3},"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/2502.01892/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":"2502.01892","created_at":"2026-07-05T11:49:50.383895+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01892v3","created_at":"2026-07-05T11:49:50.383895+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01892","created_at":"2026-07-05T11:49:50.383895+00:00"},{"alias_kind":"pith_short_12","alias_value":"RAQCUVKJFRTJ","created_at":"2026-07-05T11:49:50.383895+00:00"},{"alias_kind":"pith_short_16","alias_value":"RAQCUVKJFRTJB5AK","created_at":"2026-07-05T11:49:50.383895+00:00"},{"alias_kind":"pith_short_8","alias_value":"RAQCUVKJ","created_at":"2026-07-05T11:49:50.383895+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/RAQCUVKJFRTJB5AKKJDZIIQHF5","json":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5.json","graph_json":"https://pith.science/api/pith-number/RAQCUVKJFRTJB5AKKJDZIIQHF5/graph.json","events_json":"https://pith.science/api/pith-number/RAQCUVKJFRTJB5AKKJDZIIQHF5/events.json","paper":"https://pith.science/paper/RAQCUVKJ"},"agent_actions":{"view_html":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5","download_json":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5.json","view_paper":"https://pith.science/paper/RAQCUVKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01892&json=true","fetch_graph":"https://pith.science/api/pith-number/RAQCUVKJFRTJB5AKKJDZIIQHF5/graph.json","fetch_events":"https://pith.science/api/pith-number/RAQCUVKJFRTJB5AKKJDZIIQHF5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5/action/storage_attestation","attest_author":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5/action/author_attestation","sign_citation":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5/action/citation_signature","submit_replication":"https://pith.science/pith/RAQCUVKJFRTJB5AKKJDZIIQHF5/action/replication_record"}},"created_at":"2026-07-05T11:49:50.383895+00:00","updated_at":"2026-07-05T11:49:50.383895+00:00"}