{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WI3UGDGOG54CSH7REQOG5CO2EO","short_pith_number":"pith:WI3UGDGO","schema_version":"1.0","canonical_sha256":"b237430cce3778291ff1241c6e89da23b5925166ed0fb2c18c8e3920035762fd","source":{"kind":"arxiv","id":"1808.07351","version":2},"attestation_state":"computed","paper":{"title":"Long monotone trails in random edge-labelings of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Omer Angel, Vincent Tassion","submitted_at":"2018-08-22T13:43:00Z","abstract_excerpt":"Given a graph $G$ and a bijection $f : E(G)\\rightarrow \\{1, 2, \\ldots,e(G)\\}$, we say that a trail/path in $G$ is $f$-\\emph{increasing} if the labels of consecutive edges of this trail/path form an increasing sequence. More than 40 years ago Chv\\'atal and Koml\\'os raised the question of providing the worst-case estimates of the length of the longest increasing trail/path over all edge orderings of $K_n$. The case of a trail was resolved by Graham and Kleitman, who proved that the answer is $n-1$, and the case of a path is still widely open. Recently Lavrov and Loh proposed to study the average"},"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":"1808.07351","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-22T13:43:00Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"42de3e8759399558c2e85b1ad9ba8b1d677a25733568cbce64ea880cf2073817","abstract_canon_sha256":"7a8f7ceffcde7e1fd7ad21104bff4cf29068817cc70caa76ecf51e5062958be9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:22.506663Z","signature_b64":"nn1jEQJOD7PfcrSR0L693BmkVSTA0JTgHJTPLkb1ajIrDwVMAZwdlmvF24hj0GotG0bNDEbAhl31AFzS1iYJCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b237430cce3778291ff1241c6e89da23b5925166ed0fb2c18c8e3920035762fd","last_reissued_at":"2026-05-17T23:45:22.505921Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:22.505921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long monotone trails in random edge-labelings of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Benny Sudakov, Omer Angel, Vincent Tassion","submitted_at":"2018-08-22T13:43:00Z","abstract_excerpt":"Given a graph $G$ and a bijection $f : E(G)\\rightarrow \\{1, 2, \\ldots,e(G)\\}$, we say that a trail/path in $G$ is $f$-\\emph{increasing} if the labels of consecutive edges of this trail/path form an increasing sequence. More than 40 years ago Chv\\'atal and Koml\\'os raised the question of providing the worst-case estimates of the length of the longest increasing trail/path over all edge orderings of $K_n$. The case of a trail was resolved by Graham and Kleitman, who proved that the answer is $n-1$, and the case of a path is still widely open. Recently Lavrov and Loh proposed to study the average"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07351","kind":"arxiv","version":2},"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":"1808.07351","created_at":"2026-05-17T23:45:22.506036+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07351v2","created_at":"2026-05-17T23:45:22.506036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07351","created_at":"2026-05-17T23:45:22.506036+00:00"},{"alias_kind":"pith_short_12","alias_value":"WI3UGDGOG54C","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_16","alias_value":"WI3UGDGOG54CSH7R","created_at":"2026-05-18T12:32:59.047623+00:00"},{"alias_kind":"pith_short_8","alias_value":"WI3UGDGO","created_at":"2026-05-18T12:32:59.047623+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.11873","citing_title":"Maximizing Reachability via Shifting of Temporal Paths","ref_index":43,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO","json":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO.json","graph_json":"https://pith.science/api/pith-number/WI3UGDGOG54CSH7REQOG5CO2EO/graph.json","events_json":"https://pith.science/api/pith-number/WI3UGDGOG54CSH7REQOG5CO2EO/events.json","paper":"https://pith.science/paper/WI3UGDGO"},"agent_actions":{"view_html":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO","download_json":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO.json","view_paper":"https://pith.science/paper/WI3UGDGO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07351&json=true","fetch_graph":"https://pith.science/api/pith-number/WI3UGDGOG54CSH7REQOG5CO2EO/graph.json","fetch_events":"https://pith.science/api/pith-number/WI3UGDGOG54CSH7REQOG5CO2EO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/action/storage_attestation","attest_author":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/action/author_attestation","sign_citation":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/action/citation_signature","submit_replication":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/action/replication_record"}},"created_at":"2026-05-17T23:45:22.506036+00:00","updated_at":"2026-05-17T23:45:22.506036+00:00"}