{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:FH4Y5C7L6SOQPWNU6FR4ROZIC3","short_pith_number":"pith:FH4Y5C7L","schema_version":"1.0","canonical_sha256":"29f98e8bebf49d07d9b4f163c8bb2816dffd598ddf72a25c0102b9339eec096f","source":{"kind":"arxiv","id":"1803.04466","version":2},"attestation_state":"computed","paper":{"title":"Cycle Traversability for Claw-free Graphs and Polyhedral Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Ye, Ervin Gy\\H{o}ri, Michael D. Plummer, Xiaoya Zha","submitted_at":"2018-03-12T19:06:10Z","abstract_excerpt":"Let $G$ be a graph, and $v\\in V(G)$ and $S\\subseteq V(G)\\backslash v$ of size at least $k$. An important result on graph connectivity due to Perfect states that, if $v$ and $S$ are $k$-linked, then a $(k-1)$-link between a vertex $v$ and $S$ can be extended to a $k$-link between $v$ and $S$ such that the endvertices of the $(k-1)$-link are also the endvertices of the $k$-link. We begin by proving a generalization of Perfect's result by showing that, if two disjoint sets $S_1$ and $S_2$ are $k$-linked, then a $t$-link ($t< k$) between two disjoint sets $S_1$ and $S_2$ can be extended to a $k$-l"},"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":"1803.04466","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-12T19:06:10Z","cross_cats_sorted":[],"title_canon_sha256":"ddc2b90beabe877c53cd0ebf43dbe1f4b1100a24b97acf49e5b426321302bb04","abstract_canon_sha256":"44a1309d1ac871dd656500584051bc23c88ea24835e3fe7f58c297641966b798"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:56.027233Z","signature_b64":"hvbupVJL13vhsDQ7nzW3gnsjcOHQY6sh1dAS0ZVZ4EyDwCz9rmLC0TeTACP+4eTLoc/oUEp15ql05oqhgXObCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29f98e8bebf49d07d9b4f163c8bb2816dffd598ddf72a25c0102b9339eec096f","last_reissued_at":"2026-05-17T23:51:56.026759Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:56.026759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Cycle Traversability for Claw-free Graphs and Polyhedral Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dong Ye, Ervin Gy\\H{o}ri, Michael D. Plummer, Xiaoya Zha","submitted_at":"2018-03-12T19:06:10Z","abstract_excerpt":"Let $G$ be a graph, and $v\\in V(G)$ and $S\\subseteq V(G)\\backslash v$ of size at least $k$. An important result on graph connectivity due to Perfect states that, if $v$ and $S$ are $k$-linked, then a $(k-1)$-link between a vertex $v$ and $S$ can be extended to a $k$-link between $v$ and $S$ such that the endvertices of the $(k-1)$-link are also the endvertices of the $k$-link. We begin by proving a generalization of Perfect's result by showing that, if two disjoint sets $S_1$ and $S_2$ are $k$-linked, then a $t$-link ($t< k$) between two disjoint sets $S_1$ and $S_2$ can be extended to a $k$-l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04466","kind":"arxiv","version":2},"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":"1803.04466","created_at":"2026-05-17T23:51:56.026839+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04466v2","created_at":"2026-05-17T23:51:56.026839+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04466","created_at":"2026-05-17T23:51:56.026839+00:00"},{"alias_kind":"pith_short_12","alias_value":"FH4Y5C7L6SOQ","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"FH4Y5C7L6SOQPWNU","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"FH4Y5C7L","created_at":"2026-05-18T12:32:22.470017+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/FH4Y5C7L6SOQPWNU6FR4ROZIC3","json":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3.json","graph_json":"https://pith.science/api/pith-number/FH4Y5C7L6SOQPWNU6FR4ROZIC3/graph.json","events_json":"https://pith.science/api/pith-number/FH4Y5C7L6SOQPWNU6FR4ROZIC3/events.json","paper":"https://pith.science/paper/FH4Y5C7L"},"agent_actions":{"view_html":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3","download_json":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3.json","view_paper":"https://pith.science/paper/FH4Y5C7L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04466&json=true","fetch_graph":"https://pith.science/api/pith-number/FH4Y5C7L6SOQPWNU6FR4ROZIC3/graph.json","fetch_events":"https://pith.science/api/pith-number/FH4Y5C7L6SOQPWNU6FR4ROZIC3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3/action/storage_attestation","attest_author":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3/action/author_attestation","sign_citation":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3/action/citation_signature","submit_replication":"https://pith.science/pith/FH4Y5C7L6SOQPWNU6FR4ROZIC3/action/replication_record"}},"created_at":"2026-05-17T23:51:56.026839+00:00","updated_at":"2026-05-17T23:51:56.026839+00:00"}