{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:MKFUOFOJEKSVVQV3DHPB7PAAVQ","short_pith_number":"pith:MKFUOFOJ","canonical_record":{"source":{"id":"1203.2213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-10T00:02:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"023ccfab3df8b3d622656512ee31ea942401b2563b3939d2281f06a104e4e36d","abstract_canon_sha256":"23cdbc4bd412de2f010e1fa22ade49e5d9a8eb8c7f0750a6c2b0bdd7961624dc"},"schema_version":"1.0"},"canonical_sha256":"628b4715c922a55ac2bb19de1fbc00ac0dce74ca7664d56f1232f70fa21a29ca","source":{"kind":"arxiv","id":"1203.2213","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2213","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2213v1","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2213","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"MKFUOFOJEKSV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MKFUOFOJEKSVVQV3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MKFUOFOJ","created_at":"2026-05-18T12:27:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:MKFUOFOJEKSVVQV3DHPB7PAAVQ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.2213","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-10T00:02:23Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"023ccfab3df8b3d622656512ee31ea942401b2563b3939d2281f06a104e4e36d","abstract_canon_sha256":"23cdbc4bd412de2f010e1fa22ade49e5d9a8eb8c7f0750a6c2b0bdd7961624dc"},"schema_version":"1.0"},"canonical_sha256":"628b4715c922a55ac2bb19de1fbc00ac0dce74ca7664d56f1232f70fa21a29ca","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:26.092629Z","signature_b64":"4IP1G3kpLPrPP8SVUVnyWs7skrdOfmYDouGTQPg8PWENUnDpo1fvEzW+fCHorEDhnSqcrRG4UGj+U6+KuEoSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"628b4715c922a55ac2bb19de1fbc00ac0dce74ca7664d56f1232f70fa21a29ca","last_reissued_at":"2026-05-18T04:00:26.092139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:26.092139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.2213","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-18T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"921362hxrhAXcdd+r0IycYJ71Mo5bQlcs2f++BuBt3yPg/0AGB6RfYFS0vjN3hRCLQ2ti/9KzOHpavJRypHFDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:45:53.528595Z"},"content_sha256":"09dd154ef811b54d6be872d7e6515b9fca2db08eabe4c1060b32d278516d5c0f","schema_version":"1.0","event_id":"sha256:09dd154ef811b54d6be872d7e6515b9fca2db08eabe4c1060b32d278516d5c0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:MKFUOFOJEKSVVQV3DHPB7PAAVQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Dimakis, Babak Hassibi, Weiyu Xu","submitted_at":"2012-03-10T00:02:23Z","abstract_excerpt":"In this paper, we study the mixing time of Markov Chain Monte Carlo (MCMC) for integer least-square (LS) optimization problems. It is found that the mixing time of MCMC for integer LS problems depends on the structure of the underlying lattice. More specifically, the mixing time of MCMC is closely related to whether there is a local minimum in the lattice structure. For some lattices, the mixing time of the Markov chain is independent of the signal-to-noise ($SNR$) ratio and grows polynomially in the problem dimension; while for some lattices, the mixing time grows unboundedly as $SNR$ grows. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2213","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-18T04:00:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yYku99WwtW3naOyA/4CGLIB2d2AyjuGH3T3IzoOC82uWRpafRWflfEUmOMtD5xKGjVN2dhzJ0zVKZksPTzGKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:45:53.528997Z"},"content_sha256":"16afc6a42121dc7144066325c78f09af5ddd4ca7c2864ba8c186ea8dff442251","schema_version":"1.0","event_id":"sha256:16afc6a42121dc7144066325c78f09af5ddd4ca7c2864ba8c186ea8dff442251"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MKFUOFOJEKSVVQV3DHPB7PAAVQ/bundle.json","state_url":"https://pith.science/pith/MKFUOFOJEKSVVQV3DHPB7PAAVQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MKFUOFOJEKSVVQV3DHPB7PAAVQ/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-06-11T06:45:53Z","links":{"resolver":"https://pith.science/pith/MKFUOFOJEKSVVQV3DHPB7PAAVQ","bundle":"https://pith.science/pith/MKFUOFOJEKSVVQV3DHPB7PAAVQ/bundle.json","state":"https://pith.science/pith/MKFUOFOJEKSVVQV3DHPB7PAAVQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MKFUOFOJEKSVVQV3DHPB7PAAVQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:MKFUOFOJEKSVVQV3DHPB7PAAVQ","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":"23cdbc4bd412de2f010e1fa22ade49e5d9a8eb8c7f0750a6c2b0bdd7961624dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-10T00:02:23Z","title_canon_sha256":"023ccfab3df8b3d622656512ee31ea942401b2563b3939d2281f06a104e4e36d"},"schema_version":"1.0","source":{"id":"1203.2213","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.2213","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"arxiv_version","alias_value":"1203.2213v1","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.2213","created_at":"2026-05-18T04:00:26Z"},{"alias_kind":"pith_short_12","alias_value":"MKFUOFOJEKSV","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_16","alias_value":"MKFUOFOJEKSVVQV3","created_at":"2026-05-18T12:27:14Z"},{"alias_kind":"pith_short_8","alias_value":"MKFUOFOJ","created_at":"2026-05-18T12:27:14Z"}],"graph_snapshots":[{"event_id":"sha256:16afc6a42121dc7144066325c78f09af5ddd4ca7c2864ba8c186ea8dff442251","target":"graph","created_at":"2026-05-18T04:00:26Z","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":"In this paper, we study the mixing time of Markov Chain Monte Carlo (MCMC) for integer least-square (LS) optimization problems. It is found that the mixing time of MCMC for integer LS problems depends on the structure of the underlying lattice. More specifically, the mixing time of MCMC is closely related to whether there is a local minimum in the lattice structure. For some lattices, the mixing time of the Markov chain is independent of the signal-to-noise ($SNR$) ratio and grows polynomially in the problem dimension; while for some lattices, the mixing time grows unboundedly as $SNR$ grows. ","authors_text":"Alex Dimakis, Babak Hassibi, Weiyu Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-10T00:02:23Z","title":"On the Mixing Time of Markov Chain Monte Carlo for Integer Least-Square Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.2213","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:09dd154ef811b54d6be872d7e6515b9fca2db08eabe4c1060b32d278516d5c0f","target":"record","created_at":"2026-05-18T04:00:26Z","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":"23cdbc4bd412de2f010e1fa22ade49e5d9a8eb8c7f0750a6c2b0bdd7961624dc","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-10T00:02:23Z","title_canon_sha256":"023ccfab3df8b3d622656512ee31ea942401b2563b3939d2281f06a104e4e36d"},"schema_version":"1.0","source":{"id":"1203.2213","kind":"arxiv","version":1}},"canonical_sha256":"628b4715c922a55ac2bb19de1fbc00ac0dce74ca7664d56f1232f70fa21a29ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"628b4715c922a55ac2bb19de1fbc00ac0dce74ca7664d56f1232f70fa21a29ca","first_computed_at":"2026-05-18T04:00:26.092139Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:26.092139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4IP1G3kpLPrPP8SVUVnyWs7skrdOfmYDouGTQPg8PWENUnDpo1fvEzW+fCHorEDhnSqcrRG4UGj+U6+KuEoSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:26.092629Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.2213","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:09dd154ef811b54d6be872d7e6515b9fca2db08eabe4c1060b32d278516d5c0f","sha256:16afc6a42121dc7144066325c78f09af5ddd4ca7c2864ba8c186ea8dff442251"],"state_sha256":"71d250932ad9bf5a67a27b4134143c936f5f7f5e09d32b7d64ced98855631d46"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eVdsW8IGYhkarNVQa63GFZcRZ3KOMwWgxAgRZyUwPHOXAOeHBItQZgCQ3/bTVAMpxesrwtYVMPi1NvmzFmhZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:45:53.531826Z","bundle_sha256":"caaa9c63e2984b5aadb71d42fcdc9576f363b820378f15459658e23413c946c0"}}