{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:TWARIZRXMD34PP4J7T46V7RMAP","short_pith_number":"pith:TWARIZRX","canonical_record":{"source":{"id":"1810.06032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-14T13:24:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5e8f42f608a060bb64af016335bb858fda33d0d14261e1d655bb86ffbd47ea73","abstract_canon_sha256":"b173631dfc407539c4777428876a49868f58229c1c01499c8628f00b01e1d313"},"schema_version":"1.0"},"canonical_sha256":"9d8114663760f7c7bf89fcf9eafe2c03d5e3e694134599bf364abc2413acdb7e","source":{"kind":"arxiv","id":"1810.06032","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06032","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06032v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06032","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"TWARIZRXMD34","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TWARIZRXMD34PP4J","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TWARIZRX","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:TWARIZRXMD34PP4J7T46V7RMAP","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06032","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-14T13:24:48Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"5e8f42f608a060bb64af016335bb858fda33d0d14261e1d655bb86ffbd47ea73","abstract_canon_sha256":"b173631dfc407539c4777428876a49868f58229c1c01499c8628f00b01e1d313"},"schema_version":"1.0"},"canonical_sha256":"9d8114663760f7c7bf89fcf9eafe2c03d5e3e694134599bf364abc2413acdb7e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:21.638592Z","signature_b64":"YOfUp15VC151cHMRysx5z/SWYkuEHRJHbzkBHJXnZijuLKFEYyAKrRPgaegMdv/aCLZ51UZxUtecV+9Tr2qvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d8114663760f7c7bf89fcf9eafe2c03d5e3e694134599bf364abc2413acdb7e","last_reissued_at":"2026-05-18T00:03:21.637889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:21.637889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06032","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EonUbyB1pYR5LVJsK1stTC5NGk8od+xN4tab9dgYZ44z0DneWZReXoi+AwgTIco/FfynMUBYdh5pyXOaQPKtBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:08.425516Z"},"content_sha256":"5c13262c4a0b87bc0bd0f86b86d5669eefa2dbbd527efd73dcab273992b63076","schema_version":"1.0","event_id":"sha256:5c13262c4a0b87bc0bd0f86b86d5669eefa2dbbd527efd73dcab273992b63076"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:TWARIZRXMD34PP4J7T46V7RMAP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Mengdi Wang, Yaqi Duan, Yaxiang Yuan, Zaiwen Wen","submitted_at":"2018-10-14T13:24:48Z","abstract_excerpt":"This paper develops a low-nonnegative-rank approximation method to identify the state aggregation structure of a finite-state Markov chain under an assumption that the state space can be mapped into a handful of meta-states. The number of meta-states is characterized by the nonnegative rank of the Markov transition matrix. Motivated by the success of the nuclear norm relaxation in low rank minimization problems, we propose an atomic regularizer as a convex surrogate for the nonnegative rank and formulate a convex optimization problem. Because the atomic regularizer itself is not computationall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06032","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UD1QYnTovsUEa1hAmQcl1duF0MSHOx8jPAQ2gMZFDQcAxHXk3DhOWt6aI5cpPLI0nmDWR9P1uS0IFMUqBobaAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:08.426160Z"},"content_sha256":"881cef5c59aea73e32bf0074285bbb06ad6f1bd79ceb56d4f47738090f6d3f8a","schema_version":"1.0","event_id":"sha256:881cef5c59aea73e32bf0074285bbb06ad6f1bd79ceb56d4f47738090f6d3f8a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TWARIZRXMD34PP4J7T46V7RMAP/bundle.json","state_url":"https://pith.science/pith/TWARIZRXMD34PP4J7T46V7RMAP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TWARIZRXMD34PP4J7T46V7RMAP/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T23:14:08Z","links":{"resolver":"https://pith.science/pith/TWARIZRXMD34PP4J7T46V7RMAP","bundle":"https://pith.science/pith/TWARIZRXMD34PP4J7T46V7RMAP/bundle.json","state":"https://pith.science/pith/TWARIZRXMD34PP4J7T46V7RMAP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TWARIZRXMD34PP4J7T46V7RMAP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:TWARIZRXMD34PP4J7T46V7RMAP","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":"b173631dfc407539c4777428876a49868f58229c1c01499c8628f00b01e1d313","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-14T13:24:48Z","title_canon_sha256":"5e8f42f608a060bb64af016335bb858fda33d0d14261e1d655bb86ffbd47ea73"},"schema_version":"1.0","source":{"id":"1810.06032","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06032","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06032v1","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06032","created_at":"2026-05-18T00:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"TWARIZRXMD34","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"TWARIZRXMD34PP4J","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"TWARIZRX","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:881cef5c59aea73e32bf0074285bbb06ad6f1bd79ceb56d4f47738090f6d3f8a","target":"graph","created_at":"2026-05-18T00:03:21Z","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"},"paper":{"abstract_excerpt":"This paper develops a low-nonnegative-rank approximation method to identify the state aggregation structure of a finite-state Markov chain under an assumption that the state space can be mapped into a handful of meta-states. The number of meta-states is characterized by the nonnegative rank of the Markov transition matrix. Motivated by the success of the nuclear norm relaxation in low rank minimization problems, we propose an atomic regularizer as a convex surrogate for the nonnegative rank and formulate a convex optimization problem. Because the atomic regularizer itself is not computationall","authors_text":"Mengdi Wang, Yaqi Duan, Yaxiang Yuan, Zaiwen Wen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-14T13:24:48Z","title":"Adaptive Low-Nonnegative-Rank Approximation for State Aggregation of Markov Chains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06032","kind":"arxiv","version":1},"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:5c13262c4a0b87bc0bd0f86b86d5669eefa2dbbd527efd73dcab273992b63076","target":"record","created_at":"2026-05-18T00:03:21Z","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":"b173631dfc407539c4777428876a49868f58229c1c01499c8628f00b01e1d313","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-14T13:24:48Z","title_canon_sha256":"5e8f42f608a060bb64af016335bb858fda33d0d14261e1d655bb86ffbd47ea73"},"schema_version":"1.0","source":{"id":"1810.06032","kind":"arxiv","version":1}},"canonical_sha256":"9d8114663760f7c7bf89fcf9eafe2c03d5e3e694134599bf364abc2413acdb7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9d8114663760f7c7bf89fcf9eafe2c03d5e3e694134599bf364abc2413acdb7e","first_computed_at":"2026-05-18T00:03:21.637889Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:21.637889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YOfUp15VC151cHMRysx5z/SWYkuEHRJHbzkBHJXnZijuLKFEYyAKrRPgaegMdv/aCLZ51UZxUtecV+9Tr2qvBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:21.638592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06032","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5c13262c4a0b87bc0bd0f86b86d5669eefa2dbbd527efd73dcab273992b63076","sha256:881cef5c59aea73e32bf0074285bbb06ad6f1bd79ceb56d4f47738090f6d3f8a"],"state_sha256":"311a8ea8a3ad763173dd02485907c2bff42ad5f0f57b1b42dbd14d9321177cef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hstTOL73SWamEobEe2PGpJGNRXcDztzk1R+wLzbIwZPfexfe8JPZ3jNQdPQ89W3W1h+WRnA5seckPf7r9qmmCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:14:08.429804Z","bundle_sha256":"ff7ca5e1c3f7380202efc38464f76069835f8b027049b3f5fa67a9dce2d58fa3"}}