{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HY5LT6EYPZ2NBKL6F54W242ZW4","short_pith_number":"pith:HY5LT6EY","schema_version":"1.0","canonical_sha256":"3e3ab9f8987e74d0a97e2f796d7359b739c44022ad1aeff2869e2ea756ca2a5a","source":{"kind":"arxiv","id":"1510.06452","version":5},"attestation_state":"computed","paper":{"title":"Subquadratic Algorithms for Succinct Stable Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.DS","authors_text":"Daniel Moeller, Marvin K\\\"unnemann, Ramamohan Paturi, Stefan Schneider","submitted_at":"2015-10-21T22:51:47Z","abstract_excerpt":"We consider the stable matching problem when the preference lists are not given explicitly but are represented in a succinct way and ask whether the problem becomes computationally easier and investigate other implications. We give subquadratic algorithms for finding a stable matching in special cases of natural succinct representations of the problem, the $d$-attribute, $d$-list, geometric, and single-peaked models. We also present algorithms for verifying a stable matching in the same models. We further show that for $d = \\omega(\\log n)$ both finding and verifying a stable matching in the $d"},"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":"1510.06452","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-21T22:51:47Z","cross_cats_sorted":["cs.CC","cs.GT"],"title_canon_sha256":"be8c4c26e7a50ca87bba4f8bf504c0d025f67ae62a24b8a78d513670e154add8","abstract_canon_sha256":"83707a5cd30b0ad71bada01919475041168f8dee07b97cdce0daf5d30d114592"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:41.278524Z","signature_b64":"0JaKuOxQzHN+iNwFhK0wFpcg/ALqGpLGo/51lAGFWZlTryaqAxVaVxrciSkR8aFGB8Age25dbj9L8liPz8ZjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e3ab9f8987e74d0a97e2f796d7359b739c44022ad1aeff2869e2ea756ca2a5a","last_reissued_at":"2026-05-18T00:54:41.278136Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:41.278136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subquadratic Algorithms for Succinct Stable Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.GT"],"primary_cat":"cs.DS","authors_text":"Daniel Moeller, Marvin K\\\"unnemann, Ramamohan Paturi, Stefan Schneider","submitted_at":"2015-10-21T22:51:47Z","abstract_excerpt":"We consider the stable matching problem when the preference lists are not given explicitly but are represented in a succinct way and ask whether the problem becomes computationally easier and investigate other implications. We give subquadratic algorithms for finding a stable matching in special cases of natural succinct representations of the problem, the $d$-attribute, $d$-list, geometric, and single-peaked models. We also present algorithms for verifying a stable matching in the same models. We further show that for $d = \\omega(\\log n)$ both finding and verifying a stable matching in the $d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06452","kind":"arxiv","version":5},"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":"1510.06452","created_at":"2026-05-18T00:54:41.278196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.06452v5","created_at":"2026-05-18T00:54:41.278196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06452","created_at":"2026-05-18T00:54:41.278196+00:00"},{"alias_kind":"pith_short_12","alias_value":"HY5LT6EYPZ2N","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HY5LT6EYPZ2NBKL6","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HY5LT6EY","created_at":"2026-05-18T12:29:25.134429+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/HY5LT6EYPZ2NBKL6F54W242ZW4","json":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4.json","graph_json":"https://pith.science/api/pith-number/HY5LT6EYPZ2NBKL6F54W242ZW4/graph.json","events_json":"https://pith.science/api/pith-number/HY5LT6EYPZ2NBKL6F54W242ZW4/events.json","paper":"https://pith.science/paper/HY5LT6EY"},"agent_actions":{"view_html":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4","download_json":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4.json","view_paper":"https://pith.science/paper/HY5LT6EY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.06452&json=true","fetch_graph":"https://pith.science/api/pith-number/HY5LT6EYPZ2NBKL6F54W242ZW4/graph.json","fetch_events":"https://pith.science/api/pith-number/HY5LT6EYPZ2NBKL6F54W242ZW4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/action/storage_attestation","attest_author":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/action/author_attestation","sign_citation":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/action/citation_signature","submit_replication":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/action/replication_record"}},"created_at":"2026-05-18T00:54:41.278196+00:00","updated_at":"2026-05-18T00:54:41.278196+00:00"}