{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZWKQH4MW2FATCSDTSJZ34S6JBO","short_pith_number":"pith:ZWKQH4MW","schema_version":"1.0","canonical_sha256":"cd9503f196d1413148739273be4bc90b8084c95da2e750fea7b6c576ae560983","source":{"kind":"arxiv","id":"1101.2257","version":1},"attestation_state":"computed","paper":{"title":"Nontrivial independent sets of bipartite graphs and cross-intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huajun Zhang, Jun Wang","submitted_at":"2011-01-12T02:18:21Z","abstract_excerpt":"Let $G(X,Y)$ be a connected, non-complete bipartite graph with $|X|\\leq |Y|$. An independent set $A$ of $G(X,Y)$ is said to be trivial if $A\\subseteq X$ or $A\\subseteq Y$. Otherwise, $A$ is nontrivial. By $\\alpha(X,Y)$ we denote the size of maximal-sized nontrivial independent sets of $G(X,Y)$. We prove that if the automorphism group of $G(X,Y)$ is transitive on $X$ and $Y$, then $\\alpha(X,Y)=|Y|-d(X)+1$, where $d(X)$ is the common degree of vertices in $X$. We also give the structures of maximal-sized nontrivial independent sets of $G(X,Y)$. As applications of this result, we give the upper 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":"1101.2257","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T02:18:21Z","cross_cats_sorted":[],"title_canon_sha256":"8e1e0a4c65b44e9f87fff03ee3aedc72d0369a2cd25aeeedfb4a478cf6b8f983","abstract_canon_sha256":"5bd16c491f823b52b80dc8153aba82ab1c74b6645d1a590786b2b5ce1b5e1780"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:43.257386Z","signature_b64":"AOMm1sjqz2I721QrXXSK468a7Qaiwp8uiQ0V/getKePmFM7hmdpJnaJMa9z9T7eq4U5qcdCpF+C407NVT0t5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd9503f196d1413148739273be4bc90b8084c95da2e750fea7b6c576ae560983","last_reissued_at":"2026-05-18T04:31:43.256924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:43.256924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nontrivial independent sets of bipartite graphs and cross-intersecting families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huajun Zhang, Jun Wang","submitted_at":"2011-01-12T02:18:21Z","abstract_excerpt":"Let $G(X,Y)$ be a connected, non-complete bipartite graph with $|X|\\leq |Y|$. An independent set $A$ of $G(X,Y)$ is said to be trivial if $A\\subseteq X$ or $A\\subseteq Y$. Otherwise, $A$ is nontrivial. By $\\alpha(X,Y)$ we denote the size of maximal-sized nontrivial independent sets of $G(X,Y)$. We prove that if the automorphism group of $G(X,Y)$ is transitive on $X$ and $Y$, then $\\alpha(X,Y)=|Y|-d(X)+1$, where $d(X)$ is the common degree of vertices in $X$. We also give the structures of maximal-sized nontrivial independent sets of $G(X,Y)$. As applications of this result, we give the upper b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2257","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":"1101.2257","created_at":"2026-05-18T04:31:43.256990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.2257v1","created_at":"2026-05-18T04:31:43.256990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2257","created_at":"2026-05-18T04:31:43.256990+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWKQH4MW2FAT","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWKQH4MW2FATCSDT","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWKQH4MW","created_at":"2026-05-18T12:26:50.516681+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/ZWKQH4MW2FATCSDTSJZ34S6JBO","json":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO.json","graph_json":"https://pith.science/api/pith-number/ZWKQH4MW2FATCSDTSJZ34S6JBO/graph.json","events_json":"https://pith.science/api/pith-number/ZWKQH4MW2FATCSDTSJZ34S6JBO/events.json","paper":"https://pith.science/paper/ZWKQH4MW"},"agent_actions":{"view_html":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO","download_json":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO.json","view_paper":"https://pith.science/paper/ZWKQH4MW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.2257&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWKQH4MW2FATCSDTSJZ34S6JBO/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWKQH4MW2FATCSDTSJZ34S6JBO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/action/storage_attestation","attest_author":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/action/author_attestation","sign_citation":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/action/citation_signature","submit_replication":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/action/replication_record"}},"created_at":"2026-05-18T04:31:43.256990+00:00","updated_at":"2026-05-18T04:31:43.256990+00:00"}