{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DF4AXSBCWPNGCYWBGSW6N5RJPF","short_pith_number":"pith:DF4AXSBC","schema_version":"1.0","canonical_sha256":"19780bc822b3da6162c134ade6f629797a6052b2e24798e00665ab20b94e7dfa","source":{"kind":"arxiv","id":"1407.1422","version":1},"attestation_state":"computed","paper":{"title":"Spectrum of mixed bi-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Enrica Cherubini, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2014-07-05T17:33:15Z","abstract_excerpt":"A mixed hypergraph is a triple $H=(V,\\mathcal{C},\\mathcal{D})$, where $V$ is a set of vertices, $\\mathcal{C}$ and $\\mathcal{D}$ are sets of hyperedges. A vertex-coloring of $H$ is proper if $C$-edges are not totally multicolored and $D$-edges are not monochromatic. The feasible set $S(H)$ of $H$ is the set of all integers, $s$, such that $H$ has a proper coloring with $s$ colors.\n  Bujt\\'as and Tuza [Graphs and Combinatorics 24 (2008), 1--12] gave a characterization of feasible sets for mixed hypergraphs with all $C$- and $D$-edges of the same size $r$, $r\\geq 3$.\n  In this note, we give a sho"},"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":"1407.1422","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-07-05T17:33:15Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"9728a1334443dbd85423b9d05bfb607c47fa1c53fe8ebca1bc70c92cfe90c6c5","abstract_canon_sha256":"bbeb2633515c3b2554e52336a8bfd660e92305d909d2f7e15b366b77d465dec7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:16.611053Z","signature_b64":"OUdRHxxBgCW1VvnxKYiPFpnFnq7dIBxRNrX0/TZSFAQNgT5HngwrhbMfKdHn2Z+h6ABqoCMuUAhwHmtCPaW/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19780bc822b3da6162c134ade6f629797a6052b2e24798e00665ab20b94e7dfa","last_reissued_at":"2026-05-18T02:48:16.610649Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:16.610649Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectrum of mixed bi-uniform hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Enrica Cherubini, Maria Axenovich, Torsten Ueckerdt","submitted_at":"2014-07-05T17:33:15Z","abstract_excerpt":"A mixed hypergraph is a triple $H=(V,\\mathcal{C},\\mathcal{D})$, where $V$ is a set of vertices, $\\mathcal{C}$ and $\\mathcal{D}$ are sets of hyperedges. A vertex-coloring of $H$ is proper if $C$-edges are not totally multicolored and $D$-edges are not monochromatic. The feasible set $S(H)$ of $H$ is the set of all integers, $s$, such that $H$ has a proper coloring with $s$ colors.\n  Bujt\\'as and Tuza [Graphs and Combinatorics 24 (2008), 1--12] gave a characterization of feasible sets for mixed hypergraphs with all $C$- and $D$-edges of the same size $r$, $r\\geq 3$.\n  In this note, we give a sho"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1422","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":"1407.1422","created_at":"2026-05-18T02:48:16.610710+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1422v1","created_at":"2026-05-18T02:48:16.610710+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1422","created_at":"2026-05-18T02:48:16.610710+00:00"},{"alias_kind":"pith_short_12","alias_value":"DF4AXSBCWPNG","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DF4AXSBCWPNGCYWB","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DF4AXSBC","created_at":"2026-05-18T12:28:25.294606+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/DF4AXSBCWPNGCYWBGSW6N5RJPF","json":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF.json","graph_json":"https://pith.science/api/pith-number/DF4AXSBCWPNGCYWBGSW6N5RJPF/graph.json","events_json":"https://pith.science/api/pith-number/DF4AXSBCWPNGCYWBGSW6N5RJPF/events.json","paper":"https://pith.science/paper/DF4AXSBC"},"agent_actions":{"view_html":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF","download_json":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF.json","view_paper":"https://pith.science/paper/DF4AXSBC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1422&json=true","fetch_graph":"https://pith.science/api/pith-number/DF4AXSBCWPNGCYWBGSW6N5RJPF/graph.json","fetch_events":"https://pith.science/api/pith-number/DF4AXSBCWPNGCYWBGSW6N5RJPF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF/action/storage_attestation","attest_author":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF/action/author_attestation","sign_citation":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF/action/citation_signature","submit_replication":"https://pith.science/pith/DF4AXSBCWPNGCYWBGSW6N5RJPF/action/replication_record"}},"created_at":"2026-05-18T02:48:16.610710+00:00","updated_at":"2026-05-18T02:48:16.610710+00:00"}