{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:I37QP66T7TYPHHF6J3IBA72MYT","short_pith_number":"pith:I37QP66T","schema_version":"1.0","canonical_sha256":"46ff07fbd3fcf0f39cbe4ed0107f4cc4d3a081af5920cae99204ef2b356884c7","source":{"kind":"arxiv","id":"1906.05368","version":1},"attestation_state":"computed","paper":{"title":"Brouwer's conjecture holds asymptotically almost surely","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Israel Rocha","submitted_at":"2019-06-12T20:29:11Z","abstract_excerpt":"We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs with possible negative weights as well. For graphs with a fixed number of vertices, the result implies that there are constants $C>0$ and $n_{0}$ such that if $n\\geq n_{0}$ then among all $2^{{n \\choose 2}}$ graphs with $n$ vertices, at least $\\left(1-\\exp\\left(-Cn\\right)\\right)2^{{n \\choose 2}}$ graphs satisfy Brouwer's conjecture."},"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":"1906.05368","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-12T20:29:11Z","cross_cats_sorted":[],"title_canon_sha256":"ab7cea449516b6fabf24bf78e04653f28c781a93cd5a6f38987d938196b1c299","abstract_canon_sha256":"970e079aca5a858fc7c97137960b199342d37d5460202aaf98f6a787725ced5e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:25.463372Z","signature_b64":"jw2f8x8gXkWn2I/HKfBn29ILXwGxH2dnNVLfBNM0xhle/mXaXZctjqpyUzljA9wlf+1DxnLlUQe5v9YL6+4EDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46ff07fbd3fcf0f39cbe4ed0107f4cc4d3a081af5920cae99204ef2b356884c7","last_reissued_at":"2026-05-17T23:43:25.462843Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:25.462843Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Brouwer's conjecture holds asymptotically almost surely","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Israel Rocha","submitted_at":"2019-06-12T20:29:11Z","abstract_excerpt":"We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs with possible negative weights as well. For graphs with a fixed number of vertices, the result implies that there are constants $C>0$ and $n_{0}$ such that if $n\\geq n_{0}$ then among all $2^{{n \\choose 2}}$ graphs with $n$ vertices, at least $\\left(1-\\exp\\left(-Cn\\right)\\right)2^{{n \\choose 2}}$ graphs satisfy Brouwer's conjecture."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05368","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":"1906.05368","created_at":"2026-05-17T23:43:25.462921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.05368v1","created_at":"2026-05-17T23:43:25.462921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05368","created_at":"2026-05-17T23:43:25.462921+00:00"},{"alias_kind":"pith_short_12","alias_value":"I37QP66T7TYP","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"I37QP66T7TYPHHF6","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"I37QP66T","created_at":"2026-05-18T12:33:18.533446+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/I37QP66T7TYPHHF6J3IBA72MYT","json":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT.json","graph_json":"https://pith.science/api/pith-number/I37QP66T7TYPHHF6J3IBA72MYT/graph.json","events_json":"https://pith.science/api/pith-number/I37QP66T7TYPHHF6J3IBA72MYT/events.json","paper":"https://pith.science/paper/I37QP66T"},"agent_actions":{"view_html":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT","download_json":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT.json","view_paper":"https://pith.science/paper/I37QP66T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.05368&json=true","fetch_graph":"https://pith.science/api/pith-number/I37QP66T7TYPHHF6J3IBA72MYT/graph.json","fetch_events":"https://pith.science/api/pith-number/I37QP66T7TYPHHF6J3IBA72MYT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT/action/storage_attestation","attest_author":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT/action/author_attestation","sign_citation":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT/action/citation_signature","submit_replication":"https://pith.science/pith/I37QP66T7TYPHHF6J3IBA72MYT/action/replication_record"}},"created_at":"2026-05-17T23:43:25.462921+00:00","updated_at":"2026-05-17T23:43:25.462921+00:00"}