{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:WTCSIEGUTNDLJARKBP3L2ZR4YV","short_pith_number":"pith:WTCSIEGU","schema_version":"1.0","canonical_sha256":"b4c52410d49b46b4822a0bf6bd663cc568693d1e115ce263590c4a0286edcce7","source":{"kind":"arxiv","id":"2607.18559","version":1},"attestation_state":"computed","paper":{"title":"Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Gautam Dasarathy, Vignesh Tirukkonda","submitted_at":"2026-07-20T22:44:45Z","abstract_excerpt":"Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process. We study exact recovery of the graph from one trajectory of random-scan Gaussian Glauber dynamics. Existing techniques for this problem either inherit the mixing time of the chain, which can be super-polynomial in the dimension $p$ without strong assumptions, or are suboptimal in the minimum normalized edge strength $\\kappa$. We propose two algorithms that are mixing-free and attain the $\\kappa^{-2}$ dependence of th"},"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":"2607.18559","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-07-20T22:44:45Z","cross_cats_sorted":["cs.LG","math.ST","stat.TH"],"title_canon_sha256":"7f39cad601ec0ac7ae48c30d0579e1e90ae00fff0e0f1b3665b5d8a21d3d39b6","abstract_canon_sha256":"f576a645899b4a51bfe5f89b3ae429077e8c443dfe3f0d3a59f79b5a7872f11e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-22T00:22:54.344617Z","signature_b64":"E0JAYKQBIZkl/vxC/oToGT/1NZUHOnxZWF6q/zMx/YQbfhlxxCYBi3g3yRlYB6EXFcdbSP4VdhHogc9a9UIJAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4c52410d49b46b4822a0bf6bd663cc568693d1e115ce263590c4a0286edcce7","last_reissued_at":"2026-07-22T00:22:54.343826Z","signature_status":"signed_v1","first_computed_at":"2026-07-22T00:22:54.343826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixing-Free and Signal-Optimal Learning of Gaussian Graphical Models from Glauber Dynamics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.ST","stat.TH"],"primary_cat":"stat.ML","authors_text":"Gautam Dasarathy, Vignesh Tirukkonda","submitted_at":"2026-07-20T22:44:45Z","abstract_excerpt":"Gaussian graphical model selection is usually studied under independent sampling, but in many applications the data arise as a single trajectory of a dependent stochastic process. We study exact recovery of the graph from one trajectory of random-scan Gaussian Glauber dynamics. Existing techniques for this problem either inherit the mixing time of the chain, which can be super-polynomial in the dimension $p$ without strong assumptions, or are suboptimal in the minimum normalized edge strength $\\kappa$. We propose two algorithms that are mixing-free and attain the $\\kappa^{-2}$ dependence of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.18559","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/2607.18559/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":"2607.18559","created_at":"2026-07-22T00:22:54.344235+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.18559v1","created_at":"2026-07-22T00:22:54.344235+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.18559","created_at":"2026-07-22T00:22:54.344235+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTCSIEGUTNDL","created_at":"2026-07-22T00:22:54.344235+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTCSIEGUTNDLJARK","created_at":"2026-07-22T00:22:54.344235+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTCSIEGU","created_at":"2026-07-22T00:22:54.344235+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/WTCSIEGUTNDLJARKBP3L2ZR4YV","json":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV.json","graph_json":"https://pith.science/api/pith-number/WTCSIEGUTNDLJARKBP3L2ZR4YV/graph.json","events_json":"https://pith.science/api/pith-number/WTCSIEGUTNDLJARKBP3L2ZR4YV/events.json","paper":"https://pith.science/paper/WTCSIEGU"},"agent_actions":{"view_html":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV","download_json":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV.json","view_paper":"https://pith.science/paper/WTCSIEGU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.18559&json=true","fetch_graph":"https://pith.science/api/pith-number/WTCSIEGUTNDLJARKBP3L2ZR4YV/graph.json","fetch_events":"https://pith.science/api/pith-number/WTCSIEGUTNDLJARKBP3L2ZR4YV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV/action/storage_attestation","attest_author":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV/action/author_attestation","sign_citation":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV/action/citation_signature","submit_replication":"https://pith.science/pith/WTCSIEGUTNDLJARKBP3L2ZR4YV/action/replication_record"}},"created_at":"2026-07-22T00:22:54.344235+00:00","updated_at":"2026-07-22T00:22:54.344235+00:00"}