{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7K553BRNQ6B3O7M2OTDECQAAPY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"694ede85efaa984b273ffeb391aacd0a339079c0fe5fce9ff4545f05f93fd79f","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-26T14:44:54Z","title_canon_sha256":"478d7a724c8805bde8614ce86088327fc9cdac2fa4e3db5ba371f8ac7fd70a03"},"schema_version":"1.0","source":{"id":"2602.23059","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.23059","created_at":"2026-06-24T01:15:01Z"},{"alias_kind":"arxiv_version","alias_value":"2602.23059v2","created_at":"2026-06-24T01:15:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.23059","created_at":"2026-06-24T01:15:01Z"},{"alias_kind":"pith_short_12","alias_value":"7K553BRNQ6B3","created_at":"2026-06-24T01:15:01Z"},{"alias_kind":"pith_short_16","alias_value":"7K553BRNQ6B3O7M2","created_at":"2026-06-24T01:15:01Z"},{"alias_kind":"pith_short_8","alias_value":"7K553BRN","created_at":"2026-06-24T01:15:01Z"}],"graph_snapshots":[{"event_id":"sha256:d7d1976a69e2b385e76fb334b62e68085ff76a997c2c98a9a7d3b9ded4600c14","target":"graph","created_at":"2026-06-24T01:15:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.23059/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Reversibility is a key property of Markov chains, central to algorithms such as Metropolis-Hastings and other MCMC methods. Yet many applications yield non-reversible chains, motivating the problem of approximating them by reversible ones with minimal modification. We formulate this task as a matrix nearness problem and focus on the practically relevant case of sparse transition matrices. The resulting optimization problem is a quadratic programming problem, and numerical experiments illustrate the effectiveness of the approach. This framework provides a principled way to enforce reversibility","authors_text":"Beatrice Meini, Fabio Durastante, Miryam Gnazzo, Stefano Cipolla","cross_cats":["cs.NA"],"headline":"","license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-26T14:44:54Z","title":"Nearest Reversible Markov Chains with Sparsity Constraints: An Optimization Approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.23059","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3ad892216051deb432bf69d8c8ec19a3f9b72e8b3cee49d930b70b804aef89d7","target":"record","created_at":"2026-06-24T01:15:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"694ede85efaa984b273ffeb391aacd0a339079c0fe5fce9ff4545f05f93fd79f","cross_cats_sorted":["cs.NA"],"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-26T14:44:54Z","title_canon_sha256":"478d7a724c8805bde8614ce86088327fc9cdac2fa4e3db5ba371f8ac7fd70a03"},"schema_version":"1.0","source":{"id":"2602.23059","kind":"arxiv","version":2}},"canonical_sha256":"fabbdd862d8783b77d9a74c64140007e3818e85ba073617419f2ab65259c77f9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fabbdd862d8783b77d9a74c64140007e3818e85ba073617419f2ab65259c77f9","first_computed_at":"2026-06-24T01:15:01.444572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-24T01:15:01.444572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KCrp6M60nQQcXOQVnhG6XPVoDwezoUHHzk8/7L+qq9hpdu8E5fXt3eAJrXXhuwHOL+nVxD0s/hMlqAP4igi3DQ==","signature_status":"signed_v1","signed_at":"2026-06-24T01:15:01.445046Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.23059","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ad892216051deb432bf69d8c8ec19a3f9b72e8b3cee49d930b70b804aef89d7","sha256:d7d1976a69e2b385e76fb334b62e68085ff76a997c2c98a9a7d3b9ded4600c14"],"state_sha256":"24df982cd8d3caa2eecb3ace856a5ac7e0e1f621baba3c74a39646386a71b803"}