{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:JVDSXALQI5T5N4G2H5DH643XPY","short_pith_number":"pith:JVDSXALQ","schema_version":"1.0","canonical_sha256":"4d472b81704767d6f0da3f467f73777e3587f2f3c28d6863f7bbd9ac473eb94c","source":{"kind":"arxiv","id":"2010.04703","version":1},"attestation_state":"computed","paper":{"title":"Sparse network asymptotics for logistic regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"econ.EM","authors_text":"Bryan S. Graham","submitted_at":"2020-10-09T17:46:29Z","abstract_excerpt":"Consider a bipartite network where $N$ consumers choose to buy or not to buy $M$ different products. This paper considers the properties of the logistic regression of the $N\\times M$ array of i-buys-j purchase decisions, $\\left[Y_{ij}\\right]_{1\\leq i\\leq N,1\\leq j\\leq M}$, onto known functions of consumer and product attributes under asymptotic sequences where (i) both $N$ and $M$ grow large and (ii) the average number of products purchased per consumer is finite in the limit. This latter assumption implies that the network of purchases is sparse: only a (very) small fraction of all possible p"},"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":"2010.04703","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"econ.EM","submitted_at":"2020-10-09T17:46:29Z","cross_cats_sorted":["math.ST","stat.ML","stat.TH"],"title_canon_sha256":"d17f0943d7e332665d6c47d272f384e19492bdbc0518898293f43bd6acae979b","abstract_canon_sha256":"289fe38869c8af522ffb4fe6b7d04fca8e802cd3a2f7978f306229b92ff5620c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:41:45.701036Z","signature_b64":"zhYdT1bEqDir7zwi1jx/eRJY81SJnVubXQVnQ9oFq90JeCOxF9gnl7Rhb+874TfP7RyhcIWe05ZQ3XgNvRNCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4d472b81704767d6f0da3f467f73777e3587f2f3c28d6863f7bbd9ac473eb94c","last_reissued_at":"2026-07-05T01:41:45.700569Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:41:45.700569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sparse network asymptotics for logistic regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.ML","stat.TH"],"primary_cat":"econ.EM","authors_text":"Bryan S. Graham","submitted_at":"2020-10-09T17:46:29Z","abstract_excerpt":"Consider a bipartite network where $N$ consumers choose to buy or not to buy $M$ different products. This paper considers the properties of the logistic regression of the $N\\times M$ array of i-buys-j purchase decisions, $\\left[Y_{ij}\\right]_{1\\leq i\\leq N,1\\leq j\\leq M}$, onto known functions of consumer and product attributes under asymptotic sequences where (i) both $N$ and $M$ grow large and (ii) the average number of products purchased per consumer is finite in the limit. This latter assumption implies that the network of purchases is sparse: only a (very) small fraction of all possible p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04703","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2010.04703/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":"2010.04703","created_at":"2026-07-05T01:41:45.700626+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.04703v1","created_at":"2026-07-05T01:41:45.700626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04703","created_at":"2026-07-05T01:41:45.700626+00:00"},{"alias_kind":"pith_short_12","alias_value":"JVDSXALQI5T5","created_at":"2026-07-05T01:41:45.700626+00:00"},{"alias_kind":"pith_short_16","alias_value":"JVDSXALQI5T5N4G2","created_at":"2026-07-05T01:41:45.700626+00:00"},{"alias_kind":"pith_short_8","alias_value":"JVDSXALQ","created_at":"2026-07-05T01:41:45.700626+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04366","citing_title":"DispFormer: A Pretrained Transformer Incorporating Physical Constraints for Dispersion Curve Inversion","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY","json":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY.json","graph_json":"https://pith.science/api/pith-number/JVDSXALQI5T5N4G2H5DH643XPY/graph.json","events_json":"https://pith.science/api/pith-number/JVDSXALQI5T5N4G2H5DH643XPY/events.json","paper":"https://pith.science/paper/JVDSXALQ"},"agent_actions":{"view_html":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY","download_json":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY.json","view_paper":"https://pith.science/paper/JVDSXALQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.04703&json=true","fetch_graph":"https://pith.science/api/pith-number/JVDSXALQI5T5N4G2H5DH643XPY/graph.json","fetch_events":"https://pith.science/api/pith-number/JVDSXALQI5T5N4G2H5DH643XPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY/action/storage_attestation","attest_author":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY/action/author_attestation","sign_citation":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY/action/citation_signature","submit_replication":"https://pith.science/pith/JVDSXALQI5T5N4G2H5DH643XPY/action/replication_record"}},"created_at":"2026-07-05T01:41:45.700626+00:00","updated_at":"2026-07-05T01:41:45.700626+00:00"}