{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:YY7UTM6DCUQLHI7JR4WJKF7XZ3","short_pith_number":"pith:YY7UTM6D","schema_version":"1.0","canonical_sha256":"c63f49b3c31520b3a3e98f2c9517f7ced5f6cf34790d54d6f541139422f53741","source":{"kind":"arxiv","id":"1306.0634","version":1},"attestation_state":"computed","paper":{"title":"The smallest one-realization of a given set IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Kefeng Diao, Ping Zhao, Vitaly I. Voloshin","submitted_at":"2013-06-04T02:07:44Z","abstract_excerpt":"Let $S$ be a finite set 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 [P. Zhao, K. Diao, Y. Chang and K. Wang, The smallest one-realization of a given set \\uppercase\\expandafter{\\romannumeral2}, Discrete Math. 312 (2012) 2946--2951], we determined the minimum number of vertices of a 3-uniform bi-hypergraph which is a one-realization of $S$. In this paper, we generalize this result to $r$-uniform bi-hypergraphs."},"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":"1306.0634","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-04T02:07:44Z","cross_cats_sorted":[],"title_canon_sha256":"4dc5b2d39391655911e0f3693805da8b5c816a46dd94c8628930e3557c4e01b9","abstract_canon_sha256":"39e495b820e8153fac39d178af007d177a4ecad3ce34ec1ce22584ca9521fccd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:54.479191Z","signature_b64":"YSSmtQQYYdH3gPgWAucapXXU6TZd/K1KnJba+wLbIdqEUODtkg1uY5CQLGcFbdg7TZhuI3/9XDLFUNgCFTmVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c63f49b3c31520b3a3e98f2c9517f7ced5f6cf34790d54d6f541139422f53741","last_reissued_at":"2026-05-18T03:21:54.478758Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:54.478758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The smallest one-realization of a given set IV","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kaishun Wang, Kefeng Diao, Ping Zhao, Vitaly I. Voloshin","submitted_at":"2013-06-04T02:07:44Z","abstract_excerpt":"Let $S$ be a finite set 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 [P. Zhao, K. Diao, Y. Chang and K. Wang, The smallest one-realization of a given set \\uppercase\\expandafter{\\romannumeral2}, Discrete Math. 312 (2012) 2946--2951], we determined the minimum number of vertices of a 3-uniform bi-hypergraph which is a one-realization of $S$. In this paper, we generalize this result to $r$-uniform bi-hypergraphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.0634","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":"1306.0634","created_at":"2026-05-18T03:21:54.478813+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.0634v1","created_at":"2026-05-18T03:21:54.478813+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.0634","created_at":"2026-05-18T03:21:54.478813+00:00"},{"alias_kind":"pith_short_12","alias_value":"YY7UTM6DCUQL","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"YY7UTM6DCUQLHI7J","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"YY7UTM6D","created_at":"2026-05-18T12:28:09.283467+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/YY7UTM6DCUQLHI7JR4WJKF7XZ3","json":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3.json","graph_json":"https://pith.science/api/pith-number/YY7UTM6DCUQLHI7JR4WJKF7XZ3/graph.json","events_json":"https://pith.science/api/pith-number/YY7UTM6DCUQLHI7JR4WJKF7XZ3/events.json","paper":"https://pith.science/paper/YY7UTM6D"},"agent_actions":{"view_html":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3","download_json":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3.json","view_paper":"https://pith.science/paper/YY7UTM6D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.0634&json=true","fetch_graph":"https://pith.science/api/pith-number/YY7UTM6DCUQLHI7JR4WJKF7XZ3/graph.json","fetch_events":"https://pith.science/api/pith-number/YY7UTM6DCUQLHI7JR4WJKF7XZ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3/action/storage_attestation","attest_author":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3/action/author_attestation","sign_citation":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3/action/citation_signature","submit_replication":"https://pith.science/pith/YY7UTM6DCUQLHI7JR4WJKF7XZ3/action/replication_record"}},"created_at":"2026-05-18T03:21:54.478813+00:00","updated_at":"2026-05-18T03:21:54.478813+00:00"}