{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:DOASDMOLMV5C7NHIMPTDN2UHGM","short_pith_number":"pith:DOASDMOL","schema_version":"1.0","canonical_sha256":"1b8121b1cb657a2fb4e863e636ea8733071bee7caf7b18c28284c37f0948e077","source":{"kind":"arxiv","id":"2008.00043","version":1},"attestation_state":"computed","paper":{"title":"Generalized Cut Polytopes for Binary Hierarchical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Aida Maraj, Benjamin Hollering, Jane Ivy Coons, Joseph Cummings","submitted_at":"2020-07-31T19:12:59Z","abstract_excerpt":"Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the existence of maximum likelihood estimates or the normality of the associated semigroup. Cut polytopes of graphs have been useful in analyzing binary marginal polytopes in the case where the simplicial complex underlying the hierarchical model is a graph. We introduce a generalized cut polytope that is isomorphic to the binary marginal polytope of an arbitrary "},"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":"2008.00043","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2020-07-31T19:12:59Z","cross_cats_sorted":["math.ST","stat.TH"],"title_canon_sha256":"4a8b1b20732e4d99b2c9dcae3a8ab07ff49bc9ec813e8a448fe6dd987182dd86","abstract_canon_sha256":"e74e3ca60ac564c510c2f4f3b67e13ba37851cad5bcae6894b850ed959b64c39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:20:27.603681Z","signature_b64":"JEbaPxkIBpRQ0OK+/kq2lGjVrU2Bwg4nZQcIZEmoTWmNj7gfTw+WnYqJ/ZN0oLhVV4KugIiSWE0GoL6FdW/ABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b8121b1cb657a2fb4e863e636ea8733071bee7caf7b18c28284c37f0948e077","last_reissued_at":"2026-07-05T07:20:27.603262Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:20:27.603262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Cut Polytopes for Binary Hierarchical Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.ST","stat.TH"],"primary_cat":"math.CO","authors_text":"Aida Maraj, Benjamin Hollering, Jane Ivy Coons, Joseph Cummings","submitted_at":"2020-07-31T19:12:59Z","abstract_excerpt":"Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the existence of maximum likelihood estimates or the normality of the associated semigroup. Cut polytopes of graphs have been useful in analyzing binary marginal polytopes in the case where the simplicial complex underlying the hierarchical model is a graph. We introduce a generalized cut polytope that is isomorphic to the binary marginal polytope of an arbitrary "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2008.00043","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2008.00043/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2008.00043","created_at":"2026-07-05T07:20:27.603325+00:00"},{"alias_kind":"arxiv_version","alias_value":"2008.00043v1","created_at":"2026-07-05T07:20:27.603325+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2008.00043","created_at":"2026-07-05T07:20:27.603325+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOASDMOLMV5C","created_at":"2026-07-05T07:20:27.603325+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOASDMOLMV5C7NHI","created_at":"2026-07-05T07:20:27.603325+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOASDMOL","created_at":"2026-07-05T07:20:27.603325+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/DOASDMOLMV5C7NHIMPTDN2UHGM","json":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM.json","graph_json":"https://pith.science/api/pith-number/DOASDMOLMV5C7NHIMPTDN2UHGM/graph.json","events_json":"https://pith.science/api/pith-number/DOASDMOLMV5C7NHIMPTDN2UHGM/events.json","paper":"https://pith.science/paper/DOASDMOL"},"agent_actions":{"view_html":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM","download_json":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM.json","view_paper":"https://pith.science/paper/DOASDMOL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2008.00043&json=true","fetch_graph":"https://pith.science/api/pith-number/DOASDMOLMV5C7NHIMPTDN2UHGM/graph.json","fetch_events":"https://pith.science/api/pith-number/DOASDMOLMV5C7NHIMPTDN2UHGM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM/action/storage_attestation","attest_author":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM/action/author_attestation","sign_citation":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM/action/citation_signature","submit_replication":"https://pith.science/pith/DOASDMOLMV5C7NHIMPTDN2UHGM/action/replication_record"}},"created_at":"2026-07-05T07:20:27.603325+00:00","updated_at":"2026-07-05T07:20:27.603325+00:00"}