{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LHWMUJK7GPXW73CZRXZP4UPE4G","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":"67e5f9ffba6f29606ed66a6b8c277b23a318af3a4469f45510edbbd24e6de6a5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T13:21:04Z","title_canon_sha256":"9ac3c4aac2d4746cf09c8ddc74150df1230ac14d358bf429be355092a694748b"},"schema_version":"1.0","source":{"id":"1001.3053","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3053","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3053v4","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3053","created_at":"2026-05-18T04:01:26Z"},{"alias_kind":"pith_short_12","alias_value":"LHWMUJK7GPXW","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LHWMUJK7GPXW73CZ","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LHWMUJK7","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:5f8d4770d2eb41c0f930aecd6987352f2f8244c88e783038ba15d71a00d61023","target":"graph","created_at":"2026-05-18T04:01:26Z","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"},"paper":{"abstract_excerpt":"Given a weighted graph $G_\\bx$, where $(x(v): v \\in V)$ is a non-negative, real-valued weight assigned to the vertices of G, let $B(G_\\bx)$ be an upper bound on the fractional chromatic number of the weighted graph $G_\\bx$; so $\\chi_f(G_\\bx) \\le B(G_\\bx)$. To investigate the worst-case performance of the upper bound $B$, we study the graph invariant $$\\beta(G) = \\sup_{\\bx \\ne 0} \\frac{B(G_\\bx)}{\\chi_f(G_\\bx)}.$$\n  \\noindent This invariant is examined for various upper bounds $B$ on the fractional chromatic number. In some important cases, this graph invariant is shown to be related to the size","authors_text":"Ashwin Ganesan","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T13:21:04Z","title":"On some upper bounds on the fractional chromatic number of weighted graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3053","kind":"arxiv","version":4},"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:89bb4f38a4a409cd8909bda3770938707a7adb3ae82578b5cdb2e2eb1772c65c","target":"record","created_at":"2026-05-18T04:01:26Z","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":"67e5f9ffba6f29606ed66a6b8c277b23a318af3a4469f45510edbbd24e6de6a5","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-01-18T13:21:04Z","title_canon_sha256":"9ac3c4aac2d4746cf09c8ddc74150df1230ac14d358bf429be355092a694748b"},"schema_version":"1.0","source":{"id":"1001.3053","kind":"arxiv","version":4}},"canonical_sha256":"59ecca255f33ef6fec598df2fe51e4e1b3939cf436517fd932c7289ebb38f785","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59ecca255f33ef6fec598df2fe51e4e1b3939cf436517fd932c7289ebb38f785","first_computed_at":"2026-05-18T04:01:26.629058Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:26.629058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"05dss0S7Bf81lDCKRgGEHK2ShCc8Vb7zXGuHD3h0biaWaKWTtDK0om+Rl+Y9DvWX5o2nlfweX/61Q34j9mq0BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:26.629576Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3053","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:89bb4f38a4a409cd8909bda3770938707a7adb3ae82578b5cdb2e2eb1772c65c","sha256:5f8d4770d2eb41c0f930aecd6987352f2f8244c88e783038ba15d71a00d61023"],"state_sha256":"5421a17d005bb273ee3c6ee2905039787a4d04772c775236aa3cdb96e84632a2"}