{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZHQ7PBVZJYX4RNONQE72XZRHZX","short_pith_number":"pith:ZHQ7PBVZ","schema_version":"1.0","canonical_sha256":"c9e1f786b94e2fc8b5cd813fabe627cddb68b15ffb4d9e4bc297a4644dfe7a91","source":{"kind":"arxiv","id":"2606.28797","version":1},"attestation_state":"computed","paper":{"title":"An Improved Upper Bound for the Bilu-Linial Conjecture via Interlacing Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinyue Zhang, Zhiqiang Xu","submitted_at":"2026-06-27T08:09:09Z","abstract_excerpt":"The Bilu-Linial conjecture asserts that every $d$-regular graph admits a signing $\\sigma$ such that the spectral radius of the signed adjacency matrix $A_\\sigma$ satisfies $\\rho(A_\\sigma)\\le 2\\sqrt{d-1}$. Bilu and Linial also proved the weaker bound $O(\\sqrt{d\\log^3 d})$ for graphs of maximum degree $d$. Marcus, Spielman, and Srivastava confirmed the conjecture in the case of $d$-regular bipartite graphs. In this paper, we prove that every graph of maximum degree $d$ has a signing $\\sigma$ such that $$\\rho(A_\\sigma)\\le 2\\sqrt{3(d-1)}.$$ This removes the polylogarithmic factor from the estimate"},"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":"2606.28797","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T08:09:09Z","cross_cats_sorted":[],"title_canon_sha256":"6213ea6680274c0217676de5b75623fe3165da87d82e35adfb3fbcc489961968","abstract_canon_sha256":"adabe46394b1cc0883a93553abd33a0c58dc9dc4028a6dadf9f6b2bb8844ac17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T01:16:52.370216Z","signature_b64":"XoWoRfWIKvXyVYghGlfOeiVsQU/WuujBScA02z6PXeKMAsh4k3JIFQ5Rd5mfeWKI8nnZ4fFD9LxxaHdkYgvJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c9e1f786b94e2fc8b5cd813fabe627cddb68b15ffb4d9e4bc297a4644dfe7a91","last_reissued_at":"2026-06-30T01:16:52.369680Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T01:16:52.369680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Upper Bound for the Bilu-Linial Conjecture via Interlacing Families","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xinyue Zhang, Zhiqiang Xu","submitted_at":"2026-06-27T08:09:09Z","abstract_excerpt":"The Bilu-Linial conjecture asserts that every $d$-regular graph admits a signing $\\sigma$ such that the spectral radius of the signed adjacency matrix $A_\\sigma$ satisfies $\\rho(A_\\sigma)\\le 2\\sqrt{d-1}$. Bilu and Linial also proved the weaker bound $O(\\sqrt{d\\log^3 d})$ for graphs of maximum degree $d$. Marcus, Spielman, and Srivastava confirmed the conjecture in the case of $d$-regular bipartite graphs. In this paper, we prove that every graph of maximum degree $d$ has a signing $\\sigma$ such that $$\\rho(A_\\sigma)\\le 2\\sqrt{3(d-1)}.$$ This removes the polylogarithmic factor from the estimate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28797","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.28797/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.28797","created_at":"2026-06-30T01:16:52.369735+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.28797v1","created_at":"2026-06-30T01:16:52.369735+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28797","created_at":"2026-06-30T01:16:52.369735+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZHQ7PBVZJYX4","created_at":"2026-06-30T01:16:52.369735+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZHQ7PBVZJYX4RNON","created_at":"2026-06-30T01:16:52.369735+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZHQ7PBVZ","created_at":"2026-06-30T01:16:52.369735+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/ZHQ7PBVZJYX4RNONQE72XZRHZX","json":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX.json","graph_json":"https://pith.science/api/pith-number/ZHQ7PBVZJYX4RNONQE72XZRHZX/graph.json","events_json":"https://pith.science/api/pith-number/ZHQ7PBVZJYX4RNONQE72XZRHZX/events.json","paper":"https://pith.science/paper/ZHQ7PBVZ"},"agent_actions":{"view_html":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX","download_json":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX.json","view_paper":"https://pith.science/paper/ZHQ7PBVZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.28797&json=true","fetch_graph":"https://pith.science/api/pith-number/ZHQ7PBVZJYX4RNONQE72XZRHZX/graph.json","fetch_events":"https://pith.science/api/pith-number/ZHQ7PBVZJYX4RNONQE72XZRHZX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/action/storage_attestation","attest_author":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/action/author_attestation","sign_citation":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/action/citation_signature","submit_replication":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/action/replication_record"}},"created_at":"2026-06-30T01:16:52.369735+00:00","updated_at":"2026-06-30T01:16:52.369735+00:00"}