{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CSB2KTSV6VLPUA5TRVVNVFUXGY","short_pith_number":"pith:CSB2KTSV","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"},"canonical_sha256":"1483a54e55f556fa03b38d6ada9697363a253fdddf9b64dbac78972a1eee681f","source":{"kind":"arxiv","id":"1012.1237","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1237","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1237v2","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1237","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"CSB2KTSV6VLP","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CSB2KTSV6VLPUA5T","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CSB2KTSV","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CSB2KTSV6VLPUA5TRVVNVFUXGY","target":"record","payload":{"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"},"canonical_sha256":"1483a54e55f556fa03b38d6ada9697363a253fdddf9b64dbac78972a1eee681f","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"},"source_kind":"arxiv","source_id":"1012.1237","source_version":2,"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-18T03:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6N3mP53zLLdR9J6cMl7bYeYAPJlDMsZ5ydSR05Hk2qBB7GF5mN2pl4/92IXFoqEgIstCZsZTYMTfAPlHP0zGCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:24:54.361920Z"},"content_sha256":"b5aee549e0c76682200543479fd4dda90b256cee9583fb8ed6ce1803276db233","schema_version":"1.0","event_id":"sha256:b5aee549e0c76682200543479fd4dda90b256cee9583fb8ed6ce1803276db233"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CSB2KTSV6VLPUA5TRVVNVFUXGY","target":"graph","payload":{"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"},"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-18T03:57:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W7OcvtGsgD8Y3Q28qRHjl53tamp5XtlMhjMxjEiplGr9LSQf1lc0L6iSmBKV+AItbFdHpwaPnkUQr6DXfsuGBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:24:54.362269Z"},"content_sha256":"d1d774f94209626386b0eacc46a7ae72609a729b78b054aa4185e5079ab776a9","schema_version":"1.0","event_id":"sha256:d1d774f94209626386b0eacc46a7ae72609a729b78b054aa4185e5079ab776a9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/bundle.json","state_url":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/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-06-12T10:24:54Z","links":{"resolver":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY","bundle":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/bundle.json","state":"https://pith.science/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CSB2KTSV6VLPUA5TRVVNVFUXGY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CSB2KTSV6VLPUA5TRVVNVFUXGY","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":"facc628a5777a8aff269c938845a9ccb88df864a1a9501e7115159956e07a893","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-06T16:43:49Z","title_canon_sha256":"0fbcdaff0e88314037a705c1e9e48b0ee982b260bfc5d7e639be7777dba48344"},"schema_version":"1.0","source":{"id":"1012.1237","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.1237","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1012.1237v2","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.1237","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"CSB2KTSV6VLP","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"CSB2KTSV6VLPUA5T","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"CSB2KTSV","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:d1d774f94209626386b0eacc46a7ae72609a729b78b054aa4185e5079ab776a9","target":"graph","created_at":"2026-05-18T03:57:37Z","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 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","authors_text":"Leslie Ann Goldberg, Prasad Chebolu, Russell Martin","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-06T16:43:49Z","title":"The Complexity of Approximately Counting Stable Roommate Assignments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.1237","kind":"arxiv","version":2},"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:b5aee549e0c76682200543479fd4dda90b256cee9583fb8ed6ce1803276db233","target":"record","created_at":"2026-05-18T03:57:37Z","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":"facc628a5777a8aff269c938845a9ccb88df864a1a9501e7115159956e07a893","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-06T16:43:49Z","title_canon_sha256":"0fbcdaff0e88314037a705c1e9e48b0ee982b260bfc5d7e639be7777dba48344"},"schema_version":"1.0","source":{"id":"1012.1237","kind":"arxiv","version":2}},"canonical_sha256":"1483a54e55f556fa03b38d6ada9697363a253fdddf9b64dbac78972a1eee681f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1483a54e55f556fa03b38d6ada9697363a253fdddf9b64dbac78972a1eee681f","first_computed_at":"2026-05-18T03:57:37.352545Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:37.352545Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Td2r5OMByuYUtVVUxshYkwC+ErGTcjqXsPRjteH2YWQ0qa/UN3bwzRi4LYx4AsfkumHTUk0mPHlTi/QEH/T0Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:37.353263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.1237","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b5aee549e0c76682200543479fd4dda90b256cee9583fb8ed6ce1803276db233","sha256:d1d774f94209626386b0eacc46a7ae72609a729b78b054aa4185e5079ab776a9"],"state_sha256":"e8b2b34e8d066b16959a7ce1b40a717bccdfb4efcbd8235e94a1709f5b6cb39d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"03OwkP0O1EoHWHLNPgUJol3xqoC4xBUJInz7V90VsDB5dZhYUl+2mrkCMBUaj5QS9MoyVJCUVGuzvC+li/u5AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:24:54.364245Z","bundle_sha256":"41de829c6becedab3afa5c65a659b3442369c38c993e35047dba5a6d8e258bbf"}}