{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3GU3XW3BKHUR6HELPUJZJICZBI","short_pith_number":"pith:3GU3XW3B","schema_version":"1.0","canonical_sha256":"d9a9bbdb6151e91f1c8b7d1394a0590a3a4a20ba825920bc2857ca0a534d9fbf","source":{"kind":"arxiv","id":"1405.1812","version":1},"attestation_state":"computed","paper":{"title":"Degree Monotone Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2014-05-08T06:37:12Z","abstract_excerpt":"We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erd{\\H{o}}s-Szekeres concerning the longest monotone subsequence of a given sequence of numbers.\n  A path P in a graph G is said to be a degree monotone path if the sequence of degrees of the vertices in P in the order they appear in P is monotonic.\n  In this paper we shall consider these three problem related to this parameter:\n  1. Find bounds on $mp(G)$ in terms of other parameters of $G$.\n  2. Study $f(n,k)$ defined to be the maximum number of edges in a graph on $n$ vertices with $mp(G) < k$.\n "},"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":"1405.1812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-05-08T06:37:12Z","cross_cats_sorted":[],"title_canon_sha256":"043dc3975f3ddc939a459d7f8df15c64e89338abde17a78ea7d4d3b4072bbdbc","abstract_canon_sha256":"2671eaee2d6b950ab2c73ef2ad011226e3a12650452cd8de46c6f587a6638192"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:22.392536Z","signature_b64":"uBLkkbKogiUAXzMcRD6DLQjZp1PCH7ipKXpsFpGc2xSX9KvIFk0tlra74R0Yw0gFHAhC0ODIW1Bx/3Zo97gNCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9a9bbdb6151e91f1c8b7d1394a0590a3a4a20ba825920bc2857ca0a534d9fbf","last_reissued_at":"2026-05-18T02:52:22.391808Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:22.391808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree Monotone Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christina Zarb, Josef Lauri, Yair Caro","submitted_at":"2014-05-08T06:37:12Z","abstract_excerpt":"We shall study degree-monotone paths in graphs, a problem inspired by the celebrated theorem of Erd{\\H{o}}s-Szekeres concerning the longest monotone subsequence of a given sequence of numbers.\n  A path P in a graph G is said to be a degree monotone path if the sequence of degrees of the vertices in P in the order they appear in P is monotonic.\n  In this paper we shall consider these three problem related to this parameter:\n  1. Find bounds on $mp(G)$ in terms of other parameters of $G$.\n  2. Study $f(n,k)$ defined to be the maximum number of edges in a graph on $n$ vertices with $mp(G) < k$.\n "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1812","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":"1405.1812","created_at":"2026-05-18T02:52:22.391907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1812v1","created_at":"2026-05-18T02:52:22.391907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1812","created_at":"2026-05-18T02:52:22.391907+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GU3XW3BKHUR","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GU3XW3BKHUR6HEL","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GU3XW3B","created_at":"2026-05-18T12:28:11.866339+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/3GU3XW3BKHUR6HELPUJZJICZBI","json":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI.json","graph_json":"https://pith.science/api/pith-number/3GU3XW3BKHUR6HELPUJZJICZBI/graph.json","events_json":"https://pith.science/api/pith-number/3GU3XW3BKHUR6HELPUJZJICZBI/events.json","paper":"https://pith.science/paper/3GU3XW3B"},"agent_actions":{"view_html":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI","download_json":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI.json","view_paper":"https://pith.science/paper/3GU3XW3B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1812&json=true","fetch_graph":"https://pith.science/api/pith-number/3GU3XW3BKHUR6HELPUJZJICZBI/graph.json","fetch_events":"https://pith.science/api/pith-number/3GU3XW3BKHUR6HELPUJZJICZBI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI/action/storage_attestation","attest_author":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI/action/author_attestation","sign_citation":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI/action/citation_signature","submit_replication":"https://pith.science/pith/3GU3XW3BKHUR6HELPUJZJICZBI/action/replication_record"}},"created_at":"2026-05-18T02:52:22.391907+00:00","updated_at":"2026-05-18T02:52:22.391907+00:00"}