{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UOIHJAMU5NJX3DG7KPOR736M4I","short_pith_number":"pith:UOIHJAMU","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"},"canonical_sha256":"a390748194eb537d8cdf53dd1fefcce2347df2638baef2089878fad594fde595","source":{"kind":"arxiv","id":"1707.04812","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04812","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04812v1","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04812","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"UOIHJAMU5NJX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOIHJAMU5NJX3DG7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOIHJAMU","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UOIHJAMU5NJX3DG7KPOR736M4I","target":"record","payload":{"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"},"canonical_sha256":"a390748194eb537d8cdf53dd1fefcce2347df2638baef2089878fad594fde595","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"},"source_kind":"arxiv","source_id":"1707.04812","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-18T00:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"luu5p1XUIWx/pBg3/tCCO2xvxnmu0w2YyvkWMZZ4zdBhsmmuLAfQKoPbLs/wBK8PGctgi4AoSYkCXi3e4yEGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:46:28.687610Z"},"content_sha256":"0c35795c1660916f0dd45e6bd8e9bd0f87ee7c630db8413e7ccf07936e17c82e","schema_version":"1.0","event_id":"sha256:0c35795c1660916f0dd45e6bd8e9bd0f87ee7c630db8413e7ccf07936e17c82e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UOIHJAMU5NJX3DG7KPOR736M4I","target":"graph","payload":{"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"},"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:40:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umG1q7UuYAMIbyit3mLcWXEr6s/DRjYLfi14s4pn1THdiOqqts2eOHEyFy8OdHypOlBU8ZLTTC7We0UvsOkCAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:46:28.687949Z"},"content_sha256":"273dc0a737399454eabca4ab011415c0c54169f3bff2f28d524a4ae83f7d7627","schema_version":"1.0","event_id":"sha256:273dc0a737399454eabca4ab011415c0c54169f3bff2f28d524a4ae83f7d7627"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/bundle.json","state_url":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UOIHJAMU5NJX3DG7KPOR736M4I/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-01T20:46:28Z","links":{"resolver":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I","bundle":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/bundle.json","state":"https://pith.science/pith/UOIHJAMU5NJX3DG7KPOR736M4I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UOIHJAMU5NJX3DG7KPOR736M4I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UOIHJAMU5NJX3DG7KPOR736M4I","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":"ce694f7d0e7073c4b167a6f679d02e21a68a5300be29237293f9ec2b2f5715e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T02:57:09Z","title_canon_sha256":"de040ac02579f14a8466a89afeee1de8a6bd38c25f90fbc854bb9f0c66a88fbb"},"schema_version":"1.0","source":{"id":"1707.04812","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.04812","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"arxiv_version","alias_value":"1707.04812v1","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.04812","created_at":"2026-05-18T00:40:12Z"},{"alias_kind":"pith_short_12","alias_value":"UOIHJAMU5NJX","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"UOIHJAMU5NJX3DG7","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"UOIHJAMU","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:273dc0a737399454eabca4ab011415c0c54169f3bff2f28d524a4ae83f7d7627","target":"graph","created_at":"2026-05-18T00:40:12Z","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":"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 ","authors_text":"Boyuan Liu, Jiaao Li, Lei Yu, Xinmin Hou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T02:57:09Z","title":"Odd induced subgraphs in graphs with treewidth at most two"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.04812","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:0c35795c1660916f0dd45e6bd8e9bd0f87ee7c630db8413e7ccf07936e17c82e","target":"record","created_at":"2026-05-18T00:40:12Z","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":"ce694f7d0e7073c4b167a6f679d02e21a68a5300be29237293f9ec2b2f5715e2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-07-16T02:57:09Z","title_canon_sha256":"de040ac02579f14a8466a89afeee1de8a6bd38c25f90fbc854bb9f0c66a88fbb"},"schema_version":"1.0","source":{"id":"1707.04812","kind":"arxiv","version":1}},"canonical_sha256":"a390748194eb537d8cdf53dd1fefcce2347df2638baef2089878fad594fde595","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a390748194eb537d8cdf53dd1fefcce2347df2638baef2089878fad594fde595","first_computed_at":"2026-05-18T00:40:12.149179Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:12.149179Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4SpeT+g+ny9L7F2lvwHzpRkyRsZ96TvPxde9MohegBLN9/PcgSlsITt0qvUtLb+3gIvBobpw/GwA1FLVEg0ZBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:12.149951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.04812","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c35795c1660916f0dd45e6bd8e9bd0f87ee7c630db8413e7ccf07936e17c82e","sha256:273dc0a737399454eabca4ab011415c0c54169f3bff2f28d524a4ae83f7d7627"],"state_sha256":"a3ee092eb6b1d37f92311f553c19da3fd54cc02985452e59ba832ac436502631"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3aai9088nsHBVXWJ7ygMYTTwa+9qKP91UGMEQJ8F15DC88s95+RCUgSxZOD02W9jo33TAPj7Sfe72pkzAq3HBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:46:28.689743Z","bundle_sha256":"c692df2ea2a5b2d92c421744c91fcc8ec852a51883c58eea812cb9b20c7c2558"}}