{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6T3LZVCOTEPDW4PE5L53Q3FKDD","short_pith_number":"pith:6T3LZVCO","canonical_record":{"source":{"id":"1401.5354","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T15:44:22Z","cross_cats_sorted":["cs.CC","cs.DM","cs.GT"],"title_canon_sha256":"0eb7d92fd84a55bc7668434ca8888a286f4842bd19b3cbe0f4b2d21f5f4295ac","abstract_canon_sha256":"6682c622647ff222b47f7697a22568ec20899d36413b31fc292c313e612030cf"},"schema_version":"1.0"},"canonical_sha256":"f4f6bcd44e991e3b71e4eafbb86caa18faaab0b2d54454121c0062574d6722b5","source":{"kind":"arxiv","id":"1401.5354","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5354","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5354v4","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5354","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"6T3LZVCOTEPD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6T3LZVCOTEPDW4PE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6T3LZVCO","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6T3LZVCOTEPDW4PE5L53Q3FKDD","target":"record","payload":{"canonical_record":{"source":{"id":"1401.5354","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T15:44:22Z","cross_cats_sorted":["cs.CC","cs.DM","cs.GT"],"title_canon_sha256":"0eb7d92fd84a55bc7668434ca8888a286f4842bd19b3cbe0f4b2d21f5f4295ac","abstract_canon_sha256":"6682c622647ff222b47f7697a22568ec20899d36413b31fc292c313e612030cf"},"schema_version":"1.0"},"canonical_sha256":"f4f6bcd44e991e3b71e4eafbb86caa18faaab0b2d54454121c0062574d6722b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:18:57.697032Z","signature_b64":"yJAP5gKfKddq6iMXfBxwFSS+QpvdxYl7Pg5uwhIikIEasa8qhLxhwjjCwK4sQQ/MAk+cfsWSaDHjXgEoOvQgCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4f6bcd44e991e3b71e4eafbb86caa18faaab0b2d54454121c0062574d6722b5","last_reissued_at":"2026-05-18T01:18:57.696654Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:18:57.696654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.5354","source_version":4,"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-18T01:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jHiM1ESP4ddDkKc7b3kPjDE9oRLLIUqQFnrMxq0yBteqWH6KHT3UUCWURr4rqd9HZV5psGVqeM3dwH1wdBoPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:35:05.460522Z"},"content_sha256":"eab214c199953421da33e0a21869160c4f6bbedc632e0e1995be05cd411fa8fc","schema_version":"1.0","event_id":"sha256:eab214c199953421da33e0a21869160c4f6bbedc632e0e1995be05cd411fa8fc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6T3LZVCOTEPDW4PE5L53Q3FKDD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting Houses of Pareto Optimal Matchings in the House Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.GT"],"primary_cat":"math.CO","authors_text":"Andrei Asinowski, Bal\\'azs Keszegh, Tillmann Miltzow","submitted_at":"2014-01-21T15:44:22Z","abstract_excerpt":"Let $A,B$ with $|A| = m$ and $|B| = n\\ge m$ be two sets. We assume that every element $a\\in A$ has a reference list over all elements from $B$. We call an injective mapping $\\tau$ from $A$ to $B$ a matching. A blocking coalition of $\\tau$ is a subset $A'$ of $A$ such that there exists a matching $\\tau'$ that differs from $\\tau$ only on elements of $A'$, and every element of $A'$ improves in $\\tau'$, compared to $\\tau$ according to its preference list. If there exists no blocking coalition, we call the matching $\\tau$ an exchange stable matching (ESM). An element $b\\in B$ is reachable if there "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5354","kind":"arxiv","version":4},"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-18T01:18:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ccycUbNeGpIomba2YfO4qateRJSo99qizIJpTjlHRY0oYh3Gu6mnbqZMaM8eFkQX2aF05RQcvukqNlPtjvb1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:35:05.461119Z"},"content_sha256":"b3064ad39084a49989531fcb3a6d569837e0dd4b0f2871c0d0c9ea7f5c23c84d","schema_version":"1.0","event_id":"sha256:b3064ad39084a49989531fcb3a6d569837e0dd4b0f2871c0d0c9ea7f5c23c84d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6T3LZVCOTEPDW4PE5L53Q3FKDD/bundle.json","state_url":"https://pith.science/pith/6T3LZVCOTEPDW4PE5L53Q3FKDD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6T3LZVCOTEPDW4PE5L53Q3FKDD/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-26T02:35:05Z","links":{"resolver":"https://pith.science/pith/6T3LZVCOTEPDW4PE5L53Q3FKDD","bundle":"https://pith.science/pith/6T3LZVCOTEPDW4PE5L53Q3FKDD/bundle.json","state":"https://pith.science/pith/6T3LZVCOTEPDW4PE5L53Q3FKDD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6T3LZVCOTEPDW4PE5L53Q3FKDD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6T3LZVCOTEPDW4PE5L53Q3FKDD","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":"6682c622647ff222b47f7697a22568ec20899d36413b31fc292c313e612030cf","cross_cats_sorted":["cs.CC","cs.DM","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T15:44:22Z","title_canon_sha256":"0eb7d92fd84a55bc7668434ca8888a286f4842bd19b3cbe0f4b2d21f5f4295ac"},"schema_version":"1.0","source":{"id":"1401.5354","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.5354","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"arxiv_version","alias_value":"1401.5354v4","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.5354","created_at":"2026-05-18T01:18:57Z"},{"alias_kind":"pith_short_12","alias_value":"6T3LZVCOTEPD","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6T3LZVCOTEPDW4PE","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6T3LZVCO","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:b3064ad39084a49989531fcb3a6d569837e0dd4b0f2871c0d0c9ea7f5c23c84d","target":"graph","created_at":"2026-05-18T01:18:57Z","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":"Let $A,B$ with $|A| = m$ and $|B| = n\\ge m$ be two sets. We assume that every element $a\\in A$ has a reference list over all elements from $B$. We call an injective mapping $\\tau$ from $A$ to $B$ a matching. A blocking coalition of $\\tau$ is a subset $A'$ of $A$ such that there exists a matching $\\tau'$ that differs from $\\tau$ only on elements of $A'$, and every element of $A'$ improves in $\\tau'$, compared to $\\tau$ according to its preference list. If there exists no blocking coalition, we call the matching $\\tau$ an exchange stable matching (ESM). An element $b\\in B$ is reachable if there ","authors_text":"Andrei Asinowski, Bal\\'azs Keszegh, Tillmann Miltzow","cross_cats":["cs.CC","cs.DM","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T15:44:22Z","title":"Counting Houses of Pareto Optimal Matchings in the House Allocation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.5354","kind":"arxiv","version":4},"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:eab214c199953421da33e0a21869160c4f6bbedc632e0e1995be05cd411fa8fc","target":"record","created_at":"2026-05-18T01:18:57Z","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":"6682c622647ff222b47f7697a22568ec20899d36413b31fc292c313e612030cf","cross_cats_sorted":["cs.CC","cs.DM","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-01-21T15:44:22Z","title_canon_sha256":"0eb7d92fd84a55bc7668434ca8888a286f4842bd19b3cbe0f4b2d21f5f4295ac"},"schema_version":"1.0","source":{"id":"1401.5354","kind":"arxiv","version":4}},"canonical_sha256":"f4f6bcd44e991e3b71e4eafbb86caa18faaab0b2d54454121c0062574d6722b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4f6bcd44e991e3b71e4eafbb86caa18faaab0b2d54454121c0062574d6722b5","first_computed_at":"2026-05-18T01:18:57.696654Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:18:57.696654Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yJAP5gKfKddq6iMXfBxwFSS+QpvdxYl7Pg5uwhIikIEasa8qhLxhwjjCwK4sQQ/MAk+cfsWSaDHjXgEoOvQgCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:18:57.697032Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.5354","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eab214c199953421da33e0a21869160c4f6bbedc632e0e1995be05cd411fa8fc","sha256:b3064ad39084a49989531fcb3a6d569837e0dd4b0f2871c0d0c9ea7f5c23c84d"],"state_sha256":"5ddc53858c274775057d97ba46919640e7ad7efbd66ec271cf3bb3ec353fb6ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+8x7MCUIZZbFMpGlG44Nz3krPtZMngrbqR+o4vcLkGj0+fiPOyn6qxxqRBIldgd045qnqx2IdLG2AXCxLAc3AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:35:05.464749Z","bundle_sha256":"499fc7bce0743810a8c0f549dd11e1454f60b8f19dd68db15f2534d4a960bbda"}}