{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2YC4V4TQLRAH66RC5U2RLFEMMW","short_pith_number":"pith:2YC4V4TQ","canonical_record":{"source":{"id":"1710.10753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-30T03:28:32Z","cross_cats_sorted":["cs.AI","cs.CC","cs.GT"],"title_canon_sha256":"258224a2811deadd3784b9245f3ddab0113d91e6e4e3316e11935287a5176011","abstract_canon_sha256":"27b5c8bce7955a2da287b030effd60da585c52e4b8be5e0508c016e793659337"},"schema_version":"1.0"},"canonical_sha256":"d605caf2705c407f7a22ed3515948c65a2fb90fbd06e7d0635fa779a6918155b","source":{"kind":"arxiv","id":"1710.10753","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10753","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10753v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10753","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"2YC4V4TQLRAH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YC4V4TQLRAH66RC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YC4V4TQ","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2YC4V4TQLRAH66RC5U2RLFEMMW","target":"record","payload":{"canonical_record":{"source":{"id":"1710.10753","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-30T03:28:32Z","cross_cats_sorted":["cs.AI","cs.CC","cs.GT"],"title_canon_sha256":"258224a2811deadd3784b9245f3ddab0113d91e6e4e3316e11935287a5176011","abstract_canon_sha256":"27b5c8bce7955a2da287b030effd60da585c52e4b8be5e0508c016e793659337"},"schema_version":"1.0"},"canonical_sha256":"d605caf2705c407f7a22ed3515948c65a2fb90fbd06e7d0635fa779a6918155b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:51.151145Z","signature_b64":"6nzfdFyD/2pDOwMI874gQ6nNBT1bq3RrR+hwd9teRcBOr+w/2nqMBvFKa2CInr1oTt/fAvpW8FOE0KClh84oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d605caf2705c407f7a22ed3515948c65a2fb90fbd06e7d0635fa779a6918155b","last_reissued_at":"2026-05-18T00:29:51.150527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:51.150527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.10753","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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JCrhzTwXQdIIUAnH0OlespONlmZBb4A8S6jA9xkMc2Ph1qHVtUDlwbTZGgwgFlLo0hQADnCgLGVTsd2tuIxvAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:04:48.366389Z"},"content_sha256":"10e4ca5e0a6b5bb7ca72995d97a64e3bff53a682ec83511cb0657836856888b6","schema_version":"1.0","event_id":"sha256:10e4ca5e0a6b5bb7ca72995d97a64e3bff53a682ec83511cb0657836856888b6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2YC4V4TQLRAH66RC5U2RLFEMMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computational Social Choice and Computational Complexity: BFFs?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CC","cs.GT"],"primary_cat":"cs.MA","authors_text":"Lane A. Hemaspaandra","submitted_at":"2017-10-30T03:28:32Z","abstract_excerpt":"We discuss the connection between computational social choice (comsoc) and computational complexity. We stress the work so far on, and urge continued focus on, two less-recognized aspects of this connection. Firstly, this is very much a two-way street: Everyone knows complexity classification is used in comsoc, but we also highlight benefits to complexity that have arisen from its use in comsoc. Secondly, more subtle, less-known complexity tools often can be very productively used in comsoc."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10753","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-18T00:29:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FHcfdaMwksa7MEyIHe9u/LjQVzxENYC9ZV4u0Pe12fMdhptRMXN7iXzyoImDL4EgL4uYR4MDMZOuqj49PyyyBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:04:48.367094Z"},"content_sha256":"cc252a4b538a447c6bed9704068775817781133d0f1153d2c1e28a7ad1aceb98","schema_version":"1.0","event_id":"sha256:cc252a4b538a447c6bed9704068775817781133d0f1153d2c1e28a7ad1aceb98"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/bundle.json","state_url":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/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-27T05:04:48Z","links":{"resolver":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW","bundle":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/bundle.json","state":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2YC4V4TQLRAH66RC5U2RLFEMMW","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":"27b5c8bce7955a2da287b030effd60da585c52e4b8be5e0508c016e793659337","cross_cats_sorted":["cs.AI","cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-30T03:28:32Z","title_canon_sha256":"258224a2811deadd3784b9245f3ddab0113d91e6e4e3316e11935287a5176011"},"schema_version":"1.0","source":{"id":"1710.10753","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.10753","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"arxiv_version","alias_value":"1710.10753v2","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10753","created_at":"2026-05-18T00:29:51Z"},{"alias_kind":"pith_short_12","alias_value":"2YC4V4TQLRAH","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2YC4V4TQLRAH66RC","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2YC4V4TQ","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:cc252a4b538a447c6bed9704068775817781133d0f1153d2c1e28a7ad1aceb98","target":"graph","created_at":"2026-05-18T00:29:51Z","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 discuss the connection between computational social choice (comsoc) and computational complexity. We stress the work so far on, and urge continued focus on, two less-recognized aspects of this connection. Firstly, this is very much a two-way street: Everyone knows complexity classification is used in comsoc, but we also highlight benefits to complexity that have arisen from its use in comsoc. Secondly, more subtle, less-known complexity tools often can be very productively used in comsoc.","authors_text":"Lane A. Hemaspaandra","cross_cats":["cs.AI","cs.CC","cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-30T03:28:32Z","title":"Computational Social Choice and Computational Complexity: BFFs?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10753","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:10e4ca5e0a6b5bb7ca72995d97a64e3bff53a682ec83511cb0657836856888b6","target":"record","created_at":"2026-05-18T00:29:51Z","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":"27b5c8bce7955a2da287b030effd60da585c52e4b8be5e0508c016e793659337","cross_cats_sorted":["cs.AI","cs.CC","cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MA","submitted_at":"2017-10-30T03:28:32Z","title_canon_sha256":"258224a2811deadd3784b9245f3ddab0113d91e6e4e3316e11935287a5176011"},"schema_version":"1.0","source":{"id":"1710.10753","kind":"arxiv","version":2}},"canonical_sha256":"d605caf2705c407f7a22ed3515948c65a2fb90fbd06e7d0635fa779a6918155b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d605caf2705c407f7a22ed3515948c65a2fb90fbd06e7d0635fa779a6918155b","first_computed_at":"2026-05-18T00:29:51.150527Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:51.150527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6nzfdFyD/2pDOwMI874gQ6nNBT1bq3RrR+hwd9teRcBOr+w/2nqMBvFKa2CInr1oTt/fAvpW8FOE0KClh84oAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:51.151145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.10753","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10e4ca5e0a6b5bb7ca72995d97a64e3bff53a682ec83511cb0657836856888b6","sha256:cc252a4b538a447c6bed9704068775817781133d0f1153d2c1e28a7ad1aceb98"],"state_sha256":"b5d0aca785a508e2644f6603859c5d33551f68f89d327cea18048fe67c3dbece"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"spz8jiRTY6i7BPdMai2K60/qxAvN41fnyENQpXNu1hw0jNI6deFirVrNbLI9GEHSoVjI3KWyx9KtAGH0Zkr8Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:04:48.370953Z","bundle_sha256":"436ed0a94029d369016345c99a1c32697653da8ea7f4a72fd56c8d964af68a83"}}