{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PVM2LYR6CFY4W64KDNDRYLX2SR","short_pith_number":"pith:PVM2LYR6","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"},"canonical_sha256":"7d59a5e23e1171cb7b8a1b471c2efa9459e07d2cf03f9672df342eac826d7c18","source":{"kind":"arxiv","id":"1510.03041","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03041","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03041v3","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03041","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"PVM2LYR6CFY4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PVM2LYR6CFY4W64K","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PVM2LYR6","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PVM2LYR6CFY4W64KDNDRYLX2SR","target":"record","payload":{"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"},"canonical_sha256":"7d59a5e23e1171cb7b8a1b471c2efa9459e07d2cf03f9672df342eac826d7c18","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"},"source_kind":"arxiv","source_id":"1510.03041","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2+yR3pExxe8Uadu5xhOMqnlJ7iA1KvhhXGgWA4zWtjSIqmrdz7B3+Z7U3qDhFj45op41nHVr/LoXvVtgCWODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:12.370553Z"},"content_sha256":"7b51a1726f4882d3d4ee2a27d543e0efd107a38016cd2b7d9e00df51006bc394","schema_version":"1.0","event_id":"sha256:7b51a1726f4882d3d4ee2a27d543e0efd107a38016cd2b7d9e00df51006bc394"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PVM2LYR6CFY4W64KDNDRYLX2SR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:52:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+J7dqw2EnQOBVongg5fFqUG9gFCv/gR11kzGlwzFRLxGpxqQgscjtOktKO7TmBN+9ggyDsFCc9tDdx/BjdJqCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T20:59:12.371191Z"},"content_sha256":"05901da48ac11fd68b4e4bc7a86cfe10d136cdab65baad7b792b435a5cf7fc29","schema_version":"1.0","event_id":"sha256:05901da48ac11fd68b4e4bc7a86cfe10d136cdab65baad7b792b435a5cf7fc29"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/bundle.json","state_url":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T20:59:12Z","links":{"resolver":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR","bundle":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/bundle.json","state":"https://pith.science/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVM2LYR6CFY4W64KDNDRYLX2SR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PVM2LYR6CFY4W64KDNDRYLX2SR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"163f5e2806cfaea2997d82d199c07b11543fe14e879fb1e80b8b1f95a847d817","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T11:46:31Z","title_canon_sha256":"6bec8dba0d70979b8646a04b3c00f356e0be562c94e8bb6148572da0679fdbaf"},"schema_version":"1.0","source":{"id":"1510.03041","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.03041","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"arxiv_version","alias_value":"1510.03041v3","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03041","created_at":"2026-05-18T00:52:34Z"},{"alias_kind":"pith_short_12","alias_value":"PVM2LYR6CFY4","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PVM2LYR6CFY4W64K","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PVM2LYR6","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:05901da48ac11fd68b4e4bc7a86cfe10d136cdab65baad7b792b435a5cf7fc29","target":"graph","created_at":"2026-05-18T00:52:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 $","authors_text":"Dimitrios M. Thilikos, Dimitris Chatzidimitriou, Ignasi Sau, Jean-Florent Raymond","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T11:46:31Z","title":"Minors in graphs of large ${\\theta}_r$-girth"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03041","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:7b51a1726f4882d3d4ee2a27d543e0efd107a38016cd2b7d9e00df51006bc394","target":"record","created_at":"2026-05-18T00:52:34Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"163f5e2806cfaea2997d82d199c07b11543fe14e879fb1e80b8b1f95a847d817","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-10-11T11:46:31Z","title_canon_sha256":"6bec8dba0d70979b8646a04b3c00f356e0be562c94e8bb6148572da0679fdbaf"},"schema_version":"1.0","source":{"id":"1510.03041","kind":"arxiv","version":3}},"canonical_sha256":"7d59a5e23e1171cb7b8a1b471c2efa9459e07d2cf03f9672df342eac826d7c18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d59a5e23e1171cb7b8a1b471c2efa9459e07d2cf03f9672df342eac826d7c18","first_computed_at":"2026-05-18T00:52:34.489068Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:34.489068Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2nSNPK49csG/RNMKeRy6ZLEMliAsVHAKHucTNz1ESTNk7TxrEnWMcaXeuFEWSYWUdfEIA16ZSgWXji4RoYM5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:34.489478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.03041","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b51a1726f4882d3d4ee2a27d543e0efd107a38016cd2b7d9e00df51006bc394","sha256:05901da48ac11fd68b4e4bc7a86cfe10d136cdab65baad7b792b435a5cf7fc29"],"state_sha256":"3643de0c30e4eea26464bdc3ab20a7c1e1cb8bf49f06ecaa64b58261b33c0e95"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k8fy6K9Nyw7MdgdWMp72HkxLUSD92R1alBFdPFRgTddrf+KREt2LXXNDJ7+4ST32t32SRqGgvXquvMiFLz4EDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T20:59:12.374290Z","bundle_sha256":"bb25581e856361105c4a701fd916d08020c8b0bc28dd65347453e197683bb1ba"}}