{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4IPVFPZTVKSNG2PWD4LCQC53TP","short_pith_number":"pith:4IPVFPZT","canonical_record":{"source":{"id":"1710.10037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-27T09:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"ad02590f84a0cfd3033058ce1948fe3ae365c5301dbfb8a50486f691ee042594","abstract_canon_sha256":"09d2ee5113d2f33e680f37f1beb95efd6468ac0a88d94290f8d5b577d486baee"},"schema_version":"1.0"},"canonical_sha256":"e21f52bf33aaa4d369f61f16280bbb9bd00fc6b27e1dd42986a218e778d8aa08","source":{"kind":"arxiv","id":"1710.10037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10037","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10037v1","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10037","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"4IPVFPZTVKSN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4IPVFPZTVKSNG2PW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4IPVFPZT","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4IPVFPZTVKSNG2PWD4LCQC53TP","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-27T09:16:32Z","cross_cats_sorted":[],"title_canon_sha256":"ad02590f84a0cfd3033058ce1948fe3ae365c5301dbfb8a50486f691ee042594","abstract_canon_sha256":"09d2ee5113d2f33e680f37f1beb95efd6468ac0a88d94290f8d5b577d486baee"},"schema_version":"1.0"},"canonical_sha256":"e21f52bf33aaa4d369f61f16280bbb9bd00fc6b27e1dd42986a218e778d8aa08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:54.909911Z","signature_b64":"aR+ygN9StO0U2IMc3D24cyxnnQi4myTkerq/2L1jZRKI/JWVRgtVpquZV9Qns8U9HM/mnT88tgL9nVsLtmGnCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e21f52bf33aaa4d369f61f16280bbb9bd00fc6b27e1dd42986a218e778d8aa08","last_reissued_at":"2026-05-18T00:31:54.909142Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:54.909142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10037","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:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nGqQkiPYOZVgkQisd5hEHRjTGyyq5korMJ3VEpTp5mzn5ywYgatvsK3+T29ZgDxKWaWSDUrwsYastivOWJUCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:38:52.197219Z"},"content_sha256":"2a00243e086356da3eaf7f65c9db9ef0a12e14f1a375d5a2b10cf48ac22edc78","schema_version":"1.0","event_id":"sha256:2a00243e086356da3eaf7f65c9db9ef0a12e14f1a375d5a2b10cf48ac22edc78"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4IPVFPZTVKSNG2PWD4LCQC53TP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rapidly Mixing Markov Chain Monte Carlo Technique for Matching Problems with Global Utility Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Madhu N. Belur, Prasanna Chaporkar, Shana Moothedath","submitted_at":"2017-10-27T09:16:32Z","abstract_excerpt":"This paper deals with a complete bipartite matching problem with the objective of finding an optimal matching that maximizes a certain generic predefined utility function on the set of all matchings. After proving the NP-hardness of the problem using reduction from the 3-SAT problem, we propose a randomized algorithm based on Markov Chain Monte Carlo (MCMC) technique for solving this. We sample from Gibb's distribution and construct a reversible positive recurrent discrete time Markov chain (DTMC) that has the steady state distribution same as the Gibb's distribution. In one of our key contrib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10037","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:31:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rMAlbQLrZPcSDXxIKFpWHlo6JXap9EtjEqKARdD3EwgLrj/3Nc5lnnW5HYgfIrsp2sdTp+5g7vRtv/sLTAYHBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T01:38:52.197589Z"},"content_sha256":"86f207331fe77d122990041bc1f81c2b8aa10925c7968d0bbc9a86ef25c9f45b","schema_version":"1.0","event_id":"sha256:86f207331fe77d122990041bc1f81c2b8aa10925c7968d0bbc9a86ef25c9f45b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4IPVFPZTVKSNG2PWD4LCQC53TP/bundle.json","state_url":"https://pith.science/pith/4IPVFPZTVKSNG2PWD4LCQC53TP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4IPVFPZTVKSNG2PWD4LCQC53TP/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-04T01:38:52Z","links":{"resolver":"https://pith.science/pith/4IPVFPZTVKSNG2PWD4LCQC53TP","bundle":"https://pith.science/pith/4IPVFPZTVKSNG2PWD4LCQC53TP/bundle.json","state":"https://pith.science/pith/4IPVFPZTVKSNG2PWD4LCQC53TP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4IPVFPZTVKSNG2PWD4LCQC53TP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4IPVFPZTVKSNG2PWD4LCQC53TP","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":"09d2ee5113d2f33e680f37f1beb95efd6468ac0a88d94290f8d5b577d486baee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-27T09:16:32Z","title_canon_sha256":"ad02590f84a0cfd3033058ce1948fe3ae365c5301dbfb8a50486f691ee042594"},"schema_version":"1.0","source":{"id":"1710.10037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10037","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10037v1","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10037","created_at":"2026-05-18T00:31:54Z"},{"alias_kind":"pith_short_12","alias_value":"4IPVFPZTVKSN","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4IPVFPZTVKSNG2PW","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4IPVFPZT","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:86f207331fe77d122990041bc1f81c2b8aa10925c7968d0bbc9a86ef25c9f45b","target":"graph","created_at":"2026-05-18T00:31:54Z","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 deals with a complete bipartite matching problem with the objective of finding an optimal matching that maximizes a certain generic predefined utility function on the set of all matchings. After proving the NP-hardness of the problem using reduction from the 3-SAT problem, we propose a randomized algorithm based on Markov Chain Monte Carlo (MCMC) technique for solving this. We sample from Gibb's distribution and construct a reversible positive recurrent discrete time Markov chain (DTMC) that has the steady state distribution same as the Gibb's distribution. In one of our key contrib","authors_text":"Madhu N. Belur, Prasanna Chaporkar, Shana Moothedath","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-27T09:16:32Z","title":"Rapidly Mixing Markov Chain Monte Carlo Technique for Matching Problems with Global Utility Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10037","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:2a00243e086356da3eaf7f65c9db9ef0a12e14f1a375d5a2b10cf48ac22edc78","target":"record","created_at":"2026-05-18T00:31:54Z","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":"09d2ee5113d2f33e680f37f1beb95efd6468ac0a88d94290f8d5b577d486baee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-10-27T09:16:32Z","title_canon_sha256":"ad02590f84a0cfd3033058ce1948fe3ae365c5301dbfb8a50486f691ee042594"},"schema_version":"1.0","source":{"id":"1710.10037","kind":"arxiv","version":1}},"canonical_sha256":"e21f52bf33aaa4d369f61f16280bbb9bd00fc6b27e1dd42986a218e778d8aa08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e21f52bf33aaa4d369f61f16280bbb9bd00fc6b27e1dd42986a218e778d8aa08","first_computed_at":"2026-05-18T00:31:54.909142Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:54.909142Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aR+ygN9StO0U2IMc3D24cyxnnQi4myTkerq/2L1jZRKI/JWVRgtVpquZV9Qns8U9HM/mnT88tgL9nVsLtmGnCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:54.909911Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a00243e086356da3eaf7f65c9db9ef0a12e14f1a375d5a2b10cf48ac22edc78","sha256:86f207331fe77d122990041bc1f81c2b8aa10925c7968d0bbc9a86ef25c9f45b"],"state_sha256":"321fc16a81a3616cb5f6efe5bf6dbf5ef7a6244b46be63c1e3ea711b5dd0bf5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R1TMF5hy9UCDpXe44BLZM3P0j1igf2GLiFdEI11BdDLwpzfg8H/wT8FeyUP29ebTrmYMwd1ZH+28lxnnrsadAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T01:38:52.199563Z","bundle_sha256":"63ca1b5b037ea884989dc552b910721fd1daa62d48aa021d4663823ccd92df9f"}}