{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZNHSS3JLOWI3TMNU26NLYKIJBK","short_pith_number":"pith:ZNHSS3JL","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"},"canonical_sha256":"cb4f296d2b7591b9b1b4d79abc29090ab313a7c5a45da86989e4dd1ee138e972","source":{"kind":"arxiv","id":"1406.0606","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0606","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0606v1","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0606","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZNHSS3JLOWI3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNHSS3JLOWI3TMNU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNHSS3JL","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZNHSS3JLOWI3TMNU26NLYKIJBK","target":"record","payload":{"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"},"canonical_sha256":"cb4f296d2b7591b9b1b4d79abc29090ab313a7c5a45da86989e4dd1ee138e972","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"},"source_kind":"arxiv","source_id":"1406.0606","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:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8AX3/QbXsQbX5uLG36gi+G8rU2zulOaN8ARfP0gfqKdtYCYwT6d0DaVkj5xEJqWId5YoMtO2WtJwJRb03AxSBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:41:05.305485Z"},"content_sha256":"427226e45a68c10b6f4db5000e598e21ac04dde570127bafd9e2a8739099e45b","schema_version":"1.0","event_id":"sha256:427226e45a68c10b6f4db5000e598e21ac04dde570127bafd9e2a8739099e45b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZNHSS3JLOWI3TMNU26NLYKIJBK","target":"graph","payload":{"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"},"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:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mS4pK25rbUrV9l0G5t3YA1uFJGBf0crFOUiOgbg2qprwlTvIwYpfF3bWS4ampNHiCwEdBkf9nA8MD7w8WPULAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:41:05.306089Z"},"content_sha256":"23b9cb9d7150b6041a9e1ec07bcb778ba5f9713d07a2d1a1e5ecb4344dea7beb","schema_version":"1.0","event_id":"sha256:23b9cb9d7150b6041a9e1ec07bcb778ba5f9713d07a2d1a1e5ecb4344dea7beb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/bundle.json","state_url":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/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:41:05Z","links":{"resolver":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK","bundle":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/bundle.json","state":"https://pith.science/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZNHSS3JLOWI3TMNU26NLYKIJBK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZNHSS3JLOWI3TMNU26NLYKIJBK","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":"d585214e4d1b60a78a806f29ed7793f2c38305ee81d123d3644b427f99866dff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-03T07:38:46Z","title_canon_sha256":"2d968dfee4b6a6ff3e363718b1d18b8554c90a791f87ecd4cd6c823e02ba87ab"},"schema_version":"1.0","source":{"id":"1406.0606","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.0606","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"arxiv_version","alias_value":"1406.0606v1","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0606","created_at":"2026-05-18T02:50:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZNHSS3JLOWI3","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZNHSS3JLOWI3TMNU","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZNHSS3JL","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:23b9cb9d7150b6041a9e1ec07bcb778ba5f9713d07a2d1a1e5ecb4344dea7beb","target":"graph","created_at":"2026-05-18T02:50:33Z","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":"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.","authors_text":"Christian L\\\"owenstein, Felix Joos, Michael A. Henning, Thomas Sasse","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-03T07:38:46Z","title":"Induced Cycles in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0606","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:427226e45a68c10b6f4db5000e598e21ac04dde570127bafd9e2a8739099e45b","target":"record","created_at":"2026-05-18T02:50:33Z","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":"d585214e4d1b60a78a806f29ed7793f2c38305ee81d123d3644b427f99866dff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-06-03T07:38:46Z","title_canon_sha256":"2d968dfee4b6a6ff3e363718b1d18b8554c90a791f87ecd4cd6c823e02ba87ab"},"schema_version":"1.0","source":{"id":"1406.0606","kind":"arxiv","version":1}},"canonical_sha256":"cb4f296d2b7591b9b1b4d79abc29090ab313a7c5a45da86989e4dd1ee138e972","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb4f296d2b7591b9b1b4d79abc29090ab313a7c5a45da86989e4dd1ee138e972","first_computed_at":"2026-05-18T02:50:33.188652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:33.188652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G5CWfJZpmc5udWVsOFSUa8AI8S9zGD6KYLQ2xvwVgf73GKfkN+p7e1BObjHzQik73xLtn9PNV52r+haVHt1xCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:33.189306Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.0606","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:427226e45a68c10b6f4db5000e598e21ac04dde570127bafd9e2a8739099e45b","sha256:23b9cb9d7150b6041a9e1ec07bcb778ba5f9713d07a2d1a1e5ecb4344dea7beb"],"state_sha256":"30a89e13e5daeb0430d1c9d67171d8eb86b88d5168fffa0f8d7c23c526a75c40"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l1Zwvb0d+Ij5XR6zl7lSgZzob2fwhooHvZYweQtee5jacerJgfRFUL5VKFIHnBNnegl9Lze//UUA9iBO8JPbDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:41:05.309490Z","bundle_sha256":"6720c53945c5adf8e1cb4f6791751444d5a408ffbd5606d1f2f1a16fa08b8bc3"}}