{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:3YXLPMH3JTM4BC2DGUWLAU5R6A","short_pith_number":"pith:3YXLPMH3","canonical_record":{"source":{"id":"1708.04109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-14T13:15:19Z","cross_cats_sorted":["cs.CC","cs.DS","cs.MA","math.CO"],"title_canon_sha256":"4a59cf3e5cc40333ed845e7ddd68cd9e3549c4058bf3427c0784a0639fca4b3c","abstract_canon_sha256":"e795c209869b8d74988abdce3b9db5745b9ab2f2e0d5b09ed7e750218fb8d255"},"schema_version":"1.0"},"canonical_sha256":"de2eb7b0fb4cd9c08b43352cb053b1f02a0d686f4b5ada7463d0c9f5dea02ce8","source":{"kind":"arxiv","id":"1708.04109","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04109","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04109v2","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04109","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"3YXLPMH3JTM4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3YXLPMH3JTM4BC2D","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3YXLPMH3","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:3YXLPMH3JTM4BC2DGUWLAU5R6A","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04109","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-14T13:15:19Z","cross_cats_sorted":["cs.CC","cs.DS","cs.MA","math.CO"],"title_canon_sha256":"4a59cf3e5cc40333ed845e7ddd68cd9e3549c4058bf3427c0784a0639fca4b3c","abstract_canon_sha256":"e795c209869b8d74988abdce3b9db5745b9ab2f2e0d5b09ed7e750218fb8d255"},"schema_version":"1.0"},"canonical_sha256":"de2eb7b0fb4cd9c08b43352cb053b1f02a0d686f4b5ada7463d0c9f5dea02ce8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:23.258328Z","signature_b64":"3RaLirI/29OfPrPBYknC5BSjV0hZX0iaYWCSOXKOZeROYCoMZspQVgDpEWhUHyWkSUPQiBaNXXITU5JNxCFNBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de2eb7b0fb4cd9c08b43352cb053b1f02a0d686f4b5ada7463d0c9f5dea02ce8","last_reissued_at":"2026-05-17T23:58:23.257618Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:23.257618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04109","source_version":2,"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:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUaP51VFvjVg7u4oG2b1clm90QQS8v0dZVSzBLSyaZytWNXnmozlB6se9n7dV6lnRzijhSejyqD4lVH4+E97DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:17:18.225815Z"},"content_sha256":"f89f654cc82a926591c740a179f4eaeab9c6046b3ffe655eb578a86cfaa98c23","schema_version":"1.0","event_id":"sha256:f89f654cc82a926591c740a179f4eaeab9c6046b3ffe655eb578a86cfaa98c23"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:3YXLPMH3JTM4BC2DGUWLAU5R6A","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Hard Stable Matching Problems Involving Groups of Similar Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DS","cs.MA","math.CO"],"primary_cat":"cs.GT","authors_text":"Baharak Rastegari, Kitty Meeks","submitted_at":"2017-08-14T13:15:19Z","abstract_excerpt":"Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to design efficient algorithms using elementary techniques. We focus on the setting in which all agents involved in some matching problem can be partitioned into k different types, where the type of an agent determines his or her preferences, and agents have preferences over types (which may be refined by more detailed preferences within a single type). This si"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04109","kind":"arxiv","version":2},"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:58:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CExOVhhLxDGGYwTI3TwHvK77yY5QLKeakZycm0lzToIYK+4RRjDl3ffS/3sw4hGQ2gS7oniZtBDiQ2Wj3Th8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T20:17:18.226174Z"},"content_sha256":"7f7cdad34ce6dd2fa5b4b0c05503681f11bf663e028d25189ed533b3de5a0702","schema_version":"1.0","event_id":"sha256:7f7cdad34ce6dd2fa5b4b0c05503681f11bf663e028d25189ed533b3de5a0702"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YXLPMH3JTM4BC2DGUWLAU5R6A/bundle.json","state_url":"https://pith.science/pith/3YXLPMH3JTM4BC2DGUWLAU5R6A/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YXLPMH3JTM4BC2DGUWLAU5R6A/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-30T20:17:18Z","links":{"resolver":"https://pith.science/pith/3YXLPMH3JTM4BC2DGUWLAU5R6A","bundle":"https://pith.science/pith/3YXLPMH3JTM4BC2DGUWLAU5R6A/bundle.json","state":"https://pith.science/pith/3YXLPMH3JTM4BC2DGUWLAU5R6A/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YXLPMH3JTM4BC2DGUWLAU5R6A/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:3YXLPMH3JTM4BC2DGUWLAU5R6A","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":"e795c209869b8d74988abdce3b9db5745b9ab2f2e0d5b09ed7e750218fb8d255","cross_cats_sorted":["cs.CC","cs.DS","cs.MA","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-14T13:15:19Z","title_canon_sha256":"4a59cf3e5cc40333ed845e7ddd68cd9e3549c4058bf3427c0784a0639fca4b3c"},"schema_version":"1.0","source":{"id":"1708.04109","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04109","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04109v2","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04109","created_at":"2026-05-17T23:58:23Z"},{"alias_kind":"pith_short_12","alias_value":"3YXLPMH3JTM4","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"3YXLPMH3JTM4BC2D","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"3YXLPMH3","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:7f7cdad34ce6dd2fa5b4b0c05503681f11bf663e028d25189ed533b3de5a0702","target":"graph","created_at":"2026-05-17T23:58:23Z","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":"Many important stable matching problems are known to be NP-hard, even when strong restrictions are placed on the input. In this paper we seek to identify structural properties of instances of stable matching problems which will allow us to design efficient algorithms using elementary techniques. We focus on the setting in which all agents involved in some matching problem can be partitioned into k different types, where the type of an agent determines his or her preferences, and agents have preferences over types (which may be refined by more detailed preferences within a single type). This si","authors_text":"Baharak Rastegari, Kitty Meeks","cross_cats":["cs.CC","cs.DS","cs.MA","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-14T13:15:19Z","title":"Solving Hard Stable Matching Problems Involving Groups of Similar Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04109","kind":"arxiv","version":2},"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:f89f654cc82a926591c740a179f4eaeab9c6046b3ffe655eb578a86cfaa98c23","target":"record","created_at":"2026-05-17T23:58:23Z","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":"e795c209869b8d74988abdce3b9db5745b9ab2f2e0d5b09ed7e750218fb8d255","cross_cats_sorted":["cs.CC","cs.DS","cs.MA","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2017-08-14T13:15:19Z","title_canon_sha256":"4a59cf3e5cc40333ed845e7ddd68cd9e3549c4058bf3427c0784a0639fca4b3c"},"schema_version":"1.0","source":{"id":"1708.04109","kind":"arxiv","version":2}},"canonical_sha256":"de2eb7b0fb4cd9c08b43352cb053b1f02a0d686f4b5ada7463d0c9f5dea02ce8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de2eb7b0fb4cd9c08b43352cb053b1f02a0d686f4b5ada7463d0c9f5dea02ce8","first_computed_at":"2026-05-17T23:58:23.257618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:23.257618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3RaLirI/29OfPrPBYknC5BSjV0hZX0iaYWCSOXKOZeROYCoMZspQVgDpEWhUHyWkSUPQiBaNXXITU5JNxCFNBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:23.258328Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04109","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f89f654cc82a926591c740a179f4eaeab9c6046b3ffe655eb578a86cfaa98c23","sha256:7f7cdad34ce6dd2fa5b4b0c05503681f11bf663e028d25189ed533b3de5a0702"],"state_sha256":"edd8360f497937b73ccb2786cc88a3b242e177224ab6db90db18a3277a4fec17"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9zgGmYJg+JlPqnHuOUtwH2mqmaJTU5ILE5f7jyRwRlNEBvaXrN0bj9YZ2Rd6DVm+PCHoB+tCQDGk3dNNntTUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T20:17:18.228312Z","bundle_sha256":"efd79d7f7e7735c0bc23eb61ace71271c02ead26b75c5e98a4585671c923d0d7"}}