{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:OKJ7SHNCBBL4IGGC56DI4HBBZE","short_pith_number":"pith:OKJ7SHNC","schema_version":"1.0","canonical_sha256":"7293f91da20857c418c2ef868e1c21c9315017af96e55e2586c8085ab0b4c534","source":{"kind":"arxiv","id":"1408.3204","version":1},"attestation_state":"computed","paper":{"title":"Degree Monotone Paths and Graph Operations","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-08-14T07:12:54Z","abstract_excerpt":"A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by $mp(G)$. This parameter was first studied in an earlier paper by the authors where bounds in terms of other parameters of $G$ were obtained.\n  In this paper we concentrate on the study of how $mp(G)$ changes under various operations on $G$. We first consider how $mp(G)$ changes when an edge is deleted, added, contracted or subdivided. We similarly consider the e"},"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":"1408.3204","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-14T07:12:54Z","cross_cats_sorted":[],"title_canon_sha256":"55bf56e585a886ff9748a15957b7aaebce27fe0a693bf8eee0ca4ff49d7568ff","abstract_canon_sha256":"0600e2f381c14bb1742dd719c42c89f842a6889d2b0090bc1bbb9e6475a93dd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:13.550202Z","signature_b64":"SPo7c7OUffhVw0FDv7JnzyCr59FUTo9RW/tifE9SgwGZLJRevUzJ0ev3kExWg6BOmVf6EPPhnTrx4ZS40pQ4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7293f91da20857c418c2ef868e1c21c9315017af96e55e2586c8085ab0b4c534","last_reissued_at":"2026-05-18T02:45:13.549551Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:13.549551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree Monotone Paths and Graph Operations","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-08-14T07:12:54Z","abstract_excerpt":"A path $P$ in a graph $G$ is said to be a degree monotone path if the sequence of degrees of the vertices of $P$ in the order in which they appear on $P$ is monotonic. The length of the longest degree monotone path in $G$ is denoted by $mp(G)$. This parameter was first studied in an earlier paper by the authors where bounds in terms of other parameters of $G$ were obtained.\n  In this paper we concentrate on the study of how $mp(G)$ changes under various operations on $G$. We first consider how $mp(G)$ changes when an edge is deleted, added, contracted or subdivided. We similarly consider the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3204","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":"1408.3204","created_at":"2026-05-18T02:45:13.549654+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3204v1","created_at":"2026-05-18T02:45:13.549654+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3204","created_at":"2026-05-18T02:45:13.549654+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKJ7SHNCBBL4","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKJ7SHNCBBL4IGGC","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKJ7SHNC","created_at":"2026-05-18T12:28:41.024544+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/OKJ7SHNCBBL4IGGC56DI4HBBZE","json":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE.json","graph_json":"https://pith.science/api/pith-number/OKJ7SHNCBBL4IGGC56DI4HBBZE/graph.json","events_json":"https://pith.science/api/pith-number/OKJ7SHNCBBL4IGGC56DI4HBBZE/events.json","paper":"https://pith.science/paper/OKJ7SHNC"},"agent_actions":{"view_html":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE","download_json":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE.json","view_paper":"https://pith.science/paper/OKJ7SHNC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3204&json=true","fetch_graph":"https://pith.science/api/pith-number/OKJ7SHNCBBL4IGGC56DI4HBBZE/graph.json","fetch_events":"https://pith.science/api/pith-number/OKJ7SHNCBBL4IGGC56DI4HBBZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE/action/storage_attestation","attest_author":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE/action/author_attestation","sign_citation":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE/action/citation_signature","submit_replication":"https://pith.science/pith/OKJ7SHNCBBL4IGGC56DI4HBBZE/action/replication_record"}},"created_at":"2026-05-18T02:45:13.549654+00:00","updated_at":"2026-05-18T02:45:13.549654+00:00"}