{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HSO5LHATA2HSUWG7ITVUYHZHRB","short_pith_number":"pith:HSO5LHAT","schema_version":"1.0","canonical_sha256":"3c9dd59c13068f2a58df44eb4c1f27884aa1829802b3f4297daf1c0a1de6ef87","source":{"kind":"arxiv","id":"1306.5594","version":3},"attestation_state":"computed","paper":{"title":"Stable Sets and Graphs with no Even Holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bert Gerards, Kanstantsin Pashkovich, Michele Conforti","submitted_at":"2013-06-24T12:27:10Z","abstract_excerpt":"We develop decomposition/composition tools for efficiently solving maximum weight stable sets problems as well as for describing them as polynomially sized linear programs (using \"compact systems\"). Some of these are well-known but need some extra work to yield polynomial \"decomposition schemes\".\n  We apply the tools to graphs with no even hole and no cap. A hole is a chordless cycle of length greater than three and a cap is a hole together with an additional node that is adjacent to two adjacent nodes of the hole and that has no other neighbors on the hole."},"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":"1306.5594","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-06-24T12:27:10Z","cross_cats_sorted":[],"title_canon_sha256":"0931c98a5e9945c240f259bb5075881a534b07062f92e0ff2845161594a923aa","abstract_canon_sha256":"9e54d3ba84bc473f67f64cee382a7b98b0ee276b0ec4ae845fc076aba2c93127"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:08.628041Z","signature_b64":"bfWeucnLTEcxbWQrEP/higib9G068yF1a0TWSiBCYtgG5pZ+rJtziJOiQC5utYU04w2KBSi5JK9OTLFxYRd2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c9dd59c13068f2a58df44eb4c1f27884aa1829802b3f4297daf1c0a1de6ef87","last_reissued_at":"2026-05-18T02:30:08.627583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:08.627583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Stable Sets and Graphs with no Even Holes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bert Gerards, Kanstantsin Pashkovich, Michele Conforti","submitted_at":"2013-06-24T12:27:10Z","abstract_excerpt":"We develop decomposition/composition tools for efficiently solving maximum weight stable sets problems as well as for describing them as polynomially sized linear programs (using \"compact systems\"). Some of these are well-known but need some extra work to yield polynomial \"decomposition schemes\".\n  We apply the tools to graphs with no even hole and no cap. A hole is a chordless cycle of length greater than three and a cap is a hole together with an additional node that is adjacent to two adjacent nodes of the hole and that has no other neighbors on the hole."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.5594","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.5594","created_at":"2026-05-18T02:30:08.627661+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.5594v3","created_at":"2026-05-18T02:30:08.627661+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.5594","created_at":"2026-05-18T02:30:08.627661+00:00"},{"alias_kind":"pith_short_12","alias_value":"HSO5LHATA2HS","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HSO5LHATA2HSUWG7","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HSO5LHAT","created_at":"2026-05-18T12:27:46.883200+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/HSO5LHATA2HSUWG7ITVUYHZHRB","json":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB.json","graph_json":"https://pith.science/api/pith-number/HSO5LHATA2HSUWG7ITVUYHZHRB/graph.json","events_json":"https://pith.science/api/pith-number/HSO5LHATA2HSUWG7ITVUYHZHRB/events.json","paper":"https://pith.science/paper/HSO5LHAT"},"agent_actions":{"view_html":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB","download_json":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB.json","view_paper":"https://pith.science/paper/HSO5LHAT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.5594&json=true","fetch_graph":"https://pith.science/api/pith-number/HSO5LHATA2HSUWG7ITVUYHZHRB/graph.json","fetch_events":"https://pith.science/api/pith-number/HSO5LHATA2HSUWG7ITVUYHZHRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB/action/storage_attestation","attest_author":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB/action/author_attestation","sign_citation":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB/action/citation_signature","submit_replication":"https://pith.science/pith/HSO5LHATA2HSUWG7ITVUYHZHRB/action/replication_record"}},"created_at":"2026-05-18T02:30:08.627661+00:00","updated_at":"2026-05-18T02:30:08.627661+00:00"}