{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FSF7XQFNBXDLYYC57RYKQUSIO6","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":"d6bcbffabea8b04216973ee54714f2255788a3e0e57fb35b55bf86aa35fc34cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-12T14:42:18Z","title_canon_sha256":"d8675b481e12c52c403104dfd3798b97da3ab21e7263eed97d0edbed8b187349"},"schema_version":"1.0","source":{"id":"1211.2641","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.2641","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"arxiv_version","alias_value":"1211.2641v1","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.2641","created_at":"2026-05-18T02:56:19Z"},{"alias_kind":"pith_short_12","alias_value":"FSF7XQFNBXDL","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FSF7XQFNBXDLYYC5","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FSF7XQFN","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:36843d4a2323112561c6c05a9776e41ec4bcceaa60769dbdd6583b5b367d2f72","target":"graph","created_at":"2026-05-18T02:56:19Z","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":"A good edge-labelling of a simple, finite graph is a labelling of its edges with real numbers such that, for every ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. In this paper we prove that any graph on n vertices that admits a good edge-labelling has at most n log_2(n)/2 edges, and that this bound is tight for infinitely many values of n. Thus we significantly improve on the previously best known bounds. The main tool of the proof is a combinatorial lemma which might be of independent interest. For every n we also construct an n-vertex graph that admits a","authors_text":"Abbas Mehrabian, Dieter Mitsche, Pawe{\\l} Pra{\\l}at","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-12T14:42:18Z","title":"On the Maximum Density of Graphs with Good Edge-Labellings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.2641","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:d186e20a569f1cee597c36d036c2441c54c94e597a8b301d43b4a5856190ca06","target":"record","created_at":"2026-05-18T02:56:19Z","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":"d6bcbffabea8b04216973ee54714f2255788a3e0e57fb35b55bf86aa35fc34cd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-11-12T14:42:18Z","title_canon_sha256":"d8675b481e12c52c403104dfd3798b97da3ab21e7263eed97d0edbed8b187349"},"schema_version":"1.0","source":{"id":"1211.2641","kind":"arxiv","version":1}},"canonical_sha256":"2c8bfbc0ad0dc6bc605dfc70a85248779e487003ce4d509c86a457d0f6d0e47a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c8bfbc0ad0dc6bc605dfc70a85248779e487003ce4d509c86a457d0f6d0e47a","first_computed_at":"2026-05-18T02:56:19.313830Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:19.313830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"825gZgJmzXzdvW7muOufVi+dO1Tc7FSEzVe0ZdztQOyWvu5sG4dDyOev0JEqQfKyDtptRZDNJLNJQz2JcsJYCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:19.314501Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.2641","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d186e20a569f1cee597c36d036c2441c54c94e597a8b301d43b4a5856190ca06","sha256:36843d4a2323112561c6c05a9776e41ec4bcceaa60769dbdd6583b5b367d2f72"],"state_sha256":"9012b9195409be4cecd15bdab20c56faa33a829e47bfed25d2e43e5b48b53a7b"}