{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:W2ZEB5SUSA2VYRTCLHDER2QDWC","short_pith_number":"pith:W2ZEB5SU","canonical_record":{"source":{"id":"1502.03146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T23:09:08Z","cross_cats_sorted":[],"title_canon_sha256":"418d9e1dfc5e807108aa40e336c5cb92311a8052f80078a0053b75f896d64d3e","abstract_canon_sha256":"6f1766cbb6b708f901d32972c88310afca3a65a8cc1c6d1fe5092a616640a27d"},"schema_version":"1.0"},"canonical_sha256":"b6b240f65490355c466259c648ea03b0a9ae5af613e7a4c49a7e90b2758ae8ff","source":{"kind":"arxiv","id":"1502.03146","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03146","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03146v1","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03146","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"W2ZEB5SUSA2V","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W2ZEB5SUSA2VYRTC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W2ZEB5SU","created_at":"2026-05-18T12:29:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:W2ZEB5SUSA2VYRTCLHDER2QDWC","target":"record","payload":{"canonical_record":{"source":{"id":"1502.03146","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T23:09:08Z","cross_cats_sorted":[],"title_canon_sha256":"418d9e1dfc5e807108aa40e336c5cb92311a8052f80078a0053b75f896d64d3e","abstract_canon_sha256":"6f1766cbb6b708f901d32972c88310afca3a65a8cc1c6d1fe5092a616640a27d"},"schema_version":"1.0"},"canonical_sha256":"b6b240f65490355c466259c648ea03b0a9ae5af613e7a4c49a7e90b2758ae8ff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:20.426573Z","signature_b64":"Wq8y0UtFkPgK2MIgvrMhzjlkYHAI2HNKLdSbZG39++0VfGKveMZ9rhGEB1+KXjwu4Uv30xsSH4lkNkGsVbRCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b6b240f65490355c466259c648ea03b0a9ae5af613e7a4c49a7e90b2758ae8ff","last_reissued_at":"2026-05-18T02:27:20.425848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:20.425848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.03146","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:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CnPw5t9hTGrDdGDyQv5Ey7cd0XDxNT3AuFGliaQwKYY3ZButSc4mM0IOvCBOEWel5rrsMKRdI+4WS6OmjWxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:57:18.148081Z"},"content_sha256":"7d88f1cad656e207dc18c78b3fe6c080cb718672186550098f2f274540d1f83b","schema_version":"1.0","event_id":"sha256:7d88f1cad656e207dc18c78b3fe6c080cb718672186550098f2f274540d1f83b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:W2ZEB5SUSA2VYRTCLHDER2QDWC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Increasing paths in edge-ordered graphs: the hypercube and random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Florian Pfender, Jessica De Silva, Michael Tait, Theodore Molla, Troy Retter","submitted_at":"2015-02-10T23:09:08Z","abstract_excerpt":"An edge-ordering of a graph $G=(V,E)$ is a bijection $\\phi:E\\to\\{1,2,...,|E|\\}$. Given an edge-ordering, a sequence of edges $P=e_1,e_2,...,e_k$ is an increasing path if it is a path in $G$ which satisfies $\\phi(e_i)<\\phi(e_j)$ for all $i<j$. For a graph $G$, let $f(G)$ be the largest integer $\\ell$ such that every edge-ordering of $G$ contains an increasing path of length $\\ell$. The parameter $f(G)$ was first studied for $G=K_n$ and has subsequently been studied for other families of graphs. This paper gives bounds on $f$ for the hypercube and the random graph $G(n,p)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03146","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:27:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BeaAglRVoZHeiQ8R/Eu0ohrvmWq/Skn09vFRGLLt2HPXYssxn3RM9jQPozA1SlzNqlD1qdUX3g8PdIb9r9XrCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:57:18.148477Z"},"content_sha256":"2796a35a4a7a0b5860a6ee656e6fc75ad8f1a6374ebb534a7407a147e5fe67c1","schema_version":"1.0","event_id":"sha256:2796a35a4a7a0b5860a6ee656e6fc75ad8f1a6374ebb534a7407a147e5fe67c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/bundle.json","state_url":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/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-23T12:57:18Z","links":{"resolver":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC","bundle":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/bundle.json","state":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:W2ZEB5SUSA2VYRTCLHDER2QDWC","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":"6f1766cbb6b708f901d32972c88310afca3a65a8cc1c6d1fe5092a616640a27d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T23:09:08Z","title_canon_sha256":"418d9e1dfc5e807108aa40e336c5cb92311a8052f80078a0053b75f896d64d3e"},"schema_version":"1.0","source":{"id":"1502.03146","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.03146","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"arxiv_version","alias_value":"1502.03146v1","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03146","created_at":"2026-05-18T02:27:20Z"},{"alias_kind":"pith_short_12","alias_value":"W2ZEB5SUSA2V","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_16","alias_value":"W2ZEB5SUSA2VYRTC","created_at":"2026-05-18T12:29:47Z"},{"alias_kind":"pith_short_8","alias_value":"W2ZEB5SU","created_at":"2026-05-18T12:29:47Z"}],"graph_snapshots":[{"event_id":"sha256:2796a35a4a7a0b5860a6ee656e6fc75ad8f1a6374ebb534a7407a147e5fe67c1","target":"graph","created_at":"2026-05-18T02:27:20Z","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":"An edge-ordering of a graph $G=(V,E)$ is a bijection $\\phi:E\\to\\{1,2,...,|E|\\}$. Given an edge-ordering, a sequence of edges $P=e_1,e_2,...,e_k$ is an increasing path if it is a path in $G$ which satisfies $\\phi(e_i)<\\phi(e_j)$ for all $i<j$. For a graph $G$, let $f(G)$ be the largest integer $\\ell$ such that every edge-ordering of $G$ contains an increasing path of length $\\ell$. The parameter $f(G)$ was first studied for $G=K_n$ and has subsequently been studied for other families of graphs. This paper gives bounds on $f$ for the hypercube and the random graph $G(n,p)$.","authors_text":"Florian Pfender, Jessica De Silva, Michael Tait, Theodore Molla, Troy Retter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T23:09:08Z","title":"Increasing paths in edge-ordered graphs: the hypercube and random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.03146","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:7d88f1cad656e207dc18c78b3fe6c080cb718672186550098f2f274540d1f83b","target":"record","created_at":"2026-05-18T02:27:20Z","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":"6f1766cbb6b708f901d32972c88310afca3a65a8cc1c6d1fe5092a616640a27d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-02-10T23:09:08Z","title_canon_sha256":"418d9e1dfc5e807108aa40e336c5cb92311a8052f80078a0053b75f896d64d3e"},"schema_version":"1.0","source":{"id":"1502.03146","kind":"arxiv","version":1}},"canonical_sha256":"b6b240f65490355c466259c648ea03b0a9ae5af613e7a4c49a7e90b2758ae8ff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b6b240f65490355c466259c648ea03b0a9ae5af613e7a4c49a7e90b2758ae8ff","first_computed_at":"2026-05-18T02:27:20.425848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:27:20.425848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Wq8y0UtFkPgK2MIgvrMhzjlkYHAI2HNKLdSbZG39++0VfGKveMZ9rhGEB1+KXjwu4Uv30xsSH4lkNkGsVbRCDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:27:20.426573Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.03146","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7d88f1cad656e207dc18c78b3fe6c080cb718672186550098f2f274540d1f83b","sha256:2796a35a4a7a0b5860a6ee656e6fc75ad8f1a6374ebb534a7407a147e5fe67c1"],"state_sha256":"51724c23223988624e39be16cc593c4432cdca6bf65799d0ab0b42fb37967a23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8mQqoKzZapciB8WaqbaJAYVEWW4rbtqQ3zX55kWPQWxEz8sncm+kJ0ir9sdRfFLAPmmNN5H8+s6h3LSlSpNSCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:57:18.150675Z","bundle_sha256":"2ae39de4d5fbe0a2e85a6224f09bf65d2c291747a4bd7d4776f192957f3d2392"}}