{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JE5PGAI4EHROZC5SEISZ5COKSZ","short_pith_number":"pith:JE5PGAI4","schema_version":"1.0","canonical_sha256":"493af3011c21e2ec8bb222259e89ca965360f79046edac834688027113a4fceb","source":{"kind":"arxiv","id":"1005.5622","version":3},"attestation_state":"computed","paper":{"title":"On the hypercompetition numbers of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Yoshio Sano","submitted_at":"2010-05-31T08:51:53Z","abstract_excerpt":"The competition hypergraph $C{\\cH}(D)$ of a digraph $D$ is the hypergraph such that the vertex set is the same as $D$ and $e \\subseteq V(D)$ is a hyperedge if and only if $e$ contains at least 2 vertices and $e$ coincides with the in-neighborhood of some vertex $v$ in the digraph $D$. Any hypergraph with sufficiently many isolated vertices is the competition hypergraph of an acyclic digraph. The hypercompetition number $hk(\\cH)$ of a hypergraph $\\cH$ is defined to be the smallest number of such isolated vertices.\n  In this paper, we study the hypercompetition numbers of hypergraphs. First, we "},"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":"1005.5622","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-31T08:51:53Z","cross_cats_sorted":[],"title_canon_sha256":"202c2fa38392265af49c76a02a307e49189bb9e50ca732ba6c038a467eafcd1b","abstract_canon_sha256":"1363801cf083cd0ca8d899a120226cdd24242f551781db3076c48645aa81727e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:19:33.511056Z","signature_b64":"cGlm8gkm+/AnzMmpElbvF3JMWbsAAl1FbVMFoE9CCWLGLS0cozLV2xaCGgXitj1OvadP87knaS5gTq7JZS9xDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"493af3011c21e2ec8bb222259e89ca965360f79046edac834688027113a4fceb","last_reissued_at":"2026-05-18T04:19:33.510659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:19:33.510659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the hypercompetition numbers of hypergraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boram Park, Yoshio Sano","submitted_at":"2010-05-31T08:51:53Z","abstract_excerpt":"The competition hypergraph $C{\\cH}(D)$ of a digraph $D$ is the hypergraph such that the vertex set is the same as $D$ and $e \\subseteq V(D)$ is a hyperedge if and only if $e$ contains at least 2 vertices and $e$ coincides with the in-neighborhood of some vertex $v$ in the digraph $D$. Any hypergraph with sufficiently many isolated vertices is the competition hypergraph of an acyclic digraph. The hypercompetition number $hk(\\cH)$ of a hypergraph $\\cH$ is defined to be the smallest number of such isolated vertices.\n  In this paper, we study the hypercompetition numbers of hypergraphs. First, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.5622","kind":"arxiv","version":3},"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":"1005.5622","created_at":"2026-05-18T04:19:33.510712+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.5622v3","created_at":"2026-05-18T04:19:33.510712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.5622","created_at":"2026-05-18T04:19:33.510712+00:00"},{"alias_kind":"pith_short_12","alias_value":"JE5PGAI4EHRO","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JE5PGAI4EHROZC5S","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JE5PGAI4","created_at":"2026-05-18T12:26:09.077623+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/JE5PGAI4EHROZC5SEISZ5COKSZ","json":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ.json","graph_json":"https://pith.science/api/pith-number/JE5PGAI4EHROZC5SEISZ5COKSZ/graph.json","events_json":"https://pith.science/api/pith-number/JE5PGAI4EHROZC5SEISZ5COKSZ/events.json","paper":"https://pith.science/paper/JE5PGAI4"},"agent_actions":{"view_html":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ","download_json":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ.json","view_paper":"https://pith.science/paper/JE5PGAI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.5622&json=true","fetch_graph":"https://pith.science/api/pith-number/JE5PGAI4EHROZC5SEISZ5COKSZ/graph.json","fetch_events":"https://pith.science/api/pith-number/JE5PGAI4EHROZC5SEISZ5COKSZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ/action/storage_attestation","attest_author":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ/action/author_attestation","sign_citation":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ/action/citation_signature","submit_replication":"https://pith.science/pith/JE5PGAI4EHROZC5SEISZ5COKSZ/action/replication_record"}},"created_at":"2026-05-18T04:19:33.510712+00:00","updated_at":"2026-05-18T04:19:33.510712+00:00"}