{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:NSN5VP6JXKC4F4BNVNTFIQHZ65","short_pith_number":"pith:NSN5VP6J","schema_version":"1.0","canonical_sha256":"6c9bdabfc9ba85c2f02dab665440f9f75dda6465271ef7aa366fa3da8a648a23","source":{"kind":"arxiv","id":"1101.1947","version":2},"attestation_state":"computed","paper":{"title":"Reducts of the random bipartite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Yun Lu","submitted_at":"2011-01-10T20:46:40Z","abstract_excerpt":"Let $\\Gamma$ be the random bipartite graph, a countable graph with two infinite sides, edges randomly distributed between the sides, but no edges within a side. In this paper, we investigate the reducts of $\\Gamma$ that preserve sides. We classify the closed permutation subgroups containing the group $Aut(\\Gamma)^*$, where $Aut(\\Gamma)^*$ is the group of all isomorphisms and anti-isomorphisms of $\\Gamma$ preserving the two sides. Our results rely on a combinatorial theorem of Ne\\v{s}et\\v{r}il-R\\\"{o}dl and a strong finite submodel property for $\\Gamma$."},"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.1947","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-01-10T20:46:40Z","cross_cats_sorted":[],"title_canon_sha256":"e4fbf1b6b7b05b02d061c0dbea088987358c211ad99bf04001c332e976abaf5f","abstract_canon_sha256":"322347ed70b9095172271889792e0d0b7111abae2d623fa20cb0d1422b33dade"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:05.901862Z","signature_b64":"giJ/EX7xMcmdNsQgWMzo0NTVUDjDy8OAu6l1F456aY2jJ3mFjvwjEuKA/2LR3Rwy3odm3YgInxLg0NalkAS2BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c9bdabfc9ba85c2f02dab665440f9f75dda6465271ef7aa366fa3da8a648a23","last_reissued_at":"2026-05-18T01:21:05.901247Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:05.901247Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reducts of the random bipartite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Yun Lu","submitted_at":"2011-01-10T20:46:40Z","abstract_excerpt":"Let $\\Gamma$ be the random bipartite graph, a countable graph with two infinite sides, edges randomly distributed between the sides, but no edges within a side. In this paper, we investigate the reducts of $\\Gamma$ that preserve sides. We classify the closed permutation subgroups containing the group $Aut(\\Gamma)^*$, where $Aut(\\Gamma)^*$ is the group of all isomorphisms and anti-isomorphisms of $\\Gamma$ preserving the two sides. Our results rely on a combinatorial theorem of Ne\\v{s}et\\v{r}il-R\\\"{o}dl and a strong finite submodel property for $\\Gamma$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.1947","kind":"arxiv","version":2},"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.1947","created_at":"2026-05-18T01:21:05.901361+00:00"},{"alias_kind":"arxiv_version","alias_value":"1101.1947v2","created_at":"2026-05-18T01:21:05.901361+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.1947","created_at":"2026-05-18T01:21:05.901361+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSN5VP6JXKC4","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSN5VP6JXKC4F4BN","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSN5VP6J","created_at":"2026-05-18T12:26:37.096874+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/NSN5VP6JXKC4F4BNVNTFIQHZ65","json":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65.json","graph_json":"https://pith.science/api/pith-number/NSN5VP6JXKC4F4BNVNTFIQHZ65/graph.json","events_json":"https://pith.science/api/pith-number/NSN5VP6JXKC4F4BNVNTFIQHZ65/events.json","paper":"https://pith.science/paper/NSN5VP6J"},"agent_actions":{"view_html":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65","download_json":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65.json","view_paper":"https://pith.science/paper/NSN5VP6J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1101.1947&json=true","fetch_graph":"https://pith.science/api/pith-number/NSN5VP6JXKC4F4BNVNTFIQHZ65/graph.json","fetch_events":"https://pith.science/api/pith-number/NSN5VP6JXKC4F4BNVNTFIQHZ65/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65/action/storage_attestation","attest_author":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65/action/author_attestation","sign_citation":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65/action/citation_signature","submit_replication":"https://pith.science/pith/NSN5VP6JXKC4F4BNVNTFIQHZ65/action/replication_record"}},"created_at":"2026-05-18T01:21:05.901361+00:00","updated_at":"2026-05-18T01:21:05.901361+00:00"}