{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CG2KLDQA5LHRTLOUYOKFV3YFBO","short_pith_number":"pith:CG2KLDQA","canonical_record":{"source":{"id":"1004.1836","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-11T20:15:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ecfb7ceeda364df394732ad536f94428f7f35953828480913fe8465bcec6ad87","abstract_canon_sha256":"f0c1f02ea987f0fa3a63561ee2e676229245f15d76aa3b139c2e37b6515be547"},"schema_version":"1.0"},"canonical_sha256":"11b4a58e00eacf19add4c3945aef050b8e2e58ccfd4dca7547fe00f9bccaba64","source":{"kind":"arxiv","id":"1004.1836","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1836","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1836v4","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1836","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"CG2KLDQA5LHR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CG2KLDQA5LHRTLOU","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CG2KLDQA","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CG2KLDQA5LHRTLOUYOKFV3YFBO","target":"record","payload":{"canonical_record":{"source":{"id":"1004.1836","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-11T20:15:12Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"ecfb7ceeda364df394732ad536f94428f7f35953828480913fe8465bcec6ad87","abstract_canon_sha256":"f0c1f02ea987f0fa3a63561ee2e676229245f15d76aa3b139c2e37b6515be547"},"schema_version":"1.0"},"canonical_sha256":"11b4a58e00eacf19add4c3945aef050b8e2e58ccfd4dca7547fe00f9bccaba64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:37.441467Z","signature_b64":"q4Wei/u0QXvQ91xiyE3DZJ2u7SZrEVCSEYcK+YOiL0WckPwof/Htcvqspa5+ZN2wqd8x00wlWm2p2CNuHeYSDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11b4a58e00eacf19add4c3945aef050b8e2e58ccfd4dca7547fe00f9bccaba64","last_reissued_at":"2026-05-18T03:57:37.440528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:37.440528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.1836","source_version":4,"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":"Pq8UPxdzzFtceDxbvZSFtGSvef8EHUh+K7YLrgWQ5h3SECdT8l2KnfNSbbcihMo5sM9iFu8Wx222GsgV5XRJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:11:58.910734Z"},"content_sha256":"def9609eb549155adba570c2cb607ba9d1129fb08f9bd8278aecbb8b24baa369","schema_version":"1.0","event_id":"sha256:def9609eb549155adba570c2cb607ba9d1129fb08f9bd8278aecbb8b24baa369"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CG2KLDQA5LHRTLOUYOKFV3YFBO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Complexity of Approximately Counting Stable Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"Leslie Ann Goldberg, Prasad Chebolu, Russell Martin","submitted_at":"2010-04-11T20:15:12Z","abstract_excerpt":"We investigate the complexity of approximately counting stable matchings in the $k$-attribute model, where the preference lists are determined by dot products of \"preference vectors\" with \"attribute vectors\", or by Euclidean distances between \"preference points\" and \"attribute points\". Irving and Leather proved that counting the number of stable matchings in the general case is $#P$-complete. Counting the number of stable matchings is reducible to counting the number of downsets in a (related) partial order and is interreducible, in an approximation-preserving sense, to a class of problems tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1836","kind":"arxiv","version":4},"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":"eZyHZoriskjMRAryR87nca20nihSbk6ACI7ggqgiyEJ9lgEdAlZBFZJYawHhqy3vKmgsxizjRoRD/bHVdUYyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-12T10:11:58.911075Z"},"content_sha256":"6943b778d39a6fbec214fee65737b3ac821f94077655b4b7b9c4a589f3eb3df5","schema_version":"1.0","event_id":"sha256:6943b778d39a6fbec214fee65737b3ac821f94077655b4b7b9c4a589f3eb3df5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CG2KLDQA5LHRTLOUYOKFV3YFBO/bundle.json","state_url":"https://pith.science/pith/CG2KLDQA5LHRTLOUYOKFV3YFBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CG2KLDQA5LHRTLOUYOKFV3YFBO/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:11:58Z","links":{"resolver":"https://pith.science/pith/CG2KLDQA5LHRTLOUYOKFV3YFBO","bundle":"https://pith.science/pith/CG2KLDQA5LHRTLOUYOKFV3YFBO/bundle.json","state":"https://pith.science/pith/CG2KLDQA5LHRTLOUYOKFV3YFBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CG2KLDQA5LHRTLOUYOKFV3YFBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CG2KLDQA5LHRTLOUYOKFV3YFBO","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":"f0c1f02ea987f0fa3a63561ee2e676229245f15d76aa3b139c2e37b6515be547","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-11T20:15:12Z","title_canon_sha256":"ecfb7ceeda364df394732ad536f94428f7f35953828480913fe8465bcec6ad87"},"schema_version":"1.0","source":{"id":"1004.1836","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.1836","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"arxiv_version","alias_value":"1004.1836v4","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.1836","created_at":"2026-05-18T03:57:37Z"},{"alias_kind":"pith_short_12","alias_value":"CG2KLDQA5LHR","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CG2KLDQA5LHRTLOU","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CG2KLDQA","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:6943b778d39a6fbec214fee65737b3ac821f94077655b4b7b9c4a589f3eb3df5","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 matchings in the $k$-attribute model, where the preference lists are determined by dot products of \"preference vectors\" with \"attribute vectors\", or by Euclidean distances between \"preference points\" and \"attribute points\". Irving and Leather proved that counting the number of stable matchings in the general case is $#P$-complete. Counting the number of stable matchings is reducible to counting the number of downsets in a (related) partial order and is interreducible, in an approximation-preserving sense, to a class of problems tha","authors_text":"Leslie Ann Goldberg, Prasad Chebolu, Russell Martin","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-11T20:15:12Z","title":"The Complexity of Approximately Counting Stable Matchings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.1836","kind":"arxiv","version":4},"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:def9609eb549155adba570c2cb607ba9d1129fb08f9bd8278aecbb8b24baa369","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":"f0c1f02ea987f0fa3a63561ee2e676229245f15d76aa3b139c2e37b6515be547","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-04-11T20:15:12Z","title_canon_sha256":"ecfb7ceeda364df394732ad536f94428f7f35953828480913fe8465bcec6ad87"},"schema_version":"1.0","source":{"id":"1004.1836","kind":"arxiv","version":4}},"canonical_sha256":"11b4a58e00eacf19add4c3945aef050b8e2e58ccfd4dca7547fe00f9bccaba64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11b4a58e00eacf19add4c3945aef050b8e2e58ccfd4dca7547fe00f9bccaba64","first_computed_at":"2026-05-18T03:57:37.440528Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:37.440528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4Wei/u0QXvQ91xiyE3DZJ2u7SZrEVCSEYcK+YOiL0WckPwof/Htcvqspa5+ZN2wqd8x00wlWm2p2CNuHeYSDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:37.441467Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.1836","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:def9609eb549155adba570c2cb607ba9d1129fb08f9bd8278aecbb8b24baa369","sha256:6943b778d39a6fbec214fee65737b3ac821f94077655b4b7b9c4a589f3eb3df5"],"state_sha256":"72d3858533ae88e329e03d67d2be498f1abea085f8a983829aceffe100e278e6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dtpRkm9ZhRx8p4tZA04m/9dGoSaxC/KGa8/G46XGvp7MHwtoZtPak7yDskuvb0oF9Ckr92FB05mYrJof2n7UDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-12T10:11:58.912999Z","bundle_sha256":"4d57a1351a1a705eb00045d44401e1ceec65c98f0a37817ed50179d3138411d1"}}