{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7HUDRL7FR27ZSQ24COXD7UVLWY","short_pith_number":"pith:7HUDRL7F","canonical_record":{"source":{"id":"1605.07204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-23T20:13:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f8c4b912477672da26271c02961f39e678c569ab32d4a8147e399fc590879085","abstract_canon_sha256":"d524cbb7ba8a2c277bb6224240d605dd082b044ba9abd2bb546929852c0dff00"},"schema_version":"1.0"},"canonical_sha256":"f9e838afe58ebf99435c13ae3fd2abb6247333bd1a149fe6b19d73ff610fc3c5","source":{"kind":"arxiv","id":"1605.07204","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07204","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07204v3","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07204","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"7HUDRL7FR27Z","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HUDRL7FR27ZSQ24","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HUDRL7F","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7HUDRL7FR27ZSQ24COXD7UVLWY","target":"record","payload":{"canonical_record":{"source":{"id":"1605.07204","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-23T20:13:38Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"f8c4b912477672da26271c02961f39e678c569ab32d4a8147e399fc590879085","abstract_canon_sha256":"d524cbb7ba8a2c277bb6224240d605dd082b044ba9abd2bb546929852c0dff00"},"schema_version":"1.0"},"canonical_sha256":"f9e838afe58ebf99435c13ae3fd2abb6247333bd1a149fe6b19d73ff610fc3c5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:46.855909Z","signature_b64":"C14rEQbgFCdU42DThz4u5R4JGYXeNqYPwZWLW9q/a5kmTBPOGnUL3Qx0txK0gNjdQIZQBOiDMyu/BGaYa7J4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9e838afe58ebf99435c13ae3fd2abb6247333bd1a149fe6b19d73ff610fc3c5","last_reissued_at":"2026-05-18T00:21:46.855368Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:46.855368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.07204","source_version":3,"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-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uifMvNGD5IEItlOIRFjOI+UFEkFcvEdsDbVNIX4zqLllFCQihX5bhfFQ1KyFVs04jkeQQUlu+rHWjtI5RUoECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:58:27.572094Z"},"content_sha256":"838c95d6c1962a261e0ba8c223678ade21f69d989ff23cdb9bc09f997dad457f","schema_version":"1.0","event_id":"sha256:838c95d6c1962a261e0ba8c223678ade21f69d989ff23cdb9bc09f997dad457f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7HUDRL7FR27ZSQ24COXD7UVLWY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Most edge-orderings of $K_n$ have maximal altitude","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Anders Martinsson","submitted_at":"2016-05-23T20:13:38Z","abstract_excerpt":"Suppose the edges of the complete graph on $n$ vertices are assigned a uniformly chosen random ordering. Let $X$ denote the corresponding number of Hamiltonian paths that are increasing in this ordering. It was shown in a recent paper by Lavrov and Loh that this quantity is non-zero with probability at least $1/e-o(1)$, and conjectured that $X$ is asymptotically almost surely non-zero. In this paper, we prove their conjecture. We further prove a partial result regarding the limiting behaviour of $X$, suggesting that $X/n$ is log-normal in the limit as $n\\rightarrow\\infty$. A key idea of our pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07204","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"},"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-18T00:21:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sskox2txgHlDKQK1QJISHPHoPnu3oFz/zaKkM3ut/O44v/I9UV9yEvgHg36VaD/vcGb0J6ZO8trFAZqROtbsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T18:58:27.572845Z"},"content_sha256":"4031bae515a77b289153ac22c6911963d6efa3307c71d929528d6038352c992c","schema_version":"1.0","event_id":"sha256:4031bae515a77b289153ac22c6911963d6efa3307c71d929528d6038352c992c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7HUDRL7FR27ZSQ24COXD7UVLWY/bundle.json","state_url":"https://pith.science/pith/7HUDRL7FR27ZSQ24COXD7UVLWY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7HUDRL7FR27ZSQ24COXD7UVLWY/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-07T18:58:27Z","links":{"resolver":"https://pith.science/pith/7HUDRL7FR27ZSQ24COXD7UVLWY","bundle":"https://pith.science/pith/7HUDRL7FR27ZSQ24COXD7UVLWY/bundle.json","state":"https://pith.science/pith/7HUDRL7FR27ZSQ24COXD7UVLWY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7HUDRL7FR27ZSQ24COXD7UVLWY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7HUDRL7FR27ZSQ24COXD7UVLWY","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":"d524cbb7ba8a2c277bb6224240d605dd082b044ba9abd2bb546929852c0dff00","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-23T20:13:38Z","title_canon_sha256":"f8c4b912477672da26271c02961f39e678c569ab32d4a8147e399fc590879085"},"schema_version":"1.0","source":{"id":"1605.07204","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.07204","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"arxiv_version","alias_value":"1605.07204v3","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.07204","created_at":"2026-05-18T00:21:46Z"},{"alias_kind":"pith_short_12","alias_value":"7HUDRL7FR27Z","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7HUDRL7FR27ZSQ24","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7HUDRL7F","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:4031bae515a77b289153ac22c6911963d6efa3307c71d929528d6038352c992c","target":"graph","created_at":"2026-05-18T00:21:46Z","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":"Suppose the edges of the complete graph on $n$ vertices are assigned a uniformly chosen random ordering. Let $X$ denote the corresponding number of Hamiltonian paths that are increasing in this ordering. It was shown in a recent paper by Lavrov and Loh that this quantity is non-zero with probability at least $1/e-o(1)$, and conjectured that $X$ is asymptotically almost surely non-zero. In this paper, we prove their conjecture. We further prove a partial result regarding the limiting behaviour of $X$, suggesting that $X/n$ is log-normal in the limit as $n\\rightarrow\\infty$. A key idea of our pr","authors_text":"Anders Martinsson","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-23T20:13:38Z","title":"Most edge-orderings of $K_n$ have maximal altitude"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.07204","kind":"arxiv","version":3},"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:838c95d6c1962a261e0ba8c223678ade21f69d989ff23cdb9bc09f997dad457f","target":"record","created_at":"2026-05-18T00:21:46Z","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":"d524cbb7ba8a2c277bb6224240d605dd082b044ba9abd2bb546929852c0dff00","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2016-05-23T20:13:38Z","title_canon_sha256":"f8c4b912477672da26271c02961f39e678c569ab32d4a8147e399fc590879085"},"schema_version":"1.0","source":{"id":"1605.07204","kind":"arxiv","version":3}},"canonical_sha256":"f9e838afe58ebf99435c13ae3fd2abb6247333bd1a149fe6b19d73ff610fc3c5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9e838afe58ebf99435c13ae3fd2abb6247333bd1a149fe6b19d73ff610fc3c5","first_computed_at":"2026-05-18T00:21:46.855368Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:46.855368Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C14rEQbgFCdU42DThz4u5R4JGYXeNqYPwZWLW9q/a5kmTBPOGnUL3Qx0txK0gNjdQIZQBOiDMyu/BGaYa7J4BA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:46.855909Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.07204","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:838c95d6c1962a261e0ba8c223678ade21f69d989ff23cdb9bc09f997dad457f","sha256:4031bae515a77b289153ac22c6911963d6efa3307c71d929528d6038352c992c"],"state_sha256":"aec085453217b1f55c644dbed2e66ab7e1a617b9f4d368fef75126d31eb9e6b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/9XFV7CO4DpLXIZw0/qvC+3a9qml05zQHjCv7skStJfL24u/7VNCxmvNbAxRzUUUtMy4+9RvQidoXKv2wnsfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T18:58:27.576917Z","bundle_sha256":"35597e548f1c52e8c5ebdec13792071f7a0cb4f36d652c2bd1badb5d18177f28"}}