{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UOIHJAMU5NJX3DG7KPOR736M4I","short_pith_number":"pith:UOIHJAMU","schema_version":"1.0","canonical_sha256":"a390748194eb537d8cdf53dd1fefcce2347df2638baef2089878fad594fde595","source":{"kind":"arxiv","id":"1707.04812","version":1},"attestation_state":"computed","paper":{"title":"Odd induced subgraphs in graphs with treewidth at most two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Jiaao Li, Lei Yu, Xinmin Hou","submitted_at":"2017-07-16T02:57:09Z","abstract_excerpt":"A long-standing conjecture asserts that there exists a constant $c>0$ such that every graph of order $n$ without isolated vertices contains an induced subgraph of order at least $cn$ with all degrees odd. Scott (1992) proved that every graph $G$ has an induced subgraph of order at least $|V(G)|/(2\\chi(G))$ with all degrees odd, where $\\chi(G)$ is the chromatic number of $G$, this implies the conjecture for graphs with { bounded} chromatic number. But the factor $1/(2\\chi(G))$ seems to be not best possible, for example, Radcliffe and Scott (1995) proved $c=\\frac 23$ for trees, Berman, Wang and "},"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":"1707.04812","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T02:57:09Z","cross_cats_sorted":[],"title_canon_sha256":"de040ac02579f14a8466a89afeee1de8a6bd38c25f90fbc854bb9f0c66a88fbb","abstract_canon_sha256":"ce694f7d0e7073c4b167a6f679d02e21a68a5300be29237293f9ec2b2f5715e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:12.149951Z","signature_b64":"4SpeT+g+ny9L7F2lvwHzpRkyRsZ96TvPxde9MohegBLN9/PcgSlsITt0qvUtLb+3gIvBobpw/GwA1FLVEg0ZBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a390748194eb537d8cdf53dd1fefcce2347df2638baef2089878fad594fde595","last_reissued_at":"2026-05-18T00:40:12.149179Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:12.149179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Odd induced subgraphs in graphs with treewidth at most two","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Boyuan Liu, Jiaao Li, Lei Yu, Xinmin Hou","submitted_at":"2017-07-16T02:57:09Z","abstract_excerpt":"A long-standing conjecture asserts that there exists a constant $c>0$ such that every graph of order $n$ without isolated vertices contains an induced subgraph of order at least $cn$ with all degrees odd. Scott (1992) proved that every graph $G$ has an induced subgraph of order at least $|V(G)|/(2\\chi(G))$ with all degrees odd, where $\\chi(G)$ is the chromatic number of $G$, this implies the conjecture for graphs with { bounded} chromatic number. But the factor $1/(2\\chi(G))$ seems to be not best possible, for example, Radcliffe and Scott (1995) proved $c=\\frac 23$ for trees, Berman, Wang and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04812","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":"1707.04812","created_at":"2026-05-18T00:40:12.149310+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.04812v1","created_at":"2026-05-18T00:40:12.149310+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04812","created_at":"2026-05-18T00:40:12.149310+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOIHJAMU5NJX","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOIHJAMU5NJX3DG7","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOIHJAMU","created_at":"2026-05-18T12:31:46.661854+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/UOIHJAMU5NJX3DG7KPOR736M4I","json":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I.json","graph_json":"https://pith.science/api/pith-number/UOIHJAMU5NJX3DG7KPOR736M4I/graph.json","events_json":"https://pith.science/api/pith-number/UOIHJAMU5NJX3DG7KPOR736M4I/events.json","paper":"https://pith.science/paper/UOIHJAMU"},"agent_actions":{"view_html":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I","download_json":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I.json","view_paper":"https://pith.science/paper/UOIHJAMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.04812&json=true","fetch_graph":"https://pith.science/api/pith-number/UOIHJAMU5NJX3DG7KPOR736M4I/graph.json","fetch_events":"https://pith.science/api/pith-number/UOIHJAMU5NJX3DG7KPOR736M4I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/action/storage_attestation","attest_author":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/action/author_attestation","sign_citation":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/action/citation_signature","submit_replication":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/action/replication_record"}},"created_at":"2026-05-18T00:40:12.149310+00:00","updated_at":"2026-05-18T00:40:12.149310+00:00"}