{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7UAYEJRU6GGP6NSR57HZ5LFXVP","short_pith_number":"pith:7UAYEJRU","canonical_record":{"source":{"id":"1506.00677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T21:25:24Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"25191dad94f2b5058d526d7c9b80ff8bff5f395a57900314fa94e56a0402c430","abstract_canon_sha256":"7faa4d2bfae886b2a1d2bff85628af6ec96d410e9c03b5bb56d130f7013cc565"},"schema_version":"1.0"},"canonical_sha256":"fd01822634f18cff3651efcf9eacb7abca3bfecba0261e727debc04f4ba12efb","source":{"kind":"arxiv","id":"1506.00677","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00677","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00677v1","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00677","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"7UAYEJRU6GGP","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7UAYEJRU6GGP6NSR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7UAYEJRU","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7UAYEJRU6GGP6NSR57HZ5LFXVP","target":"record","payload":{"canonical_record":{"source":{"id":"1506.00677","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T21:25:24Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"25191dad94f2b5058d526d7c9b80ff8bff5f395a57900314fa94e56a0402c430","abstract_canon_sha256":"7faa4d2bfae886b2a1d2bff85628af6ec96d410e9c03b5bb56d130f7013cc565"},"schema_version":"1.0"},"canonical_sha256":"fd01822634f18cff3651efcf9eacb7abca3bfecba0261e727debc04f4ba12efb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:52.999781Z","signature_b64":"Tn6+y6P+vqe/fTER3to8dJ9drLLCKqeAY4oA4AJ1OVB+aqGM5bhqbszs1I38wxeF4/SbBYTPiP5FdgPyl9l7AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd01822634f18cff3651efcf9eacb7abca3bfecba0261e727debc04f4ba12efb","last_reissued_at":"2026-05-18T01:59:52.999054Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:52.999054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.00677","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-18T01:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Uv/I7/K9RZ8VeuiCj+ADga5OedAp0CZ1NDkbhxMRvcPeNTzajQBNbj6qXtESZXEXGfbhjd/5QdsLh0NaPCYFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:10:39.561988Z"},"content_sha256":"62ee2e3a475ae569491d2ad05ee5cd16f8c331095cf26df873091602f790ad0f","schema_version":"1.0","event_id":"sha256:62ee2e3a475ae569491d2ad05ee5cd16f8c331095cf26df873091602f790ad0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7UAYEJRU6GGP6NSR57HZ5LFXVP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterisation of Strongly Stable Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Adam Kunysz, Katarzyna Paluch, Pratik Ghosal","submitted_at":"2015-06-01T21:25:24Z","abstract_excerpt":"An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \\cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given vertex. Ties are disjoint and may contain one vertex. A matching $M$ is a set of vertex-disjoint edges. An edge $(x,y) \\in E \\setminus M$ is a {\\em blocking edge} for $M$ if $x$ is either unmatched or strictly prefers $y$ to its current partner in $M$, and $y$ is either unmatched or strictly prefers $x$ to its current partner in $M$ or is indifferent betwee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00677","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-18T01:59:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7WX344hSX2UnmUHPio049gS8vLn1ZbguEOtd0dxV6pODFx/d+c+4HVXlu3o6lcQulYsFgEhW28p+Df88yQvYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:10:39.562659Z"},"content_sha256":"3b0fd5ca48f069671fca1b3406c33c68fac514d03f60dd9644b5405a8564b724","schema_version":"1.0","event_id":"sha256:3b0fd5ca48f069671fca1b3406c33c68fac514d03f60dd9644b5405a8564b724"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/bundle.json","state_url":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/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-29T15:10:39Z","links":{"resolver":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP","bundle":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/bundle.json","state":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7UAYEJRU6GGP6NSR57HZ5LFXVP","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":"7faa4d2bfae886b2a1d2bff85628af6ec96d410e9c03b5bb56d130f7013cc565","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T21:25:24Z","title_canon_sha256":"25191dad94f2b5058d526d7c9b80ff8bff5f395a57900314fa94e56a0402c430"},"schema_version":"1.0","source":{"id":"1506.00677","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00677","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00677v1","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00677","created_at":"2026-05-18T01:59:52Z"},{"alias_kind":"pith_short_12","alias_value":"7UAYEJRU6GGP","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7UAYEJRU6GGP6NSR","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7UAYEJRU","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:3b0fd5ca48f069671fca1b3406c33c68fac514d03f60dd9644b5405a8564b724","target":"graph","created_at":"2026-05-18T01:59:52Z","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":"An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \\cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given vertex. Ties are disjoint and may contain one vertex. A matching $M$ is a set of vertex-disjoint edges. An edge $(x,y) \\in E \\setminus M$ is a {\\em blocking edge} for $M$ if $x$ is either unmatched or strictly prefers $y$ to its current partner in $M$, and $y$ is either unmatched or strictly prefers $x$ to its current partner in $M$ or is indifferent betwee","authors_text":"Adam Kunysz, Katarzyna Paluch, Pratik Ghosal","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T21:25:24Z","title":"Characterisation of Strongly Stable Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00677","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:62ee2e3a475ae569491d2ad05ee5cd16f8c331095cf26df873091602f790ad0f","target":"record","created_at":"2026-05-18T01:59:52Z","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":"7faa4d2bfae886b2a1d2bff85628af6ec96d410e9c03b5bb56d130f7013cc565","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-01T21:25:24Z","title_canon_sha256":"25191dad94f2b5058d526d7c9b80ff8bff5f395a57900314fa94e56a0402c430"},"schema_version":"1.0","source":{"id":"1506.00677","kind":"arxiv","version":1}},"canonical_sha256":"fd01822634f18cff3651efcf9eacb7abca3bfecba0261e727debc04f4ba12efb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd01822634f18cff3651efcf9eacb7abca3bfecba0261e727debc04f4ba12efb","first_computed_at":"2026-05-18T01:59:52.999054Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:52.999054Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tn6+y6P+vqe/fTER3to8dJ9drLLCKqeAY4oA4AJ1OVB+aqGM5bhqbszs1I38wxeF4/SbBYTPiP5FdgPyl9l7AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:52.999781Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00677","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62ee2e3a475ae569491d2ad05ee5cd16f8c331095cf26df873091602f790ad0f","sha256:3b0fd5ca48f069671fca1b3406c33c68fac514d03f60dd9644b5405a8564b724"],"state_sha256":"115bfc7c83bae78c60ab0a5df2b543764c41bd245632ae2f6e7b43b684346d59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7zlTEg5SvJB+SL/JByB8H1DrnVsK3IPshU4+9uI5pugY3ULYz50g+j17+8GEBgz6qtUcaZgBpNAO0OrZSMxtDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:10:39.565853Z","bundle_sha256":"727cc3d1410430d3874b281a610ee7a30a3d747b70a507ed7112fd389b6fa464"}}