{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VSV67FD3M2MAOJ66EUPDA3SZ4N","short_pith_number":"pith:VSV67FD3","canonical_record":{"source":{"id":"1905.03111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-08T14:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"fec62616fd9d6d7567eee049045856d5442ac54d67d202ee2aab474f27153ff9","abstract_canon_sha256":"c348ffdde625c68575dd1a3a3cd0c62a5ae65719065d5c39c38fd66498fd006f"},"schema_version":"1.0"},"canonical_sha256":"acabef947b66980727de251e306e59e36f04dfd2b4d1bd094013b0b6929952ce","source":{"kind":"arxiv","id":"1905.03111","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03111","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03111v1","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03111","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"VSV67FD3M2MA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VSV67FD3M2MAOJ66","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VSV67FD3","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VSV67FD3M2MAOJ66EUPDA3SZ4N","target":"record","payload":{"canonical_record":{"source":{"id":"1905.03111","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-08T14:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"fec62616fd9d6d7567eee049045856d5442ac54d67d202ee2aab474f27153ff9","abstract_canon_sha256":"c348ffdde625c68575dd1a3a3cd0c62a5ae65719065d5c39c38fd66498fd006f"},"schema_version":"1.0"},"canonical_sha256":"acabef947b66980727de251e306e59e36f04dfd2b4d1bd094013b0b6929952ce","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:42.846752Z","signature_b64":"mp3zD41H5GHRZQ/3ysdq0g8Lkg7aqy5DiwlimxpzVLT5uRQZcZUmAeTN0LnBJK6hamusf7tTYchV+i5/VwKGBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acabef947b66980727de251e306e59e36f04dfd2b4d1bd094013b0b6929952ce","last_reissued_at":"2026-05-17T23:46:42.846196Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:42.846196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.03111","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-17T23:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F40r/tAhnnK/i6oJkkGHZehWwHw6n2Cs39k7oX5BzOzh3F27yJ42+6RW/szyJYKKMpccEdUxcUQGEbxc+u7KBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:50:23.355507Z"},"content_sha256":"ff14ea540458e330da81ce8d7a0ade5d0c950fcf4a47d5e27c86ef9f0aa4240c","schema_version":"1.0","event_id":"sha256:ff14ea540458e330da81ce8d7a0ade5d0c950fcf4a47d5e27c86ef9f0aa4240c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VSV67FD3M2MAOJ66EUPDA3SZ4N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel and Distributed Algorithms for the housing allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Vijay Garg, Xiong Zheng","submitted_at":"2019-05-08T14:46:32Z","abstract_excerpt":"We give parallel and distributed algorithms for the housing allocation problem. In this problem, there is a set of agents and a set of houses. Each agent has a strict preference list for a subset of houses. We need to find a matching such that some criterion is optimized. One such criterion is Pareto Optimality. A matching is Pareto optimal if no coalition of agents can be strictly better off by exchanging houses among themselves. We also study the housing market problem, a variant of the housing allocation problem, where each agent initially owns a house. In addition to Pareto optimality, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03111","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-17T23:46:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GvSK+40tDThfACDzv77lnFq8rTHzR2pu9k6mqq9dPHq+GJrphN6QzIcp464OZtovreLizapA51imTQNU91u+Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T08:50:23.356122Z"},"content_sha256":"f04493ab2cef8c19f02f5c23048f424d19442fd934163d4f433369975b5feba2","schema_version":"1.0","event_id":"sha256:f04493ab2cef8c19f02f5c23048f424d19442fd934163d4f433369975b5feba2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VSV67FD3M2MAOJ66EUPDA3SZ4N/bundle.json","state_url":"https://pith.science/pith/VSV67FD3M2MAOJ66EUPDA3SZ4N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VSV67FD3M2MAOJ66EUPDA3SZ4N/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-04T08:50:23Z","links":{"resolver":"https://pith.science/pith/VSV67FD3M2MAOJ66EUPDA3SZ4N","bundle":"https://pith.science/pith/VSV67FD3M2MAOJ66EUPDA3SZ4N/bundle.json","state":"https://pith.science/pith/VSV67FD3M2MAOJ66EUPDA3SZ4N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VSV67FD3M2MAOJ66EUPDA3SZ4N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VSV67FD3M2MAOJ66EUPDA3SZ4N","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":"c348ffdde625c68575dd1a3a3cd0c62a5ae65719065d5c39c38fd66498fd006f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-08T14:46:32Z","title_canon_sha256":"fec62616fd9d6d7567eee049045856d5442ac54d67d202ee2aab474f27153ff9"},"schema_version":"1.0","source":{"id":"1905.03111","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.03111","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"arxiv_version","alias_value":"1905.03111v1","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.03111","created_at":"2026-05-17T23:46:42Z"},{"alias_kind":"pith_short_12","alias_value":"VSV67FD3M2MA","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VSV67FD3M2MAOJ66","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VSV67FD3","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:f04493ab2cef8c19f02f5c23048f424d19442fd934163d4f433369975b5feba2","target":"graph","created_at":"2026-05-17T23:46:42Z","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":"We give parallel and distributed algorithms for the housing allocation problem. In this problem, there is a set of agents and a set of houses. Each agent has a strict preference list for a subset of houses. We need to find a matching such that some criterion is optimized. One such criterion is Pareto Optimality. A matching is Pareto optimal if no coalition of agents can be strictly better off by exchanging houses among themselves. We also study the housing market problem, a variant of the housing allocation problem, where each agent initially owns a house. In addition to Pareto optimality, we ","authors_text":"Vijay Garg, Xiong Zheng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-08T14:46:32Z","title":"Parallel and Distributed Algorithms for the housing allocation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.03111","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:ff14ea540458e330da81ce8d7a0ade5d0c950fcf4a47d5e27c86ef9f0aa4240c","target":"record","created_at":"2026-05-17T23:46:42Z","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":"c348ffdde625c68575dd1a3a3cd0c62a5ae65719065d5c39c38fd66498fd006f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-08T14:46:32Z","title_canon_sha256":"fec62616fd9d6d7567eee049045856d5442ac54d67d202ee2aab474f27153ff9"},"schema_version":"1.0","source":{"id":"1905.03111","kind":"arxiv","version":1}},"canonical_sha256":"acabef947b66980727de251e306e59e36f04dfd2b4d1bd094013b0b6929952ce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"acabef947b66980727de251e306e59e36f04dfd2b4d1bd094013b0b6929952ce","first_computed_at":"2026-05-17T23:46:42.846196Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:42.846196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mp3zD41H5GHRZQ/3ysdq0g8Lkg7aqy5DiwlimxpzVLT5uRQZcZUmAeTN0LnBJK6hamusf7tTYchV+i5/VwKGBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:42.846752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.03111","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff14ea540458e330da81ce8d7a0ade5d0c950fcf4a47d5e27c86ef9f0aa4240c","sha256:f04493ab2cef8c19f02f5c23048f424d19442fd934163d4f433369975b5feba2"],"state_sha256":"babeb35074ac986af841dddd1abe8f12416745cb563cabec92a334faba8eb5c2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hm8BAUNEIfAp3yUJr0SZc1G2etfqS5zumZhSqYvWfCjHGPY86wzGUXqMEzKsZhZT9OkLAU+OplaZNO1Un+8kCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T08:50:23.359429Z","bundle_sha256":"a214c9848b908c4f5a2551417a8f9c549d4517cf181bd537d1977f60fcdba0e8"}}