{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:WX3ZPH4776GA5LC4STFUMHXWY6","short_pith_number":"pith:WX3ZPH47","canonical_record":{"source":{"id":"1110.2391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-11T14:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"0bf815b760b0c280099ea66f01bd9d4fa98a4ccba9562346dc9297aa72151c04","abstract_canon_sha256":"5d00af116b68af3bc6e0b4aff2e2a4a56d49c63dcc6773eae0d9dfd6acc5aaae"},"schema_version":"1.0"},"canonical_sha256":"b5f7979f9fff8c0eac5c94cb461ef6c78f702768d345dda6cfa2282d3590e4b0","source":{"kind":"arxiv","id":"1110.2391","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:WX3ZPH4776GA5LC4STFUMHXWY6","target":"record","payload":{"canonical_record":{"source":{"id":"1110.2391","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-10-11T14:45:47Z","cross_cats_sorted":[],"title_canon_sha256":"0bf815b760b0c280099ea66f01bd9d4fa98a4ccba9562346dc9297aa72151c04","abstract_canon_sha256":"5d00af116b68af3bc6e0b4aff2e2a4a56d49c63dcc6773eae0d9dfd6acc5aaae"},"schema_version":"1.0"},"canonical_sha256":"b5f7979f9fff8c0eac5c94cb461ef6c78f702768d345dda6cfa2282d3590e4b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:02.534505Z","signature_b64":"WuinLZlxWDSlsXnV8872GD6i7IUWwGSZ7FVvws+b1jloUNlHDXJ1HKWYELAOQnpOJ5IYe9K/1uIzQ3JTzYz0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5f7979f9fff8c0eac5c94cb461ef6c78f702768d345dda6cfa2282d3590e4b0","last_reissued_at":"2026-05-18T03:41:02.533839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:02.533839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1110.2391","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-05-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2N4at20F68QOELD9ME8uH11yFe4Ejaf3ZimdERRsV2+QftclzlIe3BaI+2w5bH/TG42gRASqdJwSlWVDPJSFBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:41:43.635721Z"},"content_sha256":"5502d86bcc2b8d2aa1828e97bbc2125e88697a9ca00c9db24454d74acf41c84d","schema_version":"1.0","event_id":"sha256:5502d86bcc2b8d2aa1828e97bbc2125e88697a9ca00c9db24454d74acf41c84d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:WX3ZPH4776GA5LC4STFUMHXWY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the density of nearly regular graphs with a good edge-labelling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abbas Mehrabian","submitted_at":"2011-10-11T14:45:47Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1110.2391","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"},"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-05-18T03:41:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tb1kJ02+vrs3usiXf0S3/ZTxxceDIKjeT/x06Jn+t8afseeohAJqVhO0oPtiCEXSU+OlV1oX7iWAsTJRNS5iBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T07:41:43.636470Z"},"content_sha256":"7026f991d8f4afdd2c1ba967d09cdb2824e6a2a8125ca03fee790be599dd523a","schema_version":"1.0","event_id":"sha256:7026f991d8f4afdd2c1ba967d09cdb2824e6a2a8125ca03fee790be599dd523a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WX3ZPH4776GA5LC4STFUMHXWY6/bundle.json","state_url":"https://pith.science/pith/WX3ZPH4776GA5LC4STFUMHXWY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WX3ZPH4776GA5LC4STFUMHXWY6/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-06-09T07:41:43Z","links":{"resolver":"https://pith.science/pith/WX3ZPH4776GA5LC4STFUMHXWY6","bundle":"https://pith.science/pith/WX3ZPH4776GA5LC4STFUMHXWY6/bundle.json","state":"https://pith.science/pith/WX3ZPH4776GA5LC4STFUMHXWY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WX3ZPH4776GA5LC4STFUMHXWY6/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dZNOPblEPsMxU+q7580QRNTlPKjQD0Eh8wINlHYkHumdZk7GZlCCFgOWNDwlOvy2Xedh8Dm7lZ/1V9nMEH0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T07:41:43.640133Z","bundle_sha256":"552fc7b93e3931e6ad54a43004515a19ed18dd31a9359f7eeb59f8ee5767794e"}}