{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WX3ZPH4776GA5LC4STFUMHXWY6","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":"5d00af116b68af3bc6e0b4aff2e2a4a56d49c63dcc6773eae0d9dfd6acc5aaae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-11T14:45:47Z","title_canon_sha256":"0bf815b760b0c280099ea66f01bd9d4fa98a4ccba9562346dc9297aa72151c04"},"schema_version":"1.0","source":{"id":"1110.2391","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1110.2391","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"arxiv_version","alias_value":"1110.2391v1","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1110.2391","created_at":"2026-05-18T03:41:02Z"},{"alias_kind":"pith_short_12","alias_value":"WX3ZPH4776GA","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WX3ZPH4776GA5LC4","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WX3ZPH47","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:7026f991d8f4afdd2c1ba967d09cdb2824e6a2a8125ca03fee790be599dd523a","target":"graph","created_at":"2026-05-18T03:41:02Z","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 graph is a labelling of its edges with real numbers such that, for any ordered pair of vertices (u,v), there is at most one nondecreasing path from u to v. Say a graph is good if it admits a good edge-labelling, and is bad otherwise. Our main result is that any good n-vertex graph whose maximum degree is within a constant factor of its average degree (in particular, any good regular graph) has at most n^{1+o(1)} edges. As a corollary, we show that there are bad graphs with arbitrarily large girth, answering a question of Bode, Farzad and Theis. We also prove t","authors_text":"Abbas Mehrabian","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-11T14:45:47Z","title":"On the density of nearly regular graphs with a good edge-labelling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2391","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:5502d86bcc2b8d2aa1828e97bbc2125e88697a9ca00c9db24454d74acf41c84d","target":"record","created_at":"2026-05-18T03:41:02Z","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":"5d00af116b68af3bc6e0b4aff2e2a4a56d49c63dcc6773eae0d9dfd6acc5aaae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-11T14:45:47Z","title_canon_sha256":"0bf815b760b0c280099ea66f01bd9d4fa98a4ccba9562346dc9297aa72151c04"},"schema_version":"1.0","source":{"id":"1110.2391","kind":"arxiv","version":1}},"canonical_sha256":"b5f7979f9fff8c0eac5c94cb461ef6c78f702768d345dda6cfa2282d3590e4b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5f7979f9fff8c0eac5c94cb461ef6c78f702768d345dda6cfa2282d3590e4b0","first_computed_at":"2026-05-18T03:41:02.533839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:02.533839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WuinLZlxWDSlsXnV8872GD6i7IUWwGSZ7FVvws+b1jloUNlHDXJ1HKWYELAOQnpOJ5IYe9K/1uIzQ3JTzYz0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:02.534505Z","signed_message":"canonical_sha256_bytes"},"source_id":"1110.2391","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5502d86bcc2b8d2aa1828e97bbc2125e88697a9ca00c9db24454d74acf41c84d","sha256:7026f991d8f4afdd2c1ba967d09cdb2824e6a2a8125ca03fee790be599dd523a"],"state_sha256":"97b008f9fb82a11e676cf4be422aeda4069dceafaf444153eedbb538b0b04936"}