{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:7UAYEJRU6GGP6NSR57HZ5LFXVP","short_pith_number":"pith:7UAYEJRU","schema_version":"1.0","canonical_sha256":"fd01822634f18cff3651efcf9eacb7abca3bfecba0261e727debc04f4ba12efb","source":{"kind":"arxiv","id":"1506.00677","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1506.00677","created_at":"2026-05-18T01:59:52.999145+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00677v1","created_at":"2026-05-18T01:59:52.999145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00677","created_at":"2026-05-18T01:59:52.999145+00:00"},{"alias_kind":"pith_short_12","alias_value":"7UAYEJRU6GGP","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"7UAYEJRU6GGP6NSR","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"7UAYEJRU","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP","json":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP.json","graph_json":"https://pith.science/api/pith-number/7UAYEJRU6GGP6NSR57HZ5LFXVP/graph.json","events_json":"https://pith.science/api/pith-number/7UAYEJRU6GGP6NSR57HZ5LFXVP/events.json","paper":"https://pith.science/paper/7UAYEJRU"},"agent_actions":{"view_html":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP","download_json":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP.json","view_paper":"https://pith.science/paper/7UAYEJRU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00677&json=true","fetch_graph":"https://pith.science/api/pith-number/7UAYEJRU6GGP6NSR57HZ5LFXVP/graph.json","fetch_events":"https://pith.science/api/pith-number/7UAYEJRU6GGP6NSR57HZ5LFXVP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/action/storage_attestation","attest_author":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/action/author_attestation","sign_citation":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/action/citation_signature","submit_replication":"https://pith.science/pith/7UAYEJRU6GGP6NSR57HZ5LFXVP/action/replication_record"}},"created_at":"2026-05-18T01:59:52.999145+00:00","updated_at":"2026-05-18T01:59:52.999145+00:00"}