{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LXFDKAMNARZ6AZGSSH6WODGUOM","short_pith_number":"pith:LXFDKAMN","schema_version":"1.0","canonical_sha256":"5dca35018d0473e064d291fd670cd47302fe3b2c9ad149a55239e60dcaa0bb32","source":{"kind":"arxiv","id":"1611.05699","version":1},"attestation_state":"computed","paper":{"title":"The $\\beta$-model for Random Graphs --- Regression, Cram\\'er-Rao Bounds, and Hypothesis Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Arye Nehorai, Isaac Skog, Johan Wahlstr\\\"om, Patricio S. La Rosa, Peter H\\\"andel","submitted_at":"2016-11-14T08:39:44Z","abstract_excerpt":"We develop a maximum-likelihood based method for regression in a setting where the dependent variable is a random graph and covariates are available on a graph-level. The model generalizes the well-known $\\beta$-model for random graphs by replacing the constant model parameters with regression functions. Cram\\'er-Rao bounds are derived for the undirected $\\beta$-model, the directed $\\beta$-model, and the generalized $\\beta$-model. The corresponding maximum likelihood estimators are compared to the bounds by means of simulations. Moreover, examples are given on how to use the presented maximum "},"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":"1611.05699","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2016-11-14T08:39:44Z","cross_cats_sorted":[],"title_canon_sha256":"bc9a802bea2fe38ecbd8430f521ff85a78634dc2b2477efd26b136425a78227c","abstract_canon_sha256":"34298930c3bba6ef6da69e4846a09f6715b628dd22929bf1a27d0240d306dcaa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:59.129303Z","signature_b64":"cb2n0eDS9WPM5H+hWo8sCWKCF5Lpn2Ag1YFNn8nzSvL6b6sJR7yiiDmiSfY/QfqrOxV/Puj2njlf3IYobLTZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5dca35018d0473e064d291fd670cd47302fe3b2c9ad149a55239e60dcaa0bb32","last_reissued_at":"2026-05-18T00:43:59.128719Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:59.128719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The $\\beta$-model for Random Graphs --- Regression, Cram\\'er-Rao Bounds, and Hypothesis Testing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ME","authors_text":"Arye Nehorai, Isaac Skog, Johan Wahlstr\\\"om, Patricio S. La Rosa, Peter H\\\"andel","submitted_at":"2016-11-14T08:39:44Z","abstract_excerpt":"We develop a maximum-likelihood based method for regression in a setting where the dependent variable is a random graph and covariates are available on a graph-level. The model generalizes the well-known $\\beta$-model for random graphs by replacing the constant model parameters with regression functions. Cram\\'er-Rao bounds are derived for the undirected $\\beta$-model, the directed $\\beta$-model, and the generalized $\\beta$-model. The corresponding maximum likelihood estimators are compared to the bounds by means of simulations. Moreover, examples are given on how to use the presented maximum "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.05699","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":"1611.05699","created_at":"2026-05-18T00:43:59.128810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.05699v1","created_at":"2026-05-18T00:43:59.128810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.05699","created_at":"2026-05-18T00:43:59.128810+00:00"},{"alias_kind":"pith_short_12","alias_value":"LXFDKAMNARZ6","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LXFDKAMNARZ6AZGS","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LXFDKAMN","created_at":"2026-05-18T12:30:29.479603+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/LXFDKAMNARZ6AZGSSH6WODGUOM","json":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM.json","graph_json":"https://pith.science/api/pith-number/LXFDKAMNARZ6AZGSSH6WODGUOM/graph.json","events_json":"https://pith.science/api/pith-number/LXFDKAMNARZ6AZGSSH6WODGUOM/events.json","paper":"https://pith.science/paper/LXFDKAMN"},"agent_actions":{"view_html":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM","download_json":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM.json","view_paper":"https://pith.science/paper/LXFDKAMN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.05699&json=true","fetch_graph":"https://pith.science/api/pith-number/LXFDKAMNARZ6AZGSSH6WODGUOM/graph.json","fetch_events":"https://pith.science/api/pith-number/LXFDKAMNARZ6AZGSSH6WODGUOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM/action/storage_attestation","attest_author":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM/action/author_attestation","sign_citation":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM/action/citation_signature","submit_replication":"https://pith.science/pith/LXFDKAMNARZ6AZGSSH6WODGUOM/action/replication_record"}},"created_at":"2026-05-18T00:43:59.128810+00:00","updated_at":"2026-05-18T00:43:59.128810+00:00"}