{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZNHSS3JLOWI3TMNU26NLYKIJBK","short_pith_number":"pith:ZNHSS3JL","schema_version":"1.0","canonical_sha256":"cb4f296d2b7591b9b1b4d79abc29090ab313a7c5a45da86989e4dd1ee138e972","source":{"kind":"arxiv","id":"1406.0606","version":1},"attestation_state":"computed","paper":{"title":"Induced Cycles in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Felix Joos, Michael A. Henning, Thomas Sasse","submitted_at":"2014-06-03T07:38:46Z","abstract_excerpt":"The maximum cardinality of an induced $2$-regular subgraph of a graph $G$ is denoted by $c_{\\rm ind}(G)$. We prove that if $G$ is an $r$-regular graph of order $n$, then $c_{\\rm ind}(G) \\geq \\frac{n}{2(r-1)} + \\frac{1}{(r-1)(r-2)}$ and we prove that if $G$ is a cubic claw-free graph on order $n$, then $c_{\\rm ind}(G) > 13n/20$ and this bound is asymptotically best possible."},"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":"1406.0606","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-03T07:38:46Z","cross_cats_sorted":[],"title_canon_sha256":"2d968dfee4b6a6ff3e363718b1d18b8554c90a791f87ecd4cd6c823e02ba87ab","abstract_canon_sha256":"d585214e4d1b60a78a806f29ed7793f2c38305ee81d123d3644b427f99866dff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:33.189306Z","signature_b64":"G5CWfJZpmc5udWVsOFSUa8AI8S9zGD6KYLQ2xvwVgf73GKfkN+p7e1BObjHzQik73xLtn9PNV52r+haVHt1xCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb4f296d2b7591b9b1b4d79abc29090ab313a7c5a45da86989e4dd1ee138e972","last_reissued_at":"2026-05-18T02:50:33.188652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:33.188652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced Cycles in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Felix Joos, Michael A. Henning, Thomas Sasse","submitted_at":"2014-06-03T07:38:46Z","abstract_excerpt":"The maximum cardinality of an induced $2$-regular subgraph of a graph $G$ is denoted by $c_{\\rm ind}(G)$. We prove that if $G$ is an $r$-regular graph of order $n$, then $c_{\\rm ind}(G) \\geq \\frac{n}{2(r-1)} + \\frac{1}{(r-1)(r-2)}$ and we prove that if $G$ is a cubic claw-free graph on order $n$, then $c_{\\rm ind}(G) > 13n/20$ and this bound is asymptotically best possible."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0606","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":"1406.0606","created_at":"2026-05-18T02:50:33.188753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0606v1","created_at":"2026-05-18T02:50:33.188753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0606","created_at":"2026-05-18T02:50:33.188753+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNHSS3JLOWI3","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNHSS3JLOWI3TMNU","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNHSS3JL","created_at":"2026-05-18T12:28:59.999130+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/ZNHSS3JLOWI3TMNU26NLYKIJBK","json":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK.json","graph_json":"https://pith.science/api/pith-number/ZNHSS3JLOWI3TMNU26NLYKIJBK/graph.json","events_json":"https://pith.science/api/pith-number/ZNHSS3JLOWI3TMNU26NLYKIJBK/events.json","paper":"https://pith.science/paper/ZNHSS3JL"},"agent_actions":{"view_html":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK","download_json":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK.json","view_paper":"https://pith.science/paper/ZNHSS3JL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0606&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNHSS3JLOWI3TMNU26NLYKIJBK/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNHSS3JLOWI3TMNU26NLYKIJBK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/action/storage_attestation","attest_author":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/action/author_attestation","sign_citation":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/action/citation_signature","submit_replication":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/action/replication_record"}},"created_at":"2026-05-18T02:50:33.188753+00:00","updated_at":"2026-05-18T02:50:33.188753+00:00"}