{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZHQ7PBVZJYX4RNONQE72XZRHZX","short_pith_number":"pith:ZHQ7PBVZ","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"},"canonical_sha256":"c9e1f786b94e2fc8b5cd813fabe627cddb68b15ffb4d9e4bc297a4644dfe7a91","source":{"kind":"arxiv","id":"2606.28797","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28797","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28797v1","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28797","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZHQ7PBVZJYX4","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZHQ7PBVZJYX4RNON","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZHQ7PBVZ","created_at":"2026-06-30T01:16:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZHQ7PBVZJYX4RNONQE72XZRHZX","target":"record","payload":{"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"},"canonical_sha256":"c9e1f786b94e2fc8b5cd813fabe627cddb68b15ffb4d9e4bc297a4644dfe7a91","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"},"source_kind":"arxiv","source_id":"2606.28797","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-06-30T01:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i9+37cAnZVs+jAn2Vgw+VcZmekizf2jgGOu2HChI9hoLjhnlxrBkIFvmYHSkRjdNlrYzAQDvLPcaiCoKZ2FPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:13:38.452016Z"},"content_sha256":"3a49da74c5d845932174e2e9c5f79ae4b87090e45097145d40be7202b61440ed","schema_version":"1.0","event_id":"sha256:3a49da74c5d845932174e2e9c5f79ae4b87090e45097145d40be7202b61440ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZHQ7PBVZJYX4RNONQE72XZRHZX","target":"graph","payload":{"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"},"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-06-30T01:16:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/y1wkzYZ4LP5MgXUK+KHhIsIWWwreC4cvfra3HmXsiqllbtkRwFINBwcsu3APZdoVsp1V4u0Db/ImptXMiMSCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T21:13:38.452609Z"},"content_sha256":"f6619d9c04e13898dc1661a336f7a9886f4ddad4e5ab8eee87b8f6e0bcd8e6b5","schema_version":"1.0","event_id":"sha256:f6619d9c04e13898dc1661a336f7a9886f4ddad4e5ab8eee87b8f6e0bcd8e6b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/bundle.json","state_url":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/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-08-11T21:13:38Z","links":{"resolver":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX","bundle":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/bundle.json","state":"https://pith.science/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZHQ7PBVZJYX4RNONQE72XZRHZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZHQ7PBVZJYX4RNONQE72XZRHZX","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":"adabe46394b1cc0883a93553abd33a0c58dc9dc4028a6dadf9f6b2bb8844ac17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T08:09:09Z","title_canon_sha256":"6213ea6680274c0217676de5b75623fe3165da87d82e35adfb3fbcc489961968"},"schema_version":"1.0","source":{"id":"2606.28797","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.28797","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"arxiv_version","alias_value":"2606.28797v1","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.28797","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"pith_short_12","alias_value":"ZHQ7PBVZJYX4","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"pith_short_16","alias_value":"ZHQ7PBVZJYX4RNON","created_at":"2026-06-30T01:16:52Z"},{"alias_kind":"pith_short_8","alias_value":"ZHQ7PBVZ","created_at":"2026-06-30T01:16:52Z"}],"graph_snapshots":[{"event_id":"sha256:f6619d9c04e13898dc1661a336f7a9886f4ddad4e5ab8eee87b8f6e0bcd8e6b5","target":"graph","created_at":"2026-06-30T01:16:52Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.28797/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Xinyue Zhang, Zhiqiang Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T08:09:09Z","title":"An Improved Upper Bound for the Bilu-Linial Conjecture via Interlacing Families"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.28797","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:3a49da74c5d845932174e2e9c5f79ae4b87090e45097145d40be7202b61440ed","target":"record","created_at":"2026-06-30T01:16:52Z","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":"adabe46394b1cc0883a93553abd33a0c58dc9dc4028a6dadf9f6b2bb8844ac17","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-27T08:09:09Z","title_canon_sha256":"6213ea6680274c0217676de5b75623fe3165da87d82e35adfb3fbcc489961968"},"schema_version":"1.0","source":{"id":"2606.28797","kind":"arxiv","version":1}},"canonical_sha256":"c9e1f786b94e2fc8b5cd813fabe627cddb68b15ffb4d9e4bc297a4644dfe7a91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c9e1f786b94e2fc8b5cd813fabe627cddb68b15ffb4d9e4bc297a4644dfe7a91","first_computed_at":"2026-06-30T01:16:52.369680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T01:16:52.369680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XoWoRfWIKvXyVYghGlfOeiVsQU/WuujBScA02z6PXeKMAsh4k3JIFQ5Rd5mfeWKI8nnZ4fFD9LxxaHdkYgvJBQ==","signature_status":"signed_v1","signed_at":"2026-06-30T01:16:52.370216Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.28797","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3a49da74c5d845932174e2e9c5f79ae4b87090e45097145d40be7202b61440ed","sha256:f6619d9c04e13898dc1661a336f7a9886f4ddad4e5ab8eee87b8f6e0bcd8e6b5"],"state_sha256":"49d500181fcbe9093b6bdc00ab7335ea6239888fc37a9e63b3c7c3794d7f585b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aYFtT8NKR1xh1J5KptB/Jfgeo4OWbFxr4M8+g+S3mUXf3to2AMx7YYLsouAJiKU+GHXXzWbNuSL+EnVLW+2XBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T21:13:38.458000Z","bundle_sha256":"b343deaccaeb738be2a42525b392b2a31c75498833bc0e057e51706c7df112f9"}}