{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:6GLFT7AAJEHO3K3UIU7QHWLQ6O","short_pith_number":"pith:6GLFT7AA","schema_version":"1.0","canonical_sha256":"f19659fc00490eedab74453f03d970f3952faec2d81aa56e6d8ad212fbe858bb","source":{"kind":"arxiv","id":"1710.02679","version":1},"attestation_state":"computed","paper":{"title":"Extended Formulations for Order Polytopes through Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Clintin P. Davis-Stober, Fran\\c{c}ois Glineur, Jean-Paul Doignon, Michel Regenwetter, Samuel Fiorini","submitted_at":"2017-10-07T12:30:39Z","abstract_excerpt":"Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models, the predicted choice probabilities often form a bounded and convex polyhedral set, or polytope. Polyhedral combinatorics have thus played a key role in studying the mathematical structure of these models. However, standard methods for characterizing the polytopes of such models are subject to a combinatorial explosion in complexity as the number of choice alternatives increases. Specifically, this is the case for ran"},"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.02679","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-07T12:30:39Z","cross_cats_sorted":[],"title_canon_sha256":"f00b3ab770071e2149b467e0af81b82c8f278a953d8bdcf17f7c638e1a070489","abstract_canon_sha256":"055a5aca1391694d54d848b2e7d132cc51670d2daeeb6aa0a6fc23b2e2cf69af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:29.165843Z","signature_b64":"hzbkuX1g5mpzJ2n8P61BWxawaLtf1JIFxskcM1P9xjc1wetX76dGIJnAZ+p8cvxnTfnc4Ea65BhmS2W1aHduBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f19659fc00490eedab74453f03d970f3952faec2d81aa56e6d8ad212fbe858bb","last_reissued_at":"2026-05-18T00:33:29.165126Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:29.165126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extended Formulations for Order Polytopes through Network Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Clintin P. Davis-Stober, Fran\\c{c}ois Glineur, Jean-Paul Doignon, Michel Regenwetter, Samuel Fiorini","submitted_at":"2017-10-07T12:30:39Z","abstract_excerpt":"Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free random utility models and associated random preference models. For such models, the predicted choice probabilities often form a bounded and convex polyhedral set, or polytope. Polyhedral combinatorics have thus played a key role in studying the mathematical structure of these models. However, standard methods for characterizing the polytopes of such models are subject to a combinatorial explosion in complexity as the number of choice alternatives increases. Specifically, this is the case for ran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.02679","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":"1710.02679","created_at":"2026-05-18T00:33:29.165248+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.02679v1","created_at":"2026-05-18T00:33:29.165248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.02679","created_at":"2026-05-18T00:33:29.165248+00:00"},{"alias_kind":"pith_short_12","alias_value":"6GLFT7AAJEHO","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"6GLFT7AAJEHO3K3U","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"6GLFT7AA","created_at":"2026-05-18T12:31:03.183658+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/6GLFT7AAJEHO3K3UIU7QHWLQ6O","json":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O.json","graph_json":"https://pith.science/api/pith-number/6GLFT7AAJEHO3K3UIU7QHWLQ6O/graph.json","events_json":"https://pith.science/api/pith-number/6GLFT7AAJEHO3K3UIU7QHWLQ6O/events.json","paper":"https://pith.science/paper/6GLFT7AA"},"agent_actions":{"view_html":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O","download_json":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O.json","view_paper":"https://pith.science/paper/6GLFT7AA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.02679&json=true","fetch_graph":"https://pith.science/api/pith-number/6GLFT7AAJEHO3K3UIU7QHWLQ6O/graph.json","fetch_events":"https://pith.science/api/pith-number/6GLFT7AAJEHO3K3UIU7QHWLQ6O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O/action/storage_attestation","attest_author":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O/action/author_attestation","sign_citation":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O/action/citation_signature","submit_replication":"https://pith.science/pith/6GLFT7AAJEHO3K3UIU7QHWLQ6O/action/replication_record"}},"created_at":"2026-05-18T00:33:29.165248+00:00","updated_at":"2026-05-18T00:33:29.165248+00:00"}