{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2YC4V4TQLRAH66RC5U2RLFEMMW","short_pith_number":"pith:2YC4V4TQ","schema_version":"1.0","canonical_sha256":"d605caf2705c407f7a22ed3515948c65a2fb90fbd06e7d0635fa779a6918155b","source":{"kind":"arxiv","id":"1710.10753","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.10753","created_at":"2026-05-18T00:29:51.150613+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10753v2","created_at":"2026-05-18T00:29:51.150613+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10753","created_at":"2026-05-18T00:29:51.150613+00:00"},{"alias_kind":"pith_short_12","alias_value":"2YC4V4TQLRAH","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2YC4V4TQLRAH66RC","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2YC4V4TQ","created_at":"2026-05-18T12:30:55.937587+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/2YC4V4TQLRAH66RC5U2RLFEMMW","json":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW.json","graph_json":"https://pith.science/api/pith-number/2YC4V4TQLRAH66RC5U2RLFEMMW/graph.json","events_json":"https://pith.science/api/pith-number/2YC4V4TQLRAH66RC5U2RLFEMMW/events.json","paper":"https://pith.science/paper/2YC4V4TQ"},"agent_actions":{"view_html":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW","download_json":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW.json","view_paper":"https://pith.science/paper/2YC4V4TQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10753&json=true","fetch_graph":"https://pith.science/api/pith-number/2YC4V4TQLRAH66RC5U2RLFEMMW/graph.json","fetch_events":"https://pith.science/api/pith-number/2YC4V4TQLRAH66RC5U2RLFEMMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/action/storage_attestation","attest_author":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/action/author_attestation","sign_citation":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/action/citation_signature","submit_replication":"https://pith.science/pith/2YC4V4TQLRAH66RC5U2RLFEMMW/action/replication_record"}},"created_at":"2026-05-18T00:29:51.150613+00:00","updated_at":"2026-05-18T00:29:51.150613+00:00"}