{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WI3UGDGOG54CSH7REQOG5CO2EO","short_pith_number":"pith:WI3UGDGO","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"},"canonical_sha256":"b237430cce3778291ff1241c6e89da23b5925166ed0fb2c18c8e3920035762fd","source":{"kind":"arxiv","id":"1808.07351","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07351","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07351v2","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07351","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"WI3UGDGOG54C","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WI3UGDGOG54CSH7R","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WI3UGDGO","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WI3UGDGOG54CSH7REQOG5CO2EO","target":"record","payload":{"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"},"canonical_sha256":"b237430cce3778291ff1241c6e89da23b5925166ed0fb2c18c8e3920035762fd","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"},"source_kind":"arxiv","source_id":"1808.07351","source_version":2,"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-17T23:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y8heauJS0JU7IRiecqFeEoqQzItYw1/3Fgko08AIvgPXjOpHFzJNJKGoJVbnhMJjUa/DpT/eBL5IFUwEpHJSAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:36:31.297939Z"},"content_sha256":"3fe6e7d7f4090c95c2a3d85928b3f27bf3eaf6d2ba86bc14e46addbf3bd85363","schema_version":"1.0","event_id":"sha256:3fe6e7d7f4090c95c2a3d85928b3f27bf3eaf6d2ba86bc14e46addbf3bd85363"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WI3UGDGOG54CSH7REQOG5CO2EO","target":"graph","payload":{"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"},"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-17T23:45:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hm2+2Ks0rC6nFqCSIHrRYjAgAFqo5nXX9r2+jHOCvM/1AUKA9ijUT1ttUUeFNHFp35RH8Rn9zEunHo4XrUe2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:36:31.298332Z"},"content_sha256":"1b7f3ae915ca5d69ff91170219dbc86b49d4c1a3849e09b74e6d807ad271252a","schema_version":"1.0","event_id":"sha256:1b7f3ae915ca5d69ff91170219dbc86b49d4c1a3849e09b74e6d807ad271252a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/bundle.json","state_url":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WI3UGDGOG54CSH7REQOG5CO2EO/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-05-30T02:36:31Z","links":{"resolver":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO","bundle":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/bundle.json","state":"https://pith.science/pith/WI3UGDGOG54CSH7REQOG5CO2EO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WI3UGDGOG54CSH7REQOG5CO2EO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WI3UGDGOG54CSH7REQOG5CO2EO","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":"7a8f7ceffcde7e1fd7ad21104bff4cf29068817cc70caa76ecf51e5062958be9","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-22T13:43:00Z","title_canon_sha256":"42de3e8759399558c2e85b1ad9ba8b1d677a25733568cbce64ea880cf2073817"},"schema_version":"1.0","source":{"id":"1808.07351","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07351","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07351v2","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07351","created_at":"2026-05-17T23:45:22Z"},{"alias_kind":"pith_short_12","alias_value":"WI3UGDGOG54C","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"WI3UGDGOG54CSH7R","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"WI3UGDGO","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:1b7f3ae915ca5d69ff91170219dbc86b49d4c1a3849e09b74e6d807ad271252a","target":"graph","created_at":"2026-05-17T23:45:22Z","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":"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","authors_text":"Asaf Ferber, Benny Sudakov, Omer Angel, Vincent Tassion","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-22T13:43:00Z","title":"Long monotone trails in random edge-labelings of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07351","kind":"arxiv","version":2},"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:3fe6e7d7f4090c95c2a3d85928b3f27bf3eaf6d2ba86bc14e46addbf3bd85363","target":"record","created_at":"2026-05-17T23:45:22Z","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":"7a8f7ceffcde7e1fd7ad21104bff4cf29068817cc70caa76ecf51e5062958be9","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-08-22T13:43:00Z","title_canon_sha256":"42de3e8759399558c2e85b1ad9ba8b1d677a25733568cbce64ea880cf2073817"},"schema_version":"1.0","source":{"id":"1808.07351","kind":"arxiv","version":2}},"canonical_sha256":"b237430cce3778291ff1241c6e89da23b5925166ed0fb2c18c8e3920035762fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b237430cce3778291ff1241c6e89da23b5925166ed0fb2c18c8e3920035762fd","first_computed_at":"2026-05-17T23:45:22.505921Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:22.505921Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nn1jEQJOD7PfcrSR0L693BmkVSTA0JTgHJTPLkb1ajIrDwVMAZwdlmvF24hj0GotG0bNDEbAhl31AFzS1iYJCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:22.506663Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07351","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3fe6e7d7f4090c95c2a3d85928b3f27bf3eaf6d2ba86bc14e46addbf3bd85363","sha256:1b7f3ae915ca5d69ff91170219dbc86b49d4c1a3849e09b74e6d807ad271252a"],"state_sha256":"e68e81ce0c095e0818c2c1f6c787b885b375bb190c2f8b99fc7b0df414faa097"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xq5HpBlwSSJd4W6t9CDIunGwjrUXCRCLL2P1hio9u3lfq+zNZk2Y057zP591RjZW3CusjOSvtRDfMU4rNHprDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:36:31.301239Z","bundle_sha256":"69f1553592a68472cd51420052e70f3b89a2dd54d03810da985e85196bc505d1"}}