{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VEGMY4ESGDS3Y2M2UYOLBHVR4G","short_pith_number":"pith:VEGMY4ES","canonical_record":{"source":{"id":"1701.01953","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-08T12:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"2355015c4831ce2057501b23f4f7eb927ba3816e3c72e5ef91e3bb34f070f956","abstract_canon_sha256":"3fd7d45e44639e1af584bad48baa4a7c30c8ad90d88bec513c49ae1be85fed98"},"schema_version":"1.0"},"canonical_sha256":"a90ccc709230e5bc699aa61cb09eb1e19194b1b82fddd11e0b7ac68e2f89a085","source":{"kind":"arxiv","id":"1701.01953","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01953","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01953v3","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01953","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"VEGMY4ESGDS3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VEGMY4ESGDS3Y2M2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VEGMY4ES","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VEGMY4ESGDS3Y2M2UYOLBHVR4G","target":"record","payload":{"canonical_record":{"source":{"id":"1701.01953","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-08T12:58:54Z","cross_cats_sorted":[],"title_canon_sha256":"2355015c4831ce2057501b23f4f7eb927ba3816e3c72e5ef91e3bb34f070f956","abstract_canon_sha256":"3fd7d45e44639e1af584bad48baa4a7c30c8ad90d88bec513c49ae1be85fed98"},"schema_version":"1.0"},"canonical_sha256":"a90ccc709230e5bc699aa61cb09eb1e19194b1b82fddd11e0b7ac68e2f89a085","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:24.245197Z","signature_b64":"TMEm6LZX6kcoV0If3gGVdQQFAMvinqt+au1jyPz56/e5X8YEQwqUSW0Ki3tmiyswo+/SpSqhY3K/RqX7bE1iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a90ccc709230e5bc699aa61cb09eb1e19194b1b82fddd11e0b7ac68e2f89a085","last_reissued_at":"2026-05-18T00:05:24.244659Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:24.244659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.01953","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:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mAvbJnBKkAAsajXUL6zP4en+t8f2+QV24QcCyZdMikx8QMmC6h+bO/+1wGTncirR884KXScmlKLYqLAwFVr5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:36:36.778153Z"},"content_sha256":"717df419d7cee673c156a4d1742dc9a0c468d88f11169b14b389fb54ca0cc6ba","schema_version":"1.0","event_id":"sha256:717df419d7cee673c156a4d1742dc9a0c468d88f11169b14b389fb54ca0cc6ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VEGMY4ESGDS3Y2M2UYOLBHVR4G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decycling Number of Linear Graphs of Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jian Wang, Xirong Xu","submitted_at":"2017-01-08T12:58:54Z","abstract_excerpt":"The decycling number of a graph $G$ is the minimum number of vertices whose removal from $G$ results in an acyclic subgraph. It is known that determining the decycling number of a graph $G$ is equivalent to finding the maximum induced forests of $G$. The line graphs of trees are the claw-free block graphs. These graphs have been used by Erd\\H{o}s, Saks and S\\'{o}s to construct graphs with a given number of edges and vertices whose maximum induced tree is very small. In this paper, we give bounds on the decycling number of line graphs of trees and construct extremal trees to show that these bou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01953","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:05:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"veiqsYpYyXxoNZn4MDKlL3mQ8ngmi6jqLuj9Vu8XzMiUKjoELHLx2Pf++nkqpOoCcIoAuNDtaxh/qg0LC+aoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:36:36.778773Z"},"content_sha256":"1a2495fe603b9a13d5e40c2a20d0a31de17d42064b78ef4204ad0b2b37fcb567","schema_version":"1.0","event_id":"sha256:1a2495fe603b9a13d5e40c2a20d0a31de17d42064b78ef4204ad0b2b37fcb567"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VEGMY4ESGDS3Y2M2UYOLBHVR4G/bundle.json","state_url":"https://pith.science/pith/VEGMY4ESGDS3Y2M2UYOLBHVR4G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VEGMY4ESGDS3Y2M2UYOLBHVR4G/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-25T19:36:36Z","links":{"resolver":"https://pith.science/pith/VEGMY4ESGDS3Y2M2UYOLBHVR4G","bundle":"https://pith.science/pith/VEGMY4ESGDS3Y2M2UYOLBHVR4G/bundle.json","state":"https://pith.science/pith/VEGMY4ESGDS3Y2M2UYOLBHVR4G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VEGMY4ESGDS3Y2M2UYOLBHVR4G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VEGMY4ESGDS3Y2M2UYOLBHVR4G","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":"3fd7d45e44639e1af584bad48baa4a7c30c8ad90d88bec513c49ae1be85fed98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-08T12:58:54Z","title_canon_sha256":"2355015c4831ce2057501b23f4f7eb927ba3816e3c72e5ef91e3bb34f070f956"},"schema_version":"1.0","source":{"id":"1701.01953","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.01953","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"arxiv_version","alias_value":"1701.01953v3","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.01953","created_at":"2026-05-18T00:05:24Z"},{"alias_kind":"pith_short_12","alias_value":"VEGMY4ESGDS3","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VEGMY4ESGDS3Y2M2","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VEGMY4ES","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:1a2495fe603b9a13d5e40c2a20d0a31de17d42064b78ef4204ad0b2b37fcb567","target":"graph","created_at":"2026-05-18T00:05:24Z","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 decycling number of a graph $G$ is the minimum number of vertices whose removal from $G$ results in an acyclic subgraph. It is known that determining the decycling number of a graph $G$ is equivalent to finding the maximum induced forests of $G$. The line graphs of trees are the claw-free block graphs. These graphs have been used by Erd\\H{o}s, Saks and S\\'{o}s to construct graphs with a given number of edges and vertices whose maximum induced tree is very small. In this paper, we give bounds on the decycling number of line graphs of trees and construct extremal trees to show that these bou","authors_text":"Jian Wang, Xirong Xu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-08T12:58:54Z","title":"Decycling Number of Linear Graphs of Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.01953","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:717df419d7cee673c156a4d1742dc9a0c468d88f11169b14b389fb54ca0cc6ba","target":"record","created_at":"2026-05-18T00:05:24Z","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":"3fd7d45e44639e1af584bad48baa4a7c30c8ad90d88bec513c49ae1be85fed98","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-01-08T12:58:54Z","title_canon_sha256":"2355015c4831ce2057501b23f4f7eb927ba3816e3c72e5ef91e3bb34f070f956"},"schema_version":"1.0","source":{"id":"1701.01953","kind":"arxiv","version":3}},"canonical_sha256":"a90ccc709230e5bc699aa61cb09eb1e19194b1b82fddd11e0b7ac68e2f89a085","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a90ccc709230e5bc699aa61cb09eb1e19194b1b82fddd11e0b7ac68e2f89a085","first_computed_at":"2026-05-18T00:05:24.244659Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:24.244659Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TMEm6LZX6kcoV0If3gGVdQQFAMvinqt+au1jyPz56/e5X8YEQwqUSW0Ki3tmiyswo+/SpSqhY3K/RqX7bE1iCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:24.245197Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.01953","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:717df419d7cee673c156a4d1742dc9a0c468d88f11169b14b389fb54ca0cc6ba","sha256:1a2495fe603b9a13d5e40c2a20d0a31de17d42064b78ef4204ad0b2b37fcb567"],"state_sha256":"8abeca3283aa421f5d73219bb46dd6de559e2a7b8d168f52d981f774a68b6795"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PSfNnbrsF+eoRL/M3S3Zohoik3BN/bNMeOFZiLdZs9s/Q2vkC3QSDS99TPxgxYcfXEfkZWptnCSOFSa7ECaXCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:36:36.782342Z","bundle_sha256":"e9976bb2bedaa20ceb8dfb1aa9c5c733e0c04289df098696bb86bb40e10c4eee"}}