{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:UOJWHCOGOPVRRDKW7K3BRK67VY","short_pith_number":"pith:UOJWHCOG","schema_version":"1.0","canonical_sha256":"a3936389c673eb188d56fab618abdfae1d31755d3e5e6f6deedf4b33347510d1","source":{"kind":"arxiv","id":"1111.1368","version":1},"attestation_state":"computed","paper":{"title":"The smallest 3-uniform bi-hypergraphs which are one-realization of a given set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Kefeng Diao, Ping Zhao","submitted_at":"2011-11-06T02:39:43Z","abstract_excerpt":"For any set $S$ of positive integers, a mixed hypergraph ${\\cal H}$ is a one-realization of $S$ if its feasible set is $S$ and each entry of its chromatic spectrum is either 0 or 1. In this paper, we determine the minimum size of 3-uniform bi-hypergraphs which are one-realizations of a given set $S$. As a result, we partially solve an open problem proposed by Bujt$\\acute{\\rm a}$s and Tuza in 2008."},"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":"1111.1368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-11-06T02:39:43Z","cross_cats_sorted":[],"title_canon_sha256":"37ce49bf6a38ce00d24e5ac4a05043aa21668dad4995e2aa18486d42be784b05","abstract_canon_sha256":"7a30bf3331e56739aa85285b48b8b63da88ee7f684421c58e4b397c3b224d4c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:26.370203Z","signature_b64":"Cj+g9UpkSMcvBE9kIZgSnAMDosczjsU48HFGAf1ZGf5hXabfe2Aw4Ff/nl/5BsafjQ6bkd5YIWfyXMJ7Cq8/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3936389c673eb188d56fab618abdfae1d31755d3e5e6f6deedf4b33347510d1","last_reissued_at":"2026-05-18T04:09:26.369720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:26.369720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The smallest 3-uniform bi-hypergraphs which are one-realization of a given set","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Kefeng Diao, Ping Zhao","submitted_at":"2011-11-06T02:39:43Z","abstract_excerpt":"For any set $S$ of positive integers, a mixed hypergraph ${\\cal H}$ is a one-realization of $S$ if its feasible set is $S$ and each entry of its chromatic spectrum is either 0 or 1. In this paper, we determine the minimum size of 3-uniform bi-hypergraphs which are one-realizations of a given set $S$. As a result, we partially solve an open problem proposed by Bujt$\\acute{\\rm a}$s and Tuza in 2008."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.1368","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":"1111.1368","created_at":"2026-05-18T04:09:26.369795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.1368v1","created_at":"2026-05-18T04:09:26.369795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.1368","created_at":"2026-05-18T04:09:26.369795+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOJWHCOGOPVR","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOJWHCOGOPVRRDKW","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOJWHCOG","created_at":"2026-05-18T12:26:42.757692+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/UOJWHCOGOPVRRDKW7K3BRK67VY","json":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY.json","graph_json":"https://pith.science/api/pith-number/UOJWHCOGOPVRRDKW7K3BRK67VY/graph.json","events_json":"https://pith.science/api/pith-number/UOJWHCOGOPVRRDKW7K3BRK67VY/events.json","paper":"https://pith.science/paper/UOJWHCOG"},"agent_actions":{"view_html":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY","download_json":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY.json","view_paper":"https://pith.science/paper/UOJWHCOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.1368&json=true","fetch_graph":"https://pith.science/api/pith-number/UOJWHCOGOPVRRDKW7K3BRK67VY/graph.json","fetch_events":"https://pith.science/api/pith-number/UOJWHCOGOPVRRDKW7K3BRK67VY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY/action/storage_attestation","attest_author":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY/action/author_attestation","sign_citation":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY/action/citation_signature","submit_replication":"https://pith.science/pith/UOJWHCOGOPVRRDKW7K3BRK67VY/action/replication_record"}},"created_at":"2026-05-18T04:09:26.369795+00:00","updated_at":"2026-05-18T04:09:26.369795+00:00"}