{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:XO5F7AIBNK43B4CZDHMLZZRSGN","short_pith_number":"pith:XO5F7AIB","schema_version":"1.0","canonical_sha256":"bbba5f81016ab9b0f05919d8bce632336578592c72b496055ca9ac96ab2451c5","source":{"kind":"arxiv","id":"2606.07065","version":1},"attestation_state":"computed","paper":{"title":"Ising Models on Inhomogeneous Random Graphs: Inference, Local Asymptotic Minimaxity, and Limit of Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Anirban Chatterjee, Bhaswar B. Bhattacharya, Sanchayan Bhowal, Somabha Mukherjee","submitted_at":"2026-06-05T09:05:29Z","abstract_excerpt":"In this paper, we develop an inferential framework with sharp asymptotic optimality guarantees for Ising models on inhomogeneous random graphs in the subcritical parameter regime. We begin by characterizing the asymptotic distribution of the maximum likelihood (ML) estimate of the natural parameter, based on a single sample from the underlying model, covering both sparse and dense network regimes. Next, to overcome the computational intractability of the ML method, we propose a simple closed-form estimate obtained from a one-step approximation to the likelihood equation. We show that this esti"},"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":"2606.07065","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2026-06-05T09:05:29Z","cross_cats_sorted":["math.PR","stat.ME","stat.TH"],"title_canon_sha256":"9e05e8ea7f6b4a3f52f9f6ef52ad8c643ef67908092eda895e2f1a648699a04c","abstract_canon_sha256":"14225280614b59a769b6f7049a5b073628130143845b4fdf41e8abbe0ffa57d0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-08T01:04:44.152007Z","signature_b64":"TAd332p4RMWom3XZg1sihs3d5jSvdnHSVKCWMJysRR6/+vujyI3JXI9VYjH+ZREwaL/WMu9KKnnPC3siQjA8BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbba5f81016ab9b0f05919d8bce632336578592c72b496055ca9ac96ab2451c5","last_reissued_at":"2026-06-08T01:04:44.151422Z","signature_status":"signed_v1","first_computed_at":"2026-06-08T01:04:44.151422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ising Models on Inhomogeneous Random Graphs: Inference, Local Asymptotic Minimaxity, and Limit of Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR","stat.ME","stat.TH"],"primary_cat":"math.ST","authors_text":"Anirban Chatterjee, Bhaswar B. Bhattacharya, Sanchayan Bhowal, Somabha Mukherjee","submitted_at":"2026-06-05T09:05:29Z","abstract_excerpt":"In this paper, we develop an inferential framework with sharp asymptotic optimality guarantees for Ising models on inhomogeneous random graphs in the subcritical parameter regime. We begin by characterizing the asymptotic distribution of the maximum likelihood (ML) estimate of the natural parameter, based on a single sample from the underlying model, covering both sparse and dense network regimes. Next, to overcome the computational intractability of the ML method, we propose a simple closed-form estimate obtained from a one-step approximation to the likelihood equation. We show that this esti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07065","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/2606.07065/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":"2606.07065","created_at":"2026-06-08T01:04:44.151536+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07065v1","created_at":"2026-06-08T01:04:44.151536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07065","created_at":"2026-06-08T01:04:44.151536+00:00"},{"alias_kind":"pith_short_12","alias_value":"XO5F7AIBNK43","created_at":"2026-06-08T01:04:44.151536+00:00"},{"alias_kind":"pith_short_16","alias_value":"XO5F7AIBNK43B4CZ","created_at":"2026-06-08T01:04:44.151536+00:00"},{"alias_kind":"pith_short_8","alias_value":"XO5F7AIB","created_at":"2026-06-08T01:04:44.151536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.12804","citing_title":"Scaling Limits for Ising Models on Inhomogeneous Random Graphs and Applications","ref_index":54,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN","json":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN.json","graph_json":"https://pith.science/api/pith-number/XO5F7AIBNK43B4CZDHMLZZRSGN/graph.json","events_json":"https://pith.science/api/pith-number/XO5F7AIBNK43B4CZDHMLZZRSGN/events.json","paper":"https://pith.science/paper/XO5F7AIB"},"agent_actions":{"view_html":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN","download_json":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN.json","view_paper":"https://pith.science/paper/XO5F7AIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07065&json=true","fetch_graph":"https://pith.science/api/pith-number/XO5F7AIBNK43B4CZDHMLZZRSGN/graph.json","fetch_events":"https://pith.science/api/pith-number/XO5F7AIBNK43B4CZDHMLZZRSGN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN/action/storage_attestation","attest_author":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN/action/author_attestation","sign_citation":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN/action/citation_signature","submit_replication":"https://pith.science/pith/XO5F7AIBNK43B4CZDHMLZZRSGN/action/replication_record"}},"created_at":"2026-06-08T01:04:44.151536+00:00","updated_at":"2026-06-08T01:04:44.151536+00:00"}