{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZWKQH4MW2FATCSDTSJZ34S6JBO","short_pith_number":"pith:ZWKQH4MW","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"},"canonical_sha256":"cd9503f196d1413148739273be4bc90b8084c95da2e750fea7b6c576ae560983","source":{"kind":"arxiv","id":"1101.2257","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2257","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2257v1","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2257","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZWKQH4MW2FAT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZWKQH4MW2FATCSDT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZWKQH4MW","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZWKQH4MW2FATCSDTSJZ34S6JBO","target":"record","payload":{"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"},"canonical_sha256":"cd9503f196d1413148739273be4bc90b8084c95da2e750fea7b6c576ae560983","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"},"source_kind":"arxiv","source_id":"1101.2257","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGjSyACTZ7GTLvSpwIat8lFaAqogyHWwz5ikU/FKpJ+slVCZavWtim2/Qhhks7iIu62bvnGYUkfhnQbkC9zwDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:44:54.780071Z"},"content_sha256":"80a84570f05286b620397411be80088f7333fad48e05f76b0de4ac6f36783454","schema_version":"1.0","event_id":"sha256:80a84570f05286b620397411be80088f7333fad48e05f76b0de4ac6f36783454"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZWKQH4MW2FATCSDTSJZ34S6JBO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T04:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1SfuaI2CfW5ujP0y0Z51NrPmp+JH0FviuyVHBwOfjpSoaGVuyd3Ma7+npErccBv7JU9rDczNcg+vFQnqlvCqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T17:44:54.780447Z"},"content_sha256":"e5592703c09a2bcf1f31ee8ea544c70a6c9ac742c1ce7a04ac152b10a06654e3","schema_version":"1.0","event_id":"sha256:e5592703c09a2bcf1f31ee8ea544c70a6c9ac742c1ce7a04ac152b10a06654e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/bundle.json","state_url":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T17:44:54Z","links":{"resolver":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO","bundle":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/bundle.json","state":"https://pith.science/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZWKQH4MW2FATCSDTSJZ34S6JBO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZWKQH4MW2FATCSDTSJZ34S6JBO","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5bd16c491f823b52b80dc8153aba82ab1c74b6645d1a590786b2b5ce1b5e1780","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T02:18:21Z","title_canon_sha256":"8e1e0a4c65b44e9f87fff03ee3aedc72d0369a2cd25aeeedfb4a478cf6b8f983"},"schema_version":"1.0","source":{"id":"1101.2257","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2257","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2257v1","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2257","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"ZWKQH4MW2FAT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZWKQH4MW2FATCSDT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZWKQH4MW","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:e5592703c09a2bcf1f31ee8ea544c70a6c9ac742c1ce7a04ac152b10a06654e3","target":"graph","created_at":"2026-05-18T04:31:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Huajun Zhang, Jun Wang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T02:18:21Z","title":"Nontrivial independent sets of bipartite graphs and cross-intersecting families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2257","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:80a84570f05286b620397411be80088f7333fad48e05f76b0de4ac6f36783454","target":"record","created_at":"2026-05-18T04:31:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5bd16c491f823b52b80dc8153aba82ab1c74b6645d1a590786b2b5ce1b5e1780","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-01-12T02:18:21Z","title_canon_sha256":"8e1e0a4c65b44e9f87fff03ee3aedc72d0369a2cd25aeeedfb4a478cf6b8f983"},"schema_version":"1.0","source":{"id":"1101.2257","kind":"arxiv","version":1}},"canonical_sha256":"cd9503f196d1413148739273be4bc90b8084c95da2e750fea7b6c576ae560983","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd9503f196d1413148739273be4bc90b8084c95da2e750fea7b6c576ae560983","first_computed_at":"2026-05-18T04:31:43.256924Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:43.256924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AOMm1sjqz2I721QrXXSK468a7Qaiwp8uiQ0V/getKePmFM7hmdpJnaJMa9z9T7eq4U5qcdCpF+C407NVT0t5Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:43.257386Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2257","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:80a84570f05286b620397411be80088f7333fad48e05f76b0de4ac6f36783454","sha256:e5592703c09a2bcf1f31ee8ea544c70a6c9ac742c1ce7a04ac152b10a06654e3"],"state_sha256":"9af8587f54d13d71b209d6485361ac62dee9abc86a670f369d76b8864693cd05"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KYXSUtiz8m245Mm0LZtinUrSfv6R5s+tkFjZuzX9R9ggOwZSkgiesBTiwoIJ0ILan+SU2Yk4ak/oUIz9n7lsCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T17:44:54.782826Z","bundle_sha256":"596ea578eebae8136ae25b10bfd2d1613497f72f83637b816796356a4e38794c"}}