{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:NGW4PTHIER675HDLD3RZBHA6MT","short_pith_number":"pith:NGW4PTHI","schema_version":"1.0","canonical_sha256":"69adc7cce8247dfe9c6b1ee3909c1e64eacaf8b48f908e254331758951f6d8b7","source":{"kind":"arxiv","id":"2001.03838","version":4},"attestation_state":"computed","paper":{"title":"Two-Step Estimation of a Strategic Network Formation Model with Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.EM","authors_text":"Geert Ridder, Shuyang Sheng","submitted_at":"2020-01-12T03:35:37Z","abstract_excerpt":"This paper explores strategic network formation under incomplete information using data from a single large network. We allow the utility function to be nonseparable in an individual's link choices to capture the spillover effects from friends in common. In a network with n individuals, an individual with a nonseparable utility function chooses between 2^{n-1} overlapping portfolios of links. We develop a novel approach that applies the Legendre transform to the utility function so that the optimal link choices can be represented as a sequence of correlated binary choices. The link dependence "},"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":"2001.03838","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.EM","submitted_at":"2020-01-12T03:35:37Z","cross_cats_sorted":[],"title_canon_sha256":"4291706fc49d6d1000caf2353b2fa365038724ec30af651eac7b699db9bb89e1","abstract_canon_sha256":"9864e29bda679f23cc3bdc21c9bcfa2e96a74d8efbfd39abc00bcf134af4b157"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:13:53.267199Z","signature_b64":"eayBDO1p5ji72F2HS7naZELmb6jWcjdGCVdItfAoFmQPVqyZM14ewZjAgrFWkFsYIoIyX0tHKLm5fw0WKMMwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69adc7cce8247dfe9c6b1ee3909c1e64eacaf8b48f908e254331758951f6d8b7","last_reissued_at":"2026-07-05T11:13:53.266741Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:13:53.266741Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two-Step Estimation of a Strategic Network Formation Model with Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"econ.EM","authors_text":"Geert Ridder, Shuyang Sheng","submitted_at":"2020-01-12T03:35:37Z","abstract_excerpt":"This paper explores strategic network formation under incomplete information using data from a single large network. We allow the utility function to be nonseparable in an individual's link choices to capture the spillover effects from friends in common. In a network with n individuals, an individual with a nonseparable utility function chooses between 2^{n-1} overlapping portfolios of links. We develop a novel approach that applies the Legendre transform to the utility function so that the optimal link choices can be represented as a sequence of correlated binary choices. The link dependence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2001.03838","kind":"arxiv","version":4},"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/2001.03838/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":"2001.03838","created_at":"2026-07-05T11:13:53.266797+00:00"},{"alias_kind":"arxiv_version","alias_value":"2001.03838v4","created_at":"2026-07-05T11:13:53.266797+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2001.03838","created_at":"2026-07-05T11:13:53.266797+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGW4PTHIER67","created_at":"2026-07-05T11:13:53.266797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGW4PTHIER675HDL","created_at":"2026-07-05T11:13:53.266797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGW4PTHI","created_at":"2026-07-05T11:13:53.266797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.23852","citing_title":"Bagging the Network","ref_index":56,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00771","citing_title":"Penalized Likelihood for Dyadic Network Formation Models with Degree Heterogeneity","ref_index":28,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT","json":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT.json","graph_json":"https://pith.science/api/pith-number/NGW4PTHIER675HDLD3RZBHA6MT/graph.json","events_json":"https://pith.science/api/pith-number/NGW4PTHIER675HDLD3RZBHA6MT/events.json","paper":"https://pith.science/paper/NGW4PTHI"},"agent_actions":{"view_html":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT","download_json":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT.json","view_paper":"https://pith.science/paper/NGW4PTHI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2001.03838&json=true","fetch_graph":"https://pith.science/api/pith-number/NGW4PTHIER675HDLD3RZBHA6MT/graph.json","fetch_events":"https://pith.science/api/pith-number/NGW4PTHIER675HDLD3RZBHA6MT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT/action/storage_attestation","attest_author":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT/action/author_attestation","sign_citation":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT/action/citation_signature","submit_replication":"https://pith.science/pith/NGW4PTHIER675HDLD3RZBHA6MT/action/replication_record"}},"created_at":"2026-07-05T11:13:53.266797+00:00","updated_at":"2026-07-05T11:13:53.266797+00:00"}