{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:7K553BRNQ6B3O7M2OTDECQAAPY","short_pith_number":"pith:7K553BRN","schema_version":"1.0","canonical_sha256":"fabbdd862d8783b77d9a74c64140007e3818e85ba073617419f2ab65259c77f9","source":{"kind":"arxiv","id":"2602.23059","version":2},"attestation_state":"computed","paper":{"title":"Nearest Reversible Markov Chains with Sparsity Constraints: An Optimization Approach","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Beatrice Meini, Fabio Durastante, Miryam Gnazzo, Stefano Cipolla","submitted_at":"2026-02-26T14:44:54Z","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"},"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":"2602.23059","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"math.NA","submitted_at":"2026-02-26T14:44:54Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"478d7a724c8805bde8614ce86088327fc9cdac2fa4e3db5ba371f8ac7fd70a03","abstract_canon_sha256":"694ede85efaa984b273ffeb391aacd0a339079c0fe5fce9ff4545f05f93fd79f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T01:15:01.445046Z","signature_b64":"KCrp6M60nQQcXOQVnhG6XPVoDwezoUHHzk8/7L+qq9hpdu8E5fXt3eAJrXXhuwHOL+nVxD0s/hMlqAP4igi3DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fabbdd862d8783b77d9a74c64140007e3818e85ba073617419f2ab65259c77f9","last_reissued_at":"2026-06-24T01:15:01.444572Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T01:15:01.444572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearest Reversible Markov Chains with Sparsity Constraints: An Optimization Approach","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Beatrice Meini, Fabio Durastante, Miryam Gnazzo, Stefano Cipolla","submitted_at":"2026-02-26T14:44:54Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.23059","kind":"arxiv","version":2},"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/2602.23059/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":"2602.23059","created_at":"2026-06-24T01:15:01.444629+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.23059v2","created_at":"2026-06-24T01:15:01.444629+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.23059","created_at":"2026-06-24T01:15:01.444629+00:00"},{"alias_kind":"pith_short_12","alias_value":"7K553BRNQ6B3","created_at":"2026-06-24T01:15:01.444629+00:00"},{"alias_kind":"pith_short_16","alias_value":"7K553BRNQ6B3O7M2","created_at":"2026-06-24T01:15:01.444629+00:00"},{"alias_kind":"pith_short_8","alias_value":"7K553BRN","created_at":"2026-06-24T01:15:01.444629+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/7K553BRNQ6B3O7M2OTDECQAAPY","json":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY.json","graph_json":"https://pith.science/api/pith-number/7K553BRNQ6B3O7M2OTDECQAAPY/graph.json","events_json":"https://pith.science/api/pith-number/7K553BRNQ6B3O7M2OTDECQAAPY/events.json","paper":"https://pith.science/paper/7K553BRN"},"agent_actions":{"view_html":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY","download_json":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY.json","view_paper":"https://pith.science/paper/7K553BRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.23059&json=true","fetch_graph":"https://pith.science/api/pith-number/7K553BRNQ6B3O7M2OTDECQAAPY/graph.json","fetch_events":"https://pith.science/api/pith-number/7K553BRNQ6B3O7M2OTDECQAAPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY/action/storage_attestation","attest_author":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY/action/author_attestation","sign_citation":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY/action/citation_signature","submit_replication":"https://pith.science/pith/7K553BRNQ6B3O7M2OTDECQAAPY/action/replication_record"}},"created_at":"2026-06-24T01:15:01.444629+00:00","updated_at":"2026-06-24T01:15:01.444629+00:00"}