{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:3BVUA5VBD5SY6JIHGJ4N6RCORX","short_pith_number":"pith:3BVUA5VB","schema_version":"1.0","canonical_sha256":"d86b4076a11f658f25073278df444e8dd281fe52399fb36e64dd3093fa26176a","source":{"kind":"arxiv","id":"1809.10342","version":1},"attestation_state":"computed","paper":{"title":"Maximizing spectral radius and number of spanning trees in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ravindra Bapat","submitted_at":"2018-09-27T04:54:15Z","abstract_excerpt":"The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph. Known results towards the resolution of the conjectures are described. We give yet another proof of a formula due to Ehrenborg and van Willigenburg for the number of spanning trees in a Ferrers graph. The main tool is a result which gives several necessary and sufficient conditions under which the removal of an edge in a graph does not affect the resistance dis"},"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":"1809.10342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-09-27T04:54:15Z","cross_cats_sorted":[],"title_canon_sha256":"98e43d61fec75e5f86e2e17c16623f94378db312faeaed89aa8ce7ac20be7ae8","abstract_canon_sha256":"297f0f9d390f066c594b83b7839b4b8d61fe82520e8097d2b4baf94b5aeb138d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:38.574710Z","signature_b64":"EnCa4nyxIM6Ci8gZOoQYiZbpJ11KsCmPDjl21VwskBg2J1mk0pO6ElIUFwgqE48SHqIXFg8E1qboAwQKM24cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d86b4076a11f658f25073278df444e8dd281fe52399fb36e64dd3093fa26176a","last_reissued_at":"2026-05-18T00:04:38.574180Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:38.574180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximizing spectral radius and number of spanning trees in bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ravindra Bapat","submitted_at":"2018-09-27T04:54:15Z","abstract_excerpt":"The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph. Known results towards the resolution of the conjectures are described. We give yet another proof of a formula due to Ehrenborg and van Willigenburg for the number of spanning trees in a Ferrers graph. The main tool is a result which gives several necessary and sufficient conditions under which the removal of an edge in a graph does not affect the resistance dis"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.10342","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":"1809.10342","created_at":"2026-05-18T00:04:38.574259+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.10342v1","created_at":"2026-05-18T00:04:38.574259+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.10342","created_at":"2026-05-18T00:04:38.574259+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BVUA5VBD5SY","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BVUA5VBD5SY6JIH","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BVUA5VB","created_at":"2026-05-18T12:32:02.567920+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/3BVUA5VBD5SY6JIHGJ4N6RCORX","json":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX.json","graph_json":"https://pith.science/api/pith-number/3BVUA5VBD5SY6JIHGJ4N6RCORX/graph.json","events_json":"https://pith.science/api/pith-number/3BVUA5VBD5SY6JIHGJ4N6RCORX/events.json","paper":"https://pith.science/paper/3BVUA5VB"},"agent_actions":{"view_html":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX","download_json":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX.json","view_paper":"https://pith.science/paper/3BVUA5VB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.10342&json=true","fetch_graph":"https://pith.science/api/pith-number/3BVUA5VBD5SY6JIHGJ4N6RCORX/graph.json","fetch_events":"https://pith.science/api/pith-number/3BVUA5VBD5SY6JIHGJ4N6RCORX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX/action/storage_attestation","attest_author":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX/action/author_attestation","sign_citation":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX/action/citation_signature","submit_replication":"https://pith.science/pith/3BVUA5VBD5SY6JIHGJ4N6RCORX/action/replication_record"}},"created_at":"2026-05-18T00:04:38.574259+00:00","updated_at":"2026-05-18T00:04:38.574259+00:00"}