{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:G27QM5KYLVZSTJ5UZMWQP6PPLN","short_pith_number":"pith:G27QM5KY","schema_version":"1.0","canonical_sha256":"36bf0675585d7329a7b4cb2d07f9ef5b77795b8f1729ebbb5e9a48f710e6f980","source":{"kind":"arxiv","id":"2411.19049","version":1},"attestation_state":"computed","paper":{"title":"A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelina Zhang, Arya Maheshwari, Istv\\'an Mikl\\'os, Sara Logsdon","submitted_at":"2024-11-28T10:50:49Z","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"},"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":"2411.19049","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-28T10:50:49Z","cross_cats_sorted":[],"title_canon_sha256":"db60d242721b7b2eeac100a4dcbf71c3c3290a80ec7401ab1e504b8bfe3bcf2a","abstract_canon_sha256":"799dcaec9adbe36db6ef12f0122b2d6cbad2c9dfb6fd02be01e1f23d94cc6566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:41:56.560593Z","signature_b64":"nUY0yOnPBiV6LDnJqnHDGSjEq0x4t5Y2iRrUWJJPEoYyd4/ESUGr9dhEFHtgkF+lx0WK2FmRkkSMqdLp1TwNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36bf0675585d7329a7b4cb2d07f9ef5b77795b8f1729ebbb5e9a48f710e6f980","last_reissued_at":"2026-07-05T09:41:56.560136Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:41:56.560136Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dichotomy theorem on the complexity of 3-uniform hypergraphic degree sequence graphicality","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Angelina Zhang, Arya Maheshwari, Istv\\'an Mikl\\'os, Sara Logsdon","submitted_at":"2024-11-28T10:50:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.19049","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/2411.19049/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":"2411.19049","created_at":"2026-07-05T09:41:56.560192+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.19049v1","created_at":"2026-07-05T09:41:56.560192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.19049","created_at":"2026-07-05T09:41:56.560192+00:00"},{"alias_kind":"pith_short_12","alias_value":"G27QM5KYLVZS","created_at":"2026-07-05T09:41:56.560192+00:00"},{"alias_kind":"pith_short_16","alias_value":"G27QM5KYLVZSTJ5U","created_at":"2026-07-05T09:41:56.560192+00:00"},{"alias_kind":"pith_short_8","alias_value":"G27QM5KY","created_at":"2026-07-05T09:41:56.560192+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08523","citing_title":"Fixed-Parameter Tractability of $t$-Uniform Hypergraphicality","ref_index":7,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN","json":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN.json","graph_json":"https://pith.science/api/pith-number/G27QM5KYLVZSTJ5UZMWQP6PPLN/graph.json","events_json":"https://pith.science/api/pith-number/G27QM5KYLVZSTJ5UZMWQP6PPLN/events.json","paper":"https://pith.science/paper/G27QM5KY"},"agent_actions":{"view_html":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN","download_json":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN.json","view_paper":"https://pith.science/paper/G27QM5KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.19049&json=true","fetch_graph":"https://pith.science/api/pith-number/G27QM5KYLVZSTJ5UZMWQP6PPLN/graph.json","fetch_events":"https://pith.science/api/pith-number/G27QM5KYLVZSTJ5UZMWQP6PPLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN/action/storage_attestation","attest_author":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN/action/author_attestation","sign_citation":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN/action/citation_signature","submit_replication":"https://pith.science/pith/G27QM5KYLVZSTJ5UZMWQP6PPLN/action/replication_record"}},"created_at":"2026-07-05T09:41:56.560192+00:00","updated_at":"2026-07-05T09:41:56.560192+00:00"}