{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:HV6ZYHHC4HUZEPV6WGWGYTBLSV","short_pith_number":"pith:HV6ZYHHC","schema_version":"1.0","canonical_sha256":"3d7d9c1ce2e1e9923ebeb1ac6c4c2b954e697a8ced4a8e2574a7451e7a042fa7","source":{"kind":"arxiv","id":"2505.23162","version":2},"attestation_state":"computed","paper":{"title":"Large induced subgraph with a given pathwidth in outerplanar graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hikaru Yokoi, Naoki Matsumoto, Takamasa Yashima","submitted_at":"2025-05-29T06:57:11Z","abstract_excerpt":"A long-standing conjecture by Albertson and Berman in 1979 states that every planar graph of order $n$ has an induced forest with at least $\\lceil \\frac{n}{2} \\rceil$ vertices. As a variant of this conjecture, Chappell conjectured that every planar graph of order $n$ has an induced linear forest with at least $\\lceil \\frac{4n}{9} \\rceil$ vertices. As a partial solution to the conjecture, Pelsmajer in 2004 proved that every outerplanar graph of order $n$ has an induced linear forest with at least $\\lceil \\frac{4n+2}{7}\\rceil$ vertices and this bound is sharp. In this paper, we investigate the o"},"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":"2505.23162","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DM","submitted_at":"2025-05-29T06:57:11Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"fed2a971c393f6812fa6e1c3b2939d21642c7092445834a22e7eb2ef788a8a6b","abstract_canon_sha256":"c271093d980bc039efbb9d61e9c2e9d4fdaf3bd259d06a7fba91d2db0f8d6154"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-10T01:08:27.957758Z","signature_b64":"nfVMiJak+R30xikw585uFCPMXgE4uwHXPPSQ3YvzgrTs3cPWf+02kDgsp1GCxJ/zPFL3lpT8FKvyoR6D6t/SAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d7d9c1ce2e1e9923ebeb1ac6c4c2b954e697a8ced4a8e2574a7451e7a042fa7","last_reissued_at":"2026-06-10T01:08:27.956725Z","signature_status":"signed_v1","first_computed_at":"2026-06-10T01:08:27.956725Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Large induced subgraph with a given pathwidth in outerplanar graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Hikaru Yokoi, Naoki Matsumoto, Takamasa Yashima","submitted_at":"2025-05-29T06:57:11Z","abstract_excerpt":"A long-standing conjecture by Albertson and Berman in 1979 states that every planar graph of order $n$ has an induced forest with at least $\\lceil \\frac{n}{2} \\rceil$ vertices. As a variant of this conjecture, Chappell conjectured that every planar graph of order $n$ has an induced linear forest with at least $\\lceil \\frac{4n}{9} \\rceil$ vertices. As a partial solution to the conjecture, Pelsmajer in 2004 proved that every outerplanar graph of order $n$ has an induced linear forest with at least $\\lceil \\frac{4n+2}{7}\\rceil$ vertices and this bound is sharp. In this paper, we investigate the o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23162","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.23162/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.23162","created_at":"2026-06-10T01:08:27.956881+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23162v2","created_at":"2026-06-10T01:08:27.956881+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23162","created_at":"2026-06-10T01:08:27.956881+00:00"},{"alias_kind":"pith_short_12","alias_value":"HV6ZYHHC4HUZ","created_at":"2026-06-10T01:08:27.956881+00:00"},{"alias_kind":"pith_short_16","alias_value":"HV6ZYHHC4HUZEPV6","created_at":"2026-06-10T01:08:27.956881+00:00"},{"alias_kind":"pith_short_8","alias_value":"HV6ZYHHC","created_at":"2026-06-10T01:08:27.956881+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/HV6ZYHHC4HUZEPV6WGWGYTBLSV","json":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV.json","graph_json":"https://pith.science/api/pith-number/HV6ZYHHC4HUZEPV6WGWGYTBLSV/graph.json","events_json":"https://pith.science/api/pith-number/HV6ZYHHC4HUZEPV6WGWGYTBLSV/events.json","paper":"https://pith.science/paper/HV6ZYHHC"},"agent_actions":{"view_html":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV","download_json":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV.json","view_paper":"https://pith.science/paper/HV6ZYHHC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23162&json=true","fetch_graph":"https://pith.science/api/pith-number/HV6ZYHHC4HUZEPV6WGWGYTBLSV/graph.json","fetch_events":"https://pith.science/api/pith-number/HV6ZYHHC4HUZEPV6WGWGYTBLSV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV/action/storage_attestation","attest_author":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV/action/author_attestation","sign_citation":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV/action/citation_signature","submit_replication":"https://pith.science/pith/HV6ZYHHC4HUZEPV6WGWGYTBLSV/action/replication_record"}},"created_at":"2026-06-10T01:08:27.956881+00:00","updated_at":"2026-06-10T01:08:27.956881+00:00"}