{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:RL7MUGKQUONTB5YSOU2VXFOB35","short_pith_number":"pith:RL7MUGKQ","schema_version":"1.0","canonical_sha256":"8afeca1950a39b30f71275355b95c1df60fbdb87e5e436885d7f7765d761fb4b","source":{"kind":"arxiv","id":"1610.09093","version":1},"attestation_state":"computed","paper":{"title":"More on foxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jens M. Schmidt, Matthias Kriesell","submitted_at":"2016-10-28T06:42:43Z","abstract_excerpt":"An edge in a $k$-connected graph $G$ is called {\\em $k$-contractible} if the graph $G/e$ obtained from $G$ by contracting $e$ is $k$-connected. Generalizing earlier results on $3$-contractible edges in spanning trees of $3$-connected graphs, we prove that (except for the graphs $K_{k+1}$ if $k \\in \\{1,2\\}$) (a) every spanning tree of a $k$-connected triangle free graph has two $k$-contractible edges, (b) every spanning tree of a $k$-connected graph of minimum degree at least $\\frac{3}{2}k-1$ has two $k$-contractible edges, (c) for $k>3$, every DFS tree of a $k$-connected graph of minimum degre"},"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":"1610.09093","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-28T06:42:43Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"472a92b88fb5b1174b976a70771d9f3c112ede8fba6129cbbe05113989232c61","abstract_canon_sha256":"3773efc947d2028a47d21011175e3a8b7c4e3b1e7efe37b9da58922635ba34c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:59.166335Z","signature_b64":"OkekdAB8j49MPEpBbsFEMF3zjvYi2AODHLOo4GwbYxl6ImryShCGWtPpNDCRAnHU2ZrzNRe+j+gxM7w2SM6LAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8afeca1950a39b30f71275355b95c1df60fbdb87e5e436885d7f7765d761fb4b","last_reissued_at":"2026-05-18T01:00:59.165751Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:59.165751Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"More on foxes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jens M. Schmidt, Matthias Kriesell","submitted_at":"2016-10-28T06:42:43Z","abstract_excerpt":"An edge in a $k$-connected graph $G$ is called {\\em $k$-contractible} if the graph $G/e$ obtained from $G$ by contracting $e$ is $k$-connected. Generalizing earlier results on $3$-contractible edges in spanning trees of $3$-connected graphs, we prove that (except for the graphs $K_{k+1}$ if $k \\in \\{1,2\\}$) (a) every spanning tree of a $k$-connected triangle free graph has two $k$-contractible edges, (b) every spanning tree of a $k$-connected graph of minimum degree at least $\\frac{3}{2}k-1$ has two $k$-contractible edges, (c) for $k>3$, every DFS tree of a $k$-connected graph of minimum degre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09093","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":"1610.09093","created_at":"2026-05-18T01:00:59.165848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09093v1","created_at":"2026-05-18T01:00:59.165848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09093","created_at":"2026-05-18T01:00:59.165848+00:00"},{"alias_kind":"pith_short_12","alias_value":"RL7MUGKQUONT","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_16","alias_value":"RL7MUGKQUONTB5YS","created_at":"2026-05-18T12:30:41.710351+00:00"},{"alias_kind":"pith_short_8","alias_value":"RL7MUGKQ","created_at":"2026-05-18T12:30:41.710351+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/RL7MUGKQUONTB5YSOU2VXFOB35","json":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35.json","graph_json":"https://pith.science/api/pith-number/RL7MUGKQUONTB5YSOU2VXFOB35/graph.json","events_json":"https://pith.science/api/pith-number/RL7MUGKQUONTB5YSOU2VXFOB35/events.json","paper":"https://pith.science/paper/RL7MUGKQ"},"agent_actions":{"view_html":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35","download_json":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35.json","view_paper":"https://pith.science/paper/RL7MUGKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09093&json=true","fetch_graph":"https://pith.science/api/pith-number/RL7MUGKQUONTB5YSOU2VXFOB35/graph.json","fetch_events":"https://pith.science/api/pith-number/RL7MUGKQUONTB5YSOU2VXFOB35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35/action/storage_attestation","attest_author":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35/action/author_attestation","sign_citation":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35/action/citation_signature","submit_replication":"https://pith.science/pith/RL7MUGKQUONTB5YSOU2VXFOB35/action/replication_record"}},"created_at":"2026-05-18T01:00:59.165848+00:00","updated_at":"2026-05-18T01:00:59.165848+00:00"}