{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HY5LT6EYPZ2NBKL6F54W242ZW4","short_pith_number":"pith:HY5LT6EY","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"},"canonical_sha256":"3e3ab9f8987e74d0a97e2f796d7359b739c44022ad1aeff2869e2ea756ca2a5a","source":{"kind":"arxiv","id":"1510.06452","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06452","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06452v5","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06452","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"HY5LT6EYPZ2N","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HY5LT6EYPZ2NBKL6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HY5LT6EY","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HY5LT6EYPZ2NBKL6F54W242ZW4","target":"record","payload":{"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"},"canonical_sha256":"3e3ab9f8987e74d0a97e2f796d7359b739c44022ad1aeff2869e2ea756ca2a5a","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"},"source_kind":"arxiv","source_id":"1510.06452","source_version":5,"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-18T00:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0jRyWA1Umu/xfe1dTy8x1z8xVi8uJyLSfqqKTe98m64O5DNhQWhdHAU9BsJGZjLJ7jSW0BAGL69ORsEd7DLpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:49.835456Z"},"content_sha256":"a819e3193fca050714dcb6d48c419bc21e65eeac11eeadb8a860e8cbbbcf361b","schema_version":"1.0","event_id":"sha256:a819e3193fca050714dcb6d48c419bc21e65eeac11eeadb8a860e8cbbbcf361b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HY5LT6EYPZ2NBKL6F54W242ZW4","target":"graph","payload":{"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"},"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-18T00:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wslRern2d8LL3ylCywix9gm5gMdpp5em+RbuOW7MoapDONt183OhXfvnLPQkEwG+Ddki863APERS4XUz+tEACQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T23:42:49.836149Z"},"content_sha256":"bb11dd70fb2c29d98909364f5d4ed269260e4f7ebd308d713608f8497c0cf8ac","schema_version":"1.0","event_id":"sha256:bb11dd70fb2c29d98909364f5d4ed269260e4f7ebd308d713608f8497c0cf8ac"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/bundle.json","state_url":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/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-25T23:42:49Z","links":{"resolver":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4","bundle":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/bundle.json","state":"https://pith.science/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HY5LT6EYPZ2NBKL6F54W242ZW4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HY5LT6EYPZ2NBKL6F54W242ZW4","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":"83707a5cd30b0ad71bada01919475041168f8dee07b97cdce0daf5d30d114592","cross_cats_sorted":["cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-21T22:51:47Z","title_canon_sha256":"be8c4c26e7a50ca87bba4f8bf504c0d025f67ae62a24b8a78d513670e154add8"},"schema_version":"1.0","source":{"id":"1510.06452","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.06452","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"1510.06452v5","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.06452","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"HY5LT6EYPZ2N","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HY5LT6EYPZ2NBKL6","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HY5LT6EY","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:bb11dd70fb2c29d98909364f5d4ed269260e4f7ebd308d713608f8497c0cf8ac","target":"graph","created_at":"2026-05-18T00:54:41Z","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":"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","authors_text":"Daniel Moeller, Marvin K\\\"unnemann, Ramamohan Paturi, Stefan Schneider","cross_cats":["cs.CC","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-21T22:51:47Z","title":"Subquadratic Algorithms for Succinct Stable Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.06452","kind":"arxiv","version":5},"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:a819e3193fca050714dcb6d48c419bc21e65eeac11eeadb8a860e8cbbbcf361b","target":"record","created_at":"2026-05-18T00:54:41Z","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":"83707a5cd30b0ad71bada01919475041168f8dee07b97cdce0daf5d30d114592","cross_cats_sorted":["cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-21T22:51:47Z","title_canon_sha256":"be8c4c26e7a50ca87bba4f8bf504c0d025f67ae62a24b8a78d513670e154add8"},"schema_version":"1.0","source":{"id":"1510.06452","kind":"arxiv","version":5}},"canonical_sha256":"3e3ab9f8987e74d0a97e2f796d7359b739c44022ad1aeff2869e2ea756ca2a5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e3ab9f8987e74d0a97e2f796d7359b739c44022ad1aeff2869e2ea756ca2a5a","first_computed_at":"2026-05-18T00:54:41.278136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:41.278136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0JaKuOxQzHN+iNwFhK0wFpcg/ALqGpLGo/51lAGFWZlTryaqAxVaVxrciSkR8aFGB8Age25dbj9L8liPz8ZjDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:41.278524Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.06452","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a819e3193fca050714dcb6d48c419bc21e65eeac11eeadb8a860e8cbbbcf361b","sha256:bb11dd70fb2c29d98909364f5d4ed269260e4f7ebd308d713608f8497c0cf8ac"],"state_sha256":"f064d0f5359b58fa35cbd54776cd5d771e6e773b4b08293c26183f0bf596e760"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fLBiELXVi2d/bav/9WjE9nQiAOCRAbujU0ivk94B3tYCVsG1cvqKo6X4M203QbEl0fTPYs0IbLkxXANYudL8Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T23:42:49.839253Z","bundle_sha256":"6e158b7761f12aff8f30f519fb1e4ecd12a6e2af3a2a1de4cf5f9a6545963357"}}