{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:PVM2LYR6CFY4W64KDNDRYLX2SR","short_pith_number":"pith:PVM2LYR6","schema_version":"1.0","canonical_sha256":"7d59a5e23e1171cb7b8a1b471c2efa9459e07d2cf03f9672df342eac826d7c18","source":{"kind":"arxiv","id":"1510.03041","version":3},"attestation_state":"computed","paper":{"title":"Minors in graphs of large ${\\theta}_r$-girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Dimitrios M. Thilikos, Dimitris Chatzidimitriou, Ignasi Sau, Jean-Florent Raymond","submitted_at":"2015-10-11T11:46:31Z","abstract_excerpt":"For every $r \\in \\mathbb{N}$, let $\\theta_r$ denote the graph with two vertices and $r$ parallel edges. The $\\theta_r$-girth of a graph $G$ is the minimum number of edges of a subgraph of $G$ that can be contracted to $\\theta_r$. This notion generalizes the usual concept of girth which corresponds to the case $r=2$. In [Minors in graphs of large girth, Random Structures & Algorithms, 22(2):213--225, 2003], K\\\"uhn and Osthus showed that graphs of sufficiently large minimum degree contain clique-minors whose order is an exponential function of their girth. We extend this result for the case of $"},"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":"1510.03041","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T11:46:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6bec8dba0d70979b8646a04b3c00f356e0be562c94e8bb6148572da0679fdbaf","abstract_canon_sha256":"163f5e2806cfaea2997d82d199c07b11543fe14e879fb1e80b8b1f95a847d817"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:34.489478Z","signature_b64":"2nSNPK49csG/RNMKeRy6ZLEMliAsVHAKHucTNz1ESTNk7TxrEnWMcaXeuFEWSYWUdfEIA16ZSgWXji4RoYM5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d59a5e23e1171cb7b8a1b471c2efa9459e07d2cf03f9672df342eac826d7c18","last_reissued_at":"2026-05-18T00:52:34.489068Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:34.489068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minors in graphs of large ${\\theta}_r$-girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.CO","authors_text":"Dimitrios M. Thilikos, Dimitris Chatzidimitriou, Ignasi Sau, Jean-Florent Raymond","submitted_at":"2015-10-11T11:46:31Z","abstract_excerpt":"For every $r \\in \\mathbb{N}$, let $\\theta_r$ denote the graph with two vertices and $r$ parallel edges. The $\\theta_r$-girth of a graph $G$ is the minimum number of edges of a subgraph of $G$ that can be contracted to $\\theta_r$. This notion generalizes the usual concept of girth which corresponds to the case $r=2$. In [Minors in graphs of large girth, Random Structures & Algorithms, 22(2):213--225, 2003], K\\\"uhn and Osthus showed that graphs of sufficiently large minimum degree contain clique-minors whose order is an exponential function of their girth. We extend this result for the case of $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03041","kind":"arxiv","version":3},"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":"1510.03041","created_at":"2026-05-18T00:52:34.489128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03041v3","created_at":"2026-05-18T00:52:34.489128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03041","created_at":"2026-05-18T00:52:34.489128+00:00"},{"alias_kind":"pith_short_12","alias_value":"PVM2LYR6CFY4","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"PVM2LYR6CFY4W64K","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"PVM2LYR6","created_at":"2026-05-18T12:29:37.295048+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/PVM2LYR6CFY4W64KDNDRYLX2SR","json":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR.json","graph_json":"https://pith.science/api/pith-number/PVM2LYR6CFY4W64KDNDRYLX2SR/graph.json","events_json":"https://pith.science/api/pith-number/PVM2LYR6CFY4W64KDNDRYLX2SR/events.json","paper":"https://pith.science/paper/PVM2LYR6"},"agent_actions":{"view_html":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR","download_json":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR.json","view_paper":"https://pith.science/paper/PVM2LYR6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03041&json=true","fetch_graph":"https://pith.science/api/pith-number/PVM2LYR6CFY4W64KDNDRYLX2SR/graph.json","fetch_events":"https://pith.science/api/pith-number/PVM2LYR6CFY4W64KDNDRYLX2SR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/action/storage_attestation","attest_author":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/action/author_attestation","sign_citation":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/action/citation_signature","submit_replication":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/action/replication_record"}},"created_at":"2026-05-18T00:52:34.489128+00:00","updated_at":"2026-05-18T00:52:34.489128+00:00"}