{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:RGLKG7PXGCYLZHFVFMLVSY5WBV","short_pith_number":"pith:RGLKG7PX","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"},"canonical_sha256":"8996a37df730b0bc9cb52b175963b60d56c811245ec4d37484f6d52ab39f249b","source":{"kind":"arxiv","id":"1406.2438","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2438","created_at":"2026-05-18T02:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2438v1","created_at":"2026-05-18T02:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2438","created_at":"2026-05-18T02:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"RGLKG7PXGCYL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RGLKG7PXGCYLZHFV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RGLKG7PX","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:RGLKG7PXGCYLZHFVFMLVSY5WBV","target":"record","payload":{"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"},"canonical_sha256":"8996a37df730b0bc9cb52b175963b60d56c811245ec4d37484f6d52ab39f249b","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"},"source_kind":"arxiv","source_id":"1406.2438","source_version":1,"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-18T02:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EepKraQHL0vTtVbIh/wPXKUxcUk71XHKmtG7RJIJQAEHC3zK70sbwlzXGEJBl6WG7ASPuh0kAX5KPwlIoWUcDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:07:40.554703Z"},"content_sha256":"74977ad95b4f61fda3324ae3f82da7ee779e2559e3b2b6a919910831d1b53886","schema_version":"1.0","event_id":"sha256:74977ad95b4f61fda3324ae3f82da7ee779e2559e3b2b6a919910831d1b53886"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:RGLKG7PXGCYLZHFVFMLVSY5WBV","target":"graph","payload":{"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"},"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-18T02:50:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Px84sdZ2CjlQc6+l0fbske6cYVLTPkuOcKsVOVZ8ivj/pDSA57VTkz9y/OHTUfMKJ0Kzmd8Nia4mAstXQl/ZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:07:40.555033Z"},"content_sha256":"fe1c6929be37bc3c200a315bd907ad425e69ee89bfec35d99d432bf4b1a939f7","schema_version":"1.0","event_id":"sha256:fe1c6929be37bc3c200a315bd907ad425e69ee89bfec35d99d432bf4b1a939f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/bundle.json","state_url":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/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-06-04T05:07:40Z","links":{"resolver":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV","bundle":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/bundle.json","state":"https://pith.science/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RGLKG7PXGCYLZHFVFMLVSY5WBV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:RGLKG7PXGCYLZHFVFMLVSY5WBV","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":"bfd6f9e29445ead210a04bdedc4e8bef71bfef43b388dde281a9f644b56ffe61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T06:53:43Z","title_canon_sha256":"6a25efa26396ba9fbc9d015e1617cd9772c7ddc38ad05dd6dcd1ed21b115986d"},"schema_version":"1.0","source":{"id":"1406.2438","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2438","created_at":"2026-05-18T02:50:01Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2438v1","created_at":"2026-05-18T02:50:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2438","created_at":"2026-05-18T02:50:01Z"},{"alias_kind":"pith_short_12","alias_value":"RGLKG7PXGCYL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"RGLKG7PXGCYLZHFV","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"RGLKG7PX","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:fe1c6929be37bc3c200a315bd907ad425e69ee89bfec35d99d432bf4b1a939f7","target":"graph","created_at":"2026-05-18T02:50:01Z","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":"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.","authors_text":"Christian L\\\"owenstein, Dieter Rautenbach, Felix Joos, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T06:53:43Z","title":"Induced 2-Regular Subgraphs in k-Chordal Cubic Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2438","kind":"arxiv","version":1},"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:74977ad95b4f61fda3324ae3f82da7ee779e2559e3b2b6a919910831d1b53886","target":"record","created_at":"2026-05-18T02:50:01Z","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":"bfd6f9e29445ead210a04bdedc4e8bef71bfef43b388dde281a9f644b56ffe61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-10T06:53:43Z","title_canon_sha256":"6a25efa26396ba9fbc9d015e1617cd9772c7ddc38ad05dd6dcd1ed21b115986d"},"schema_version":"1.0","source":{"id":"1406.2438","kind":"arxiv","version":1}},"canonical_sha256":"8996a37df730b0bc9cb52b175963b60d56c811245ec4d37484f6d52ab39f249b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8996a37df730b0bc9cb52b175963b60d56c811245ec4d37484f6d52ab39f249b","first_computed_at":"2026-05-18T02:50:01.678096Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:01.678096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bHAnc2CEqcnKiiW12vSpJnItJdzMC/Tdq9xZKwJN8W8bEdw0/KmiOkgqr+KFj5lUmN5XYQjElVYqLLTWNpTkBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:01.678564Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2438","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74977ad95b4f61fda3324ae3f82da7ee779e2559e3b2b6a919910831d1b53886","sha256:fe1c6929be37bc3c200a315bd907ad425e69ee89bfec35d99d432bf4b1a939f7"],"state_sha256":"711fa5467ec9e103cca16172f70b26ca6c48371d3b501ef949c2c2f32ca1a6e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4I/bpmxKeUTP8Feqku9th94IJHyoWKgQc+HbuUolpTEp3w2WdJvbOP/tTbdkG72GSuVG28juGq1IwJtwXekzBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:07:40.556797Z","bundle_sha256":"c16a18414e02ef7562ffcb6379391c31c7fce06f85648cb92375e42b78b7f831"}}