{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4X7Y6WHKKC7O7BCDHWFRJRIVMA","short_pith_number":"pith:4X7Y6WHK","schema_version":"1.0","canonical_sha256":"e5ff8f58ea50beef84433d8b14c515602cc0372ffea126d6ece17c501a9e0525","source":{"kind":"arxiv","id":"2307.13750","version":1},"attestation_state":"computed","paper":{"title":"Solution Path of Time-varying Markov Random Fields with Discrete Regularization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andres Gomez, Salar Fattahi","submitted_at":"2023-07-25T18:19:50Z","abstract_excerpt":"We study the problem of inferring sparse time-varying Markov random fields (MRFs) with different discrete and temporal regularizations on the parameters. Due to the intractability of discrete regularization, most approaches for solving this problem rely on the so-called maximum-likelihood estimation (MLE) with relaxed regularization, which neither results in ideal statistical properties nor scale to the dimensions encountered in realistic settings. In this paper, we address these challenges by departing from the MLE paradigm and resorting to a new class of constrained optimization problems wit"},"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":"2307.13750","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2023-07-25T18:19:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"959e823031683a0713785354af2e2410e0e4e613ba86712e120df26612795d12","abstract_canon_sha256":"1c10cda46650c077c8679d76870f5b78712164a334b72d3b06fbd08381536bfb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:34:52.075023Z","signature_b64":"LOxFUomMcBB1OVtX1dIG2RfZDayWVAbHmh1SC9tqsLiLk5ojRUKqbLwwV0cyeQJ3lvJTKiv7A9iHlWkZPToCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5ff8f58ea50beef84433d8b14c515602cc0372ffea126d6ece17c501a9e0525","last_reissued_at":"2026-07-05T06:34:52.074593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:34:52.074593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solution Path of Time-varying Markov Random Fields with Discrete Regularization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Andres Gomez, Salar Fattahi","submitted_at":"2023-07-25T18:19:50Z","abstract_excerpt":"We study the problem of inferring sparse time-varying Markov random fields (MRFs) with different discrete and temporal regularizations on the parameters. Due to the intractability of discrete regularization, most approaches for solving this problem rely on the so-called maximum-likelihood estimation (MLE) with relaxed regularization, which neither results in ideal statistical properties nor scale to the dimensions encountered in realistic settings. In this paper, we address these challenges by departing from the MLE paradigm and resorting to a new class of constrained optimization problems wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.13750","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/2307.13750/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":"2307.13750","created_at":"2026-07-05T06:34:52.074656+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.13750v1","created_at":"2026-07-05T06:34:52.074656+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.13750","created_at":"2026-07-05T06:34:52.074656+00:00"},{"alias_kind":"pith_short_12","alias_value":"4X7Y6WHKKC7O","created_at":"2026-07-05T06:34:52.074656+00:00"},{"alias_kind":"pith_short_16","alias_value":"4X7Y6WHKKC7O7BCD","created_at":"2026-07-05T06:34:52.074656+00:00"},{"alias_kind":"pith_short_8","alias_value":"4X7Y6WHK","created_at":"2026-07-05T06:34:52.074656+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.01385","citing_title":"Coordinate Optimality Reformulation for Mixed-Integer Convex Programs with Indicators","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA","json":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA.json","graph_json":"https://pith.science/api/pith-number/4X7Y6WHKKC7O7BCDHWFRJRIVMA/graph.json","events_json":"https://pith.science/api/pith-number/4X7Y6WHKKC7O7BCDHWFRJRIVMA/events.json","paper":"https://pith.science/paper/4X7Y6WHK"},"agent_actions":{"view_html":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA","download_json":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA.json","view_paper":"https://pith.science/paper/4X7Y6WHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.13750&json=true","fetch_graph":"https://pith.science/api/pith-number/4X7Y6WHKKC7O7BCDHWFRJRIVMA/graph.json","fetch_events":"https://pith.science/api/pith-number/4X7Y6WHKKC7O7BCDHWFRJRIVMA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA/action/storage_attestation","attest_author":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA/action/author_attestation","sign_citation":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA/action/citation_signature","submit_replication":"https://pith.science/pith/4X7Y6WHKKC7O7BCDHWFRJRIVMA/action/replication_record"}},"created_at":"2026-07-05T06:34:52.074656+00:00","updated_at":"2026-07-05T06:34:52.074656+00:00"}