{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:523VJKQ6QVVIK2VRFAOTA3NW4P","short_pith_number":"pith:523VJKQ6","schema_version":"1.0","canonical_sha256":"eeb754aa1e856a856ab1281d306db6e3c5934dcb79fa1e323538c3ede260d7da","source":{"kind":"arxiv","id":"1603.01640","version":1},"attestation_state":"computed","paper":{"title":"Reversible Markov chain estimation using convex-concave programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP"],"primary_cat":"physics.data-an","authors_text":"Benjamin Trendelkamp-Schroer, Frank Noe, Hao Wu","submitted_at":"2016-03-04T21:55:40Z","abstract_excerpt":"We present a convex-concave reformulation of the reversible Markov chain estimation problem and outline an efficient numerical scheme for the solution of the resulting problem based on a primal-dual interior point method for monotone variational inequalities. Extensions to situations in which information about the stationary vector is available can also be solved via the convex- concave reformulation. The method can be generalized and applied to the discrete transition matrix reweighting analysis method to perform inference from independent chains with specified couplings between the stationar"},"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":"1603.01640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"physics.data-an","submitted_at":"2016-03-04T21:55:40Z","cross_cats_sorted":["math.OC","stat.AP"],"title_canon_sha256":"deee46023edce058bbed6e2c14f401abf752e0f33e19fcd1fcd9ff5f2f8c06e3","abstract_canon_sha256":"77b4c8dd9ed8038f5d903d6d11d37c87fafae442bf4847e81ee033f571031a67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:35.107105Z","signature_b64":"GmcafbcgSms1ocOdioQ1OS/Cr4Rf9qAN7HgoAdvqPRdbrMR4rzuJ1BCSjuZHZySQ3FdULmpBA7W9mfRVsnH1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eeb754aa1e856a856ab1281d306db6e3c5934dcb79fa1e323538c3ede260d7da","last_reissued_at":"2026-05-18T01:19:35.106657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:35.106657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reversible Markov chain estimation using convex-concave programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.AP"],"primary_cat":"physics.data-an","authors_text":"Benjamin Trendelkamp-Schroer, Frank Noe, Hao Wu","submitted_at":"2016-03-04T21:55:40Z","abstract_excerpt":"We present a convex-concave reformulation of the reversible Markov chain estimation problem and outline an efficient numerical scheme for the solution of the resulting problem based on a primal-dual interior point method for monotone variational inequalities. Extensions to situations in which information about the stationary vector is available can also be solved via the convex- concave reformulation. The method can be generalized and applied to the discrete transition matrix reweighting analysis method to perform inference from independent chains with specified couplings between the stationar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01640","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":""},"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":"1603.01640","created_at":"2026-05-18T01:19:35.106720+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.01640v1","created_at":"2026-05-18T01:19:35.106720+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01640","created_at":"2026-05-18T01:19:35.106720+00:00"},{"alias_kind":"pith_short_12","alias_value":"523VJKQ6QVVI","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_16","alias_value":"523VJKQ6QVVIK2VR","created_at":"2026-05-18T12:29:58.707656+00:00"},{"alias_kind":"pith_short_8","alias_value":"523VJKQ6","created_at":"2026-05-18T12:29:58.707656+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/523VJKQ6QVVIK2VRFAOTA3NW4P","json":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P.json","graph_json":"https://pith.science/api/pith-number/523VJKQ6QVVIK2VRFAOTA3NW4P/graph.json","events_json":"https://pith.science/api/pith-number/523VJKQ6QVVIK2VRFAOTA3NW4P/events.json","paper":"https://pith.science/paper/523VJKQ6"},"agent_actions":{"view_html":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P","download_json":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P.json","view_paper":"https://pith.science/paper/523VJKQ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.01640&json=true","fetch_graph":"https://pith.science/api/pith-number/523VJKQ6QVVIK2VRFAOTA3NW4P/graph.json","fetch_events":"https://pith.science/api/pith-number/523VJKQ6QVVIK2VRFAOTA3NW4P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P/action/storage_attestation","attest_author":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P/action/author_attestation","sign_citation":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P/action/citation_signature","submit_replication":"https://pith.science/pith/523VJKQ6QVVIK2VRFAOTA3NW4P/action/replication_record"}},"created_at":"2026-05-18T01:19:35.106720+00:00","updated_at":"2026-05-18T01:19:35.106720+00:00"}