{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SJLGDAEJUJFPUS7ZVDJOQOZH4Q","short_pith_number":"pith:SJLGDAEJ","schema_version":"1.0","canonical_sha256":"9256618089a24afa4bf9a8d2e83b27e410f46e7c4dba048f34df930b01b4d791","source":{"kind":"arxiv","id":"1701.07162","version":1},"attestation_state":"computed","paper":{"title":"On problems about judicious bipartitions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Juan Yan, Xingxing Yu, Yuliang Ji","submitted_at":"2017-01-25T05:03:42Z","abstract_excerpt":"Bollob\\'{a}s and Scott [5] conjectured that every graph $G$ has a balanced bipartite spanning subgraph $H$ such that for each $v\\in V(G)$, $d_H(v)\\ge (d_G(v)-1)/2$. In this paper, we show that every graphic sequence has a realization for which this Bollob\\'{a}s-Scott conjecture holds, confirming a conjecture of Hartke and Seacrest [10]. On the other hand, we give an infinite family of counterexamples to this Bollob\\'{a}s-Scott conjecture, which indicates that $\\lfloor (d_G(v)-1)/2\\rfloor$ (rather than $(d_G(v)-1)/2$) is probably the correct lower bound. We also study bipartitions $V_1, V_2$ of"},"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":"1701.07162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-25T05:03:42Z","cross_cats_sorted":[],"title_canon_sha256":"1f74cf8322c0e2e38ef8172505ce74b61d9d93c2ed8fad02527f48c2e2abcc8f","abstract_canon_sha256":"7742545cadc9e7a1bb342f4b9445bb9f6072f49fb29ba38c891464a0e597c18b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:07.291070Z","signature_b64":"YyjnP3Hyb6qT8/wmySc7pdI2w/J8byLtigemwvYzEOIH28k4rvBOwIHGbbcFT7+M4YWMaMfZ+XfCMhhQ3UxdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9256618089a24afa4bf9a8d2e83b27e410f46e7c4dba048f34df930b01b4d791","last_reissued_at":"2026-05-18T00:52:07.290296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:07.290296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On problems about judicious bipartitions of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Juan Yan, Xingxing Yu, Yuliang Ji","submitted_at":"2017-01-25T05:03:42Z","abstract_excerpt":"Bollob\\'{a}s and Scott [5] conjectured that every graph $G$ has a balanced bipartite spanning subgraph $H$ such that for each $v\\in V(G)$, $d_H(v)\\ge (d_G(v)-1)/2$. In this paper, we show that every graphic sequence has a realization for which this Bollob\\'{a}s-Scott conjecture holds, confirming a conjecture of Hartke and Seacrest [10]. On the other hand, we give an infinite family of counterexamples to this Bollob\\'{a}s-Scott conjecture, which indicates that $\\lfloor (d_G(v)-1)/2\\rfloor$ (rather than $(d_G(v)-1)/2$) is probably the correct lower bound. We also study bipartitions $V_1, V_2$ of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.07162","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":"1701.07162","created_at":"2026-05-18T00:52:07.290427+00:00"},{"alias_kind":"arxiv_version","alias_value":"1701.07162v1","created_at":"2026-05-18T00:52:07.290427+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.07162","created_at":"2026-05-18T00:52:07.290427+00:00"},{"alias_kind":"pith_short_12","alias_value":"SJLGDAEJUJFP","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SJLGDAEJUJFPUS7Z","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SJLGDAEJ","created_at":"2026-05-18T12:31:43.269735+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/SJLGDAEJUJFPUS7ZVDJOQOZH4Q","json":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q.json","graph_json":"https://pith.science/api/pith-number/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/graph.json","events_json":"https://pith.science/api/pith-number/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/events.json","paper":"https://pith.science/paper/SJLGDAEJ"},"agent_actions":{"view_html":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q","download_json":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q.json","view_paper":"https://pith.science/paper/SJLGDAEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1701.07162&json=true","fetch_graph":"https://pith.science/api/pith-number/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/graph.json","fetch_events":"https://pith.science/api/pith-number/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/action/storage_attestation","attest_author":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/action/author_attestation","sign_citation":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/action/citation_signature","submit_replication":"https://pith.science/pith/SJLGDAEJUJFPUS7ZVDJOQOZH4Q/action/replication_record"}},"created_at":"2026-05-18T00:52:07.290427+00:00","updated_at":"2026-05-18T00:52:07.290427+00:00"}