{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:G27QM5KYLVZSTJ5UZMWQP6PPLN","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":"799dcaec9adbe36db6ef12f0122b2d6cbad2c9dfb6fd02be01e1f23d94cc6566","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T10:50:49Z","title_canon_sha256":"db60d242721b7b2eeac100a4dcbf71c3c3290a80ec7401ab1e504b8bfe3bcf2a"},"schema_version":"1.0","source":{"id":"2411.19049","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.19049","created_at":"2026-07-05T09:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"2411.19049v1","created_at":"2026-07-05T09:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19049","created_at":"2026-07-05T09:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"G27QM5KYLVZS","created_at":"2026-07-05T09:41:56Z"},{"alias_kind":"pith_short_16","alias_value":"G27QM5KYLVZSTJ5U","created_at":"2026-07-05T09:41:56Z"},{"alias_kind":"pith_short_8","alias_value":"G27QM5KY","created_at":"2026-07-05T09:41:56Z"}],"graph_snapshots":[{"event_id":"sha256:aad35984ad5327435006b50a75f5848e2091e10dc53fddbb3a877718739d86c7","target":"graph","created_at":"2026-07-05T09:41:56Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.19049/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present a dichotomy theorem on the parameterized complexity of the 3-uniform hypergraphicality problem. Given $0<c_1\\le c_2 < 1$, the parameterized 3-uniform Hypergraphic Degree Sequence problem, $3uni-HDS_{c_1,c_2}$, considers degree sequences $D$ of length $n$ such that all degrees are between $c_1 {n-1 \\choose 2}$ and $c_2 {n-1\\choose 2}$ and it asks if there is a 3-uniform hypergraph with degree sequence $D$. We prove that for any $0<c_2< 1$, there exists a unique, polynomial-time computable $c_1^*$ with the following properties. For any $ c_1\\in (c_1^*,c_2]$, $3uni-HDS_{c_1,c_2}$ can b","authors_text":"Angelina Zhang, Arya Maheshwari, Istv\\'an Mikl\\'os, Sara Logsdon","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T10:50:49Z","title":"A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19049","kind":"arxiv","version":1},"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:6fbed4ac8507bf93f36ff094e1d2f8c6f0d9a38a42ea5ebf5231f01b11f7e951","target":"record","created_at":"2026-07-05T09:41:56Z","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":"799dcaec9adbe36db6ef12f0122b2d6cbad2c9dfb6fd02be01e1f23d94cc6566","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T10:50:49Z","title_canon_sha256":"db60d242721b7b2eeac100a4dcbf71c3c3290a80ec7401ab1e504b8bfe3bcf2a"},"schema_version":"1.0","source":{"id":"2411.19049","kind":"arxiv","version":1}},"canonical_sha256":"36bf0675585d7329a7b4cb2d07f9ef5b77795b8f1729ebbb5e9a48f710e6f980","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"36bf0675585d7329a7b4cb2d07f9ef5b77795b8f1729ebbb5e9a48f710e6f980","first_computed_at":"2026-07-05T09:41:56.560136Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:41:56.560136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nUY0yOnPBiV6LDnJqnHDGSjEq0x4t5Y2iRrUWJJPEoYyd4/ESUGr9dhEFHtgkF+lx0WK2FmRkkSMqdLp1TwNCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:41:56.560593Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.19049","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fbed4ac8507bf93f36ff094e1d2f8c6f0d9a38a42ea5ebf5231f01b11f7e951","sha256:aad35984ad5327435006b50a75f5848e2091e10dc53fddbb3a877718739d86c7"],"state_sha256":"f6ef29c23213ed004c9f77bf983df4bdb61d901199034e8a6e4b7629f0e2017e"}