{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3AVR3VICN57OLH5NITHV6GFIAJ","short_pith_number":"pith:3AVR3VIC","schema_version":"1.0","canonical_sha256":"d82b1dd5026f7ee59fad44cf5f18a802786b097e8e5b74acbba4d027f073be3a","source":{"kind":"arxiv","id":"1802.02560","version":1},"attestation_state":"computed","paper":{"title":"Cubic Preferences and the Character Admissibility Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Beth Bjorkman, Jonathan Hodge, Sean Gravelle","submitted_at":"2018-02-07T18:33:45Z","abstract_excerpt":"In multiple-question referendum elections, the separability problem occurs when a voter's preferences on some questions or proposals depend on the predicted outcomes of others. The notion of separability formalizes the study of interdependence in multidimensional preferences, and the character admissibility problem deals with the construction of voter preferences with given separability structures. In this paper, we develop a graph theoretic approach to the character admissibilty problem, using Hamiltonian paths to generate voter preferences. We apply this method specifically to the hypercube "},"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":"1802.02560","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-07T18:33:45Z","cross_cats_sorted":[],"title_canon_sha256":"a6c0e4f0a0ba6ff2768843494180e4df3ee361163ec532220d4787fbf72c7e5e","abstract_canon_sha256":"f4348aa86e234d05d54a6e4926129c0d30a2cc2a841f3671c0b6802c5df8acff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:04.889390Z","signature_b64":"U4UuNpzcDidUR83t7L4D1f9zE6LCLdozJTWf84t8rurjOD+pzyxPry94oVNfrrnakKwRxrROaN9Wq31ezzFyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82b1dd5026f7ee59fad44cf5f18a802786b097e8e5b74acbba4d027f073be3a","last_reissued_at":"2026-05-18T00:24:04.888925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:04.888925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cubic Preferences and the Character Admissibility Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Beth Bjorkman, Jonathan Hodge, Sean Gravelle","submitted_at":"2018-02-07T18:33:45Z","abstract_excerpt":"In multiple-question referendum elections, the separability problem occurs when a voter's preferences on some questions or proposals depend on the predicted outcomes of others. The notion of separability formalizes the study of interdependence in multidimensional preferences, and the character admissibility problem deals with the construction of voter preferences with given separability structures. In this paper, we develop a graph theoretic approach to the character admissibilty problem, using Hamiltonian paths to generate voter preferences. We apply this method specifically to the hypercube "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02560","kind":"arxiv","version":1},"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":"1802.02560","created_at":"2026-05-18T00:24:04.888994+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.02560v1","created_at":"2026-05-18T00:24:04.888994+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02560","created_at":"2026-05-18T00:24:04.888994+00:00"},{"alias_kind":"pith_short_12","alias_value":"3AVR3VICN57O","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3AVR3VICN57OLH5N","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3AVR3VIC","created_at":"2026-05-18T12:32:02.567920+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/3AVR3VICN57OLH5NITHV6GFIAJ","json":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ.json","graph_json":"https://pith.science/api/pith-number/3AVR3VICN57OLH5NITHV6GFIAJ/graph.json","events_json":"https://pith.science/api/pith-number/3AVR3VICN57OLH5NITHV6GFIAJ/events.json","paper":"https://pith.science/paper/3AVR3VIC"},"agent_actions":{"view_html":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ","download_json":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ.json","view_paper":"https://pith.science/paper/3AVR3VIC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.02560&json=true","fetch_graph":"https://pith.science/api/pith-number/3AVR3VICN57OLH5NITHV6GFIAJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3AVR3VICN57OLH5NITHV6GFIAJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ/action/storage_attestation","attest_author":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ/action/author_attestation","sign_citation":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ/action/citation_signature","submit_replication":"https://pith.science/pith/3AVR3VICN57OLH5NITHV6GFIAJ/action/replication_record"}},"created_at":"2026-05-18T00:24:04.888994+00:00","updated_at":"2026-05-18T00:24:04.888994+00:00"}