{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:W2ZEB5SUSA2VYRTCLHDER2QDWC","short_pith_number":"pith:W2ZEB5SU","schema_version":"1.0","canonical_sha256":"b6b240f65490355c466259c648ea03b0a9ae5af613e7a4c49a7e90b2758ae8ff","source":{"kind":"arxiv","id":"1502.03146","version":1},"attestation_state":"computed","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)$."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.03146","created_at":"2026-05-18T02:27:20.425964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.03146v1","created_at":"2026-05-18T02:27:20.425964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.03146","created_at":"2026-05-18T02:27:20.425964+00:00"},{"alias_kind":"pith_short_12","alias_value":"W2ZEB5SUSA2V","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_16","alias_value":"W2ZEB5SUSA2VYRTC","created_at":"2026-05-18T12:29:47.479230+00:00"},{"alias_kind":"pith_short_8","alias_value":"W2ZEB5SU","created_at":"2026-05-18T12:29:47.479230+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC","json":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC.json","graph_json":"https://pith.science/api/pith-number/W2ZEB5SUSA2VYRTCLHDER2QDWC/graph.json","events_json":"https://pith.science/api/pith-number/W2ZEB5SUSA2VYRTCLHDER2QDWC/events.json","paper":"https://pith.science/paper/W2ZEB5SU"},"agent_actions":{"view_html":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC","download_json":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC.json","view_paper":"https://pith.science/paper/W2ZEB5SU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.03146&json=true","fetch_graph":"https://pith.science/api/pith-number/W2ZEB5SUSA2VYRTCLHDER2QDWC/graph.json","fetch_events":"https://pith.science/api/pith-number/W2ZEB5SUSA2VYRTCLHDER2QDWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/action/storage_attestation","attest_author":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/action/author_attestation","sign_citation":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/action/citation_signature","submit_replication":"https://pith.science/pith/W2ZEB5SUSA2VYRTCLHDER2QDWC/action/replication_record"}},"created_at":"2026-05-18T02:27:20.425964+00:00","updated_at":"2026-05-18T02:27:20.425964+00:00"}