{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RGLKG7PXGCYLZHFVFMLVSY5WBV","short_pith_number":"pith:RGLKG7PX","schema_version":"1.0","canonical_sha256":"8996a37df730b0bc9cb52b175963b60d56c811245ec4d37484f6d52ab39f249b","source":{"kind":"arxiv","id":"1406.2438","version":1},"attestation_state":"computed","paper":{"title":"Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Dieter Rautenbach, Felix Joos, Michael A. Henning","submitted_at":"2014-06-10T06:53:43Z","abstract_excerpt":"We show that a cubic graph $G$ of order $n$ has an induced $2$-regular subgraph of order at least a) $\\frac{n-2}{4-\\frac{4}{k}}$, if $G$ has no induced cycle of length more than $k$, b) $\\frac{5n+6}{8}$, if $G$ has no induced cycle of length more than $4$, and $n>6$, and c) $\\left(\\frac{1}{4}+\\epsilon\\right)n$, if the independence number of $G$ is at most $\\left(\\frac{3}{8}-\\epsilon\\right)n$. To show the second result we give a precise structural description of cubic $4$-chordal graphs."},"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.2438","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T06:53:43Z","cross_cats_sorted":[],"title_canon_sha256":"6a25efa26396ba9fbc9d015e1617cd9772c7ddc38ad05dd6dcd1ed21b115986d","abstract_canon_sha256":"bfd6f9e29445ead210a04bdedc4e8bef71bfef43b388dde281a9f644b56ffe61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:01.678564Z","signature_b64":"bHAnc2CEqcnKiiW12vSpJnItJdzMC/Tdq9xZKwJN8W8bEdw0/KmiOkgqr+KFj5lUmN5XYQjElVYqLLTWNpTkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8996a37df730b0bc9cb52b175963b60d56c811245ec4d37484f6d52ab39f249b","last_reissued_at":"2026-05-18T02:50:01.678096Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:01.678096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christian L\\\"owenstein, Dieter Rautenbach, Felix Joos, Michael A. Henning","submitted_at":"2014-06-10T06:53:43Z","abstract_excerpt":"We show that a cubic graph $G$ of order $n$ has an induced $2$-regular subgraph of order at least a) $\\frac{n-2}{4-\\frac{4}{k}}$, if $G$ has no induced cycle of length more than $k$, b) $\\frac{5n+6}{8}$, if $G$ has no induced cycle of length more than $4$, and $n>6$, and c) $\\left(\\frac{1}{4}+\\epsilon\\right)n$, if the independence number of $G$ is at most $\\left(\\frac{3}{8}-\\epsilon\\right)n$. To show the second result we give a precise structural description of cubic $4$-chordal graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2438","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.2438","created_at":"2026-05-18T02:50:01.678158+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2438v1","created_at":"2026-05-18T02:50:01.678158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2438","created_at":"2026-05-18T02:50:01.678158+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGLKG7PXGCYL","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGLKG7PXGCYLZHFV","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGLKG7PX","created_at":"2026-05-18T12:28:46.137349+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/RGLKG7PXGCYLZHFVFMLVSY5WBV","json":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV.json","graph_json":"https://pith.science/api/pith-number/RGLKG7PXGCYLZHFVFMLVSY5WBV/graph.json","events_json":"https://pith.science/api/pith-number/RGLKG7PXGCYLZHFVFMLVSY5WBV/events.json","paper":"https://pith.science/paper/RGLKG7PX"},"agent_actions":{"view_html":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV","download_json":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV.json","view_paper":"https://pith.science/paper/RGLKG7PX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2438&json=true","fetch_graph":"https://pith.science/api/pith-number/RGLKG7PXGCYLZHFVFMLVSY5WBV/graph.json","fetch_events":"https://pith.science/api/pith-number/RGLKG7PXGCYLZHFVFMLVSY5WBV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/action/storage_attestation","attest_author":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/action/author_attestation","sign_citation":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/action/citation_signature","submit_replication":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/action/replication_record"}},"created_at":"2026-05-18T02:50:01.678158+00:00","updated_at":"2026-05-18T02:50:01.678158+00:00"}