{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CSB2KTSV6VLPUA5TRVVNVFUXGY","short_pith_number":"pith:CSB2KTSV","schema_version":"1.0","canonical_sha256":"1483a54e55f556fa03b38d6ada9697363a253fdddf9b64dbac78972a1eee681f","source":{"kind":"arxiv","id":"1012.1237","version":2},"attestation_state":"computed","paper":{"title":"The Complexity of Approximately Counting Stable Roommate Assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Leslie Ann Goldberg, Prasad Chebolu, Russell Martin","submitted_at":"2010-12-06T16:43:49Z","abstract_excerpt":"We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the $k$-attribute model, in which the preference lists are determined by dot products of \"preference vectors\" with \"attribute vectors\" and (ii) the $k$-Euclidean model, in which the preference lists are determined by the closeness of the \"positions\" of the people to their \"preferred positions\". Exactly counting the number of assignments is #P-complete, since Irving and Leather demonstrated #P-completeness for the special case of the stable marriage problem. We show that counting the number of"},"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":"1012.1237","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-06T16:43:49Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"0fbcdaff0e88314037a705c1e9e48b0ee982b260bfc5d7e639be7777dba48344","abstract_canon_sha256":"facc628a5777a8aff269c938845a9ccb88df864a1a9501e7115159956e07a893"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:37.353263Z","signature_b64":"Td2r5OMByuYUtVVUxshYkwC+ErGTcjqXsPRjteH2YWQ0qa/UN3bwzRi4LYx4AsfkumHTUk0mPHlTi/QEH/T0Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1483a54e55f556fa03b38d6ada9697363a253fdddf9b64dbac78972a1eee681f","last_reissued_at":"2026-05-18T03:57:37.352545Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:37.352545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Approximately Counting Stable Roommate Assignments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Leslie Ann Goldberg, Prasad Chebolu, Russell Martin","submitted_at":"2010-12-06T16:43:49Z","abstract_excerpt":"We investigate the complexity of approximately counting stable roommate assignments in two models: (i) the $k$-attribute model, in which the preference lists are determined by dot products of \"preference vectors\" with \"attribute vectors\" and (ii) the $k$-Euclidean model, in which the preference lists are determined by the closeness of the \"positions\" of the people to their \"preferred positions\". Exactly counting the number of assignments is #P-complete, since Irving and Leather demonstrated #P-completeness for the special case of the stable marriage problem. We show that counting the number of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1237","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.1237","created_at":"2026-05-18T03:57:37.352663+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.1237v2","created_at":"2026-05-18T03:57:37.352663+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1237","created_at":"2026-05-18T03:57:37.352663+00:00"},{"alias_kind":"pith_short_12","alias_value":"CSB2KTSV6VLP","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_16","alias_value":"CSB2KTSV6VLPUA5T","created_at":"2026-05-18T12:26:06.534383+00:00"},{"alias_kind":"pith_short_8","alias_value":"CSB2KTSV","created_at":"2026-05-18T12:26:06.534383+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/CSB2KTSV6VLPUA5TRVVNVFUXGY","json":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY.json","graph_json":"https://pith.science/api/pith-number/CSB2KTSV6VLPUA5TRVVNVFUXGY/graph.json","events_json":"https://pith.science/api/pith-number/CSB2KTSV6VLPUA5TRVVNVFUXGY/events.json","paper":"https://pith.science/paper/CSB2KTSV"},"agent_actions":{"view_html":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY","download_json":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY.json","view_paper":"https://pith.science/paper/CSB2KTSV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.1237&json=true","fetch_graph":"https://pith.science/api/pith-number/CSB2KTSV6VLPUA5TRVVNVFUXGY/graph.json","fetch_events":"https://pith.science/api/pith-number/CSB2KTSV6VLPUA5TRVVNVFUXGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/action/storage_attestation","attest_author":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/action/author_attestation","sign_citation":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/action/citation_signature","submit_replication":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/action/replication_record"}},"created_at":"2026-05-18T03:57:37.352663+00:00","updated_at":"2026-05-18T03:57:37.352663+00:00"}