{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:TOKES26BA6SRVT5RICXTF5L5KY","short_pith_number":"pith:TOKES26B","schema_version":"1.0","canonical_sha256":"9b94496bc107a51acfb140af32f57d561b00ebd8a7bb39e703147b143071c42d","source":{"kind":"arxiv","id":"1109.1125","version":3},"attestation_state":"computed","paper":{"title":"Good edge-labelings and graphs with girth at least five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Babak Farzad, Dirk Oliver Theis, Michel Bode","submitted_at":"2011-09-06T09:34:06Z","abstract_excerpt":"A good edge-labeling of a graph [Ara\\'ujo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there exist two non-decreasing paths.\n  In this paper, we study edge-labeling on graphs with girth at least 5. In particular we verify, under this additional hypothesis, a conjecture by Ara\\'ujo et al. This conjecture states that if the average degree of G is less than 3 and G is minimal without an edge-labeling, then G \\in {C_3,K_{2,3}}. (For the case when the girth is 4, we give a counterexample.)"},"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":"1109.1125","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-06T09:34:06Z","cross_cats_sorted":[],"title_canon_sha256":"aa48e43cc9d6e8aebcdca510563a0547efc5fbbb12654dc7889f5d5b9120a6b1","abstract_canon_sha256":"9fb2c8ceeff744eb74fd69fc23e0da312d18c8ab77d77f91aad0e11b92627740"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:59.851943Z","signature_b64":"CuL/f7zURS66r0JCt/fPFmCKj/pgLBOtsenozgnHKm0PQHWIR53aKR1mgF+lEVC4BKCV09xd8huOlI/CNv7cAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b94496bc107a51acfb140af32f57d561b00ebd8a7bb39e703147b143071c42d","last_reissued_at":"2026-05-18T03:49:59.851166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:59.851166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good edge-labelings and graphs with girth at least five","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Babak Farzad, Dirk Oliver Theis, Michel Bode","submitted_at":"2011-09-06T09:34:06Z","abstract_excerpt":"A good edge-labeling of a graph [Ara\\'ujo, Cohen, Giroire, Havet, Discrete Appl. Math., forthcoming] is an assignment of numbers to the edges such that for no pair of vertices, there exist two non-decreasing paths.\n  In this paper, we study edge-labeling on graphs with girth at least 5. In particular we verify, under this additional hypothesis, a conjecture by Ara\\'ujo et al. This conjecture states that if the average degree of G is less than 3 and G is minimal without an edge-labeling, then G \\in {C_3,K_{2,3}}. (For the case when the girth is 4, we give a counterexample.)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.1125","kind":"arxiv","version":3},"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":"1109.1125","created_at":"2026-05-18T03:49:59.851267+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.1125v3","created_at":"2026-05-18T03:49:59.851267+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.1125","created_at":"2026-05-18T03:49:59.851267+00:00"},{"alias_kind":"pith_short_12","alias_value":"TOKES26BA6SR","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_16","alias_value":"TOKES26BA6SRVT5R","created_at":"2026-05-18T12:26:42.757692+00:00"},{"alias_kind":"pith_short_8","alias_value":"TOKES26B","created_at":"2026-05-18T12:26:42.757692+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/TOKES26BA6SRVT5RICXTF5L5KY","json":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY.json","graph_json":"https://pith.science/api/pith-number/TOKES26BA6SRVT5RICXTF5L5KY/graph.json","events_json":"https://pith.science/api/pith-number/TOKES26BA6SRVT5RICXTF5L5KY/events.json","paper":"https://pith.science/paper/TOKES26B"},"agent_actions":{"view_html":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY","download_json":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY.json","view_paper":"https://pith.science/paper/TOKES26B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.1125&json=true","fetch_graph":"https://pith.science/api/pith-number/TOKES26BA6SRVT5RICXTF5L5KY/graph.json","fetch_events":"https://pith.science/api/pith-number/TOKES26BA6SRVT5RICXTF5L5KY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY/action/storage_attestation","attest_author":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY/action/author_attestation","sign_citation":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY/action/citation_signature","submit_replication":"https://pith.science/pith/TOKES26BA6SRVT5RICXTF5L5KY/action/replication_record"}},"created_at":"2026-05-18T03:49:59.851267+00:00","updated_at":"2026-05-18T03:49:59.851267+00:00"}