{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WA2EEB44KFPT4GXCKT7CL24LXL","short_pith_number":"pith:WA2EEB44","canonical_record":{"source":{"id":"1403.0948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T21:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"4b751b70489417c4b484acacdec250084a2c4dec129993af1b494eb01f10eca6","abstract_canon_sha256":"aafb283a951e68494bfc259d84e7c1902ce568bc937341693144fce2acfdb62b"},"schema_version":"1.0"},"canonical_sha256":"b03442079c515f3e1ae254fe25eb8bbaf45fe87df3dcf8a391358978203272cb","source":{"kind":"arxiv","id":"1403.0948","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0948","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0948v1","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0948","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"WA2EEB44KFPT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WA2EEB44KFPT4GXC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WA2EEB44","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WA2EEB44KFPT4GXCKT7CL24LXL","target":"record","payload":{"canonical_record":{"source":{"id":"1403.0948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T21:08:36Z","cross_cats_sorted":[],"title_canon_sha256":"4b751b70489417c4b484acacdec250084a2c4dec129993af1b494eb01f10eca6","abstract_canon_sha256":"aafb283a951e68494bfc259d84e7c1902ce568bc937341693144fce2acfdb62b"},"schema_version":"1.0"},"canonical_sha256":"b03442079c515f3e1ae254fe25eb8bbaf45fe87df3dcf8a391358978203272cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:06.074441Z","signature_b64":"BDHLTSCD4qyo/I1LxkdW1fx8MHCi/TwY7F72nmJCMkK6uch4JL4o53EiYI6y88blwvOsjEphZS+8i+4Jt45ADw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b03442079c515f3e1ae254fe25eb8bbaf45fe87df3dcf8a391358978203272cb","last_reissued_at":"2026-05-18T02:57:06.073793Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:06.073793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.0948","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-18T02:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DSe9ZadbnSBL9nMCboa+LDnxsmmIKuOv3y6qyHEoJpbcpDlgiB8nVgTqJBnoQrJOOoxiomrMTS5NpZsXpFi/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:32:23.491905Z"},"content_sha256":"0a159cad1123fe7934866d724bb304da633cf603d7462197cc8c4549d56ee208","schema_version":"1.0","event_id":"sha256:0a159cad1123fe7934866d724bb304da633cf603d7462197cc8c4549d56ee208"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WA2EEB44KFPT4GXCKT7CL24LXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hamiltonian increasing paths in random edge orderings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Mikhail Lavrov, Po-Shen Loh","submitted_at":"2014-03-04T21:08:36Z","abstract_excerpt":"If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with asymptotic bounds between $\\sqrt{n}$ (Graham and Kleitman, 1973) and $n/2$ (Calderbank, Chung, and Sturtevant, 1984).\n  We consider the average case, when the ordering is chosen uniformly at random. We discover the surprising result that in the random setting, an increasing path of the maximum possible length of $n-1$ exists with probability at least about "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0948","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-18T02:57:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lmk242MuQwleEsy1vYfJyBGCoFdE5J1AVimM3g9Wexmspl9YE6G6A2N3q4jSO3X9+evH5wiAUnQPh+3TqtTOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:32:23.492622Z"},"content_sha256":"52f8f16211caf8952ae064022951726f2b8388fdd0b2ce3172eae540fd8e8344","schema_version":"1.0","event_id":"sha256:52f8f16211caf8952ae064022951726f2b8388fdd0b2ce3172eae540fd8e8344"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WA2EEB44KFPT4GXCKT7CL24LXL/bundle.json","state_url":"https://pith.science/pith/WA2EEB44KFPT4GXCKT7CL24LXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WA2EEB44KFPT4GXCKT7CL24LXL/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-30T23:32:23Z","links":{"resolver":"https://pith.science/pith/WA2EEB44KFPT4GXCKT7CL24LXL","bundle":"https://pith.science/pith/WA2EEB44KFPT4GXCKT7CL24LXL/bundle.json","state":"https://pith.science/pith/WA2EEB44KFPT4GXCKT7CL24LXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WA2EEB44KFPT4GXCKT7CL24LXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WA2EEB44KFPT4GXCKT7CL24LXL","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":"aafb283a951e68494bfc259d84e7c1902ce568bc937341693144fce2acfdb62b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T21:08:36Z","title_canon_sha256":"4b751b70489417c4b484acacdec250084a2c4dec129993af1b494eb01f10eca6"},"schema_version":"1.0","source":{"id":"1403.0948","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.0948","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"arxiv_version","alias_value":"1403.0948v1","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.0948","created_at":"2026-05-18T02:57:06Z"},{"alias_kind":"pith_short_12","alias_value":"WA2EEB44KFPT","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WA2EEB44KFPT4GXC","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WA2EEB44","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:52f8f16211caf8952ae064022951726f2b8388fdd0b2ce3172eae540fd8e8344","target":"graph","created_at":"2026-05-18T02:57:06Z","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":"If the edges of the complete graph $K_n$ are totally ordered, a simple path whose edges are in ascending order is called increasing. The worst-case length of the longest increasing path has remained an open problem for several decades, with asymptotic bounds between $\\sqrt{n}$ (Graham and Kleitman, 1973) and $n/2$ (Calderbank, Chung, and Sturtevant, 1984).\n  We consider the average case, when the ordering is chosen uniformly at random. We discover the surprising result that in the random setting, an increasing path of the maximum possible length of $n-1$ exists with probability at least about ","authors_text":"Mikhail Lavrov, Po-Shen Loh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T21:08:36Z","title":"Hamiltonian increasing paths in random edge orderings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.0948","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:0a159cad1123fe7934866d724bb304da633cf603d7462197cc8c4549d56ee208","target":"record","created_at":"2026-05-18T02:57:06Z","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":"aafb283a951e68494bfc259d84e7c1902ce568bc937341693144fce2acfdb62b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-03-04T21:08:36Z","title_canon_sha256":"4b751b70489417c4b484acacdec250084a2c4dec129993af1b494eb01f10eca6"},"schema_version":"1.0","source":{"id":"1403.0948","kind":"arxiv","version":1}},"canonical_sha256":"b03442079c515f3e1ae254fe25eb8bbaf45fe87df3dcf8a391358978203272cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b03442079c515f3e1ae254fe25eb8bbaf45fe87df3dcf8a391358978203272cb","first_computed_at":"2026-05-18T02:57:06.073793Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:06.073793Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BDHLTSCD4qyo/I1LxkdW1fx8MHCi/TwY7F72nmJCMkK6uch4JL4o53EiYI6y88blwvOsjEphZS+8i+4Jt45ADw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:06.074441Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.0948","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a159cad1123fe7934866d724bb304da633cf603d7462197cc8c4549d56ee208","sha256:52f8f16211caf8952ae064022951726f2b8388fdd0b2ce3172eae540fd8e8344"],"state_sha256":"7974016b7227e7a587fdc0a5f1b0e73e67593551bfc58cd306d826ad43f27320"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0JSESX+GaQsQSbhxNulYrS+0nfu4e7Ch0QvKVXOigjxQUpTN8AGyJ1rPpyP7Uk3jUoY94dZO9OKei/1N0mS2Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:32:23.496618Z","bundle_sha256":"abb4867d21cc5fb4055db82c57269fe4b1bfe5cb36c90a9cb999bd3390f1e0c5"}}