{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TO4N4V4PDG7ZFSQQ3MRZRLLR7N","short_pith_number":"pith:TO4N4V4P","schema_version":"1.0","canonical_sha256":"9bb8de578f19bf92ca10db2398ad71fb6169a1835c944c9161c7749333d33f5c","source":{"kind":"arxiv","id":"1501.05851","version":2},"attestation_state":"computed","paper":{"title":"An ${\\cal O}(n\\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $\\alpha(G) \\ge 4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Antonio Sassano, Paolo Nobili","submitted_at":"2015-01-23T16:04:19Z","abstract_excerpt":"In this paper we show that a connected {claw, net}-free graph $G(V, E)$ with $\\alpha(G) \\ge 4$ is the union of a strongly bisimplicial clique $Q$ and at most two clique-strips. A clique is strongly bisimplicial if its neighborhood is partitioned into two cliques which are mutually non-adjacent and a clique-strip is a sequence of cliques $\\{H_0, \\dots, H_p\\}$ with the property that $H_i$ is adjacent only to $H_{i-1}$ and $H_{i+1}$. By exploiting such a structure we show how to solve the Maximum Weight Stable Set Problem in such a graph in time ${\\cal O}(|V|\\sqrt{|E|})$."},"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":"1501.05851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T16:04:19Z","cross_cats_sorted":[],"title_canon_sha256":"c7fa8b278698054438e5c98e58bd4ef7a05d5b0dd3355c1187728c1aa57f57ab","abstract_canon_sha256":"fbac95c116edd601544876ddf7afc1e3a70cfe37130a4604aa201b298600b76b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:29.594896Z","signature_b64":"KQ4xN064CWxm51/Ms3JhqPwhR/G+Ud+nbJ8uvbLoZlQSv4FX4k9XRXqru+kPJ5/m5cu+yumI64wcjp67V8EqDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9bb8de578f19bf92ca10db2398ad71fb6169a1835c944c9161c7749333d33f5c","last_reissued_at":"2026-05-18T01:29:29.594217Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:29.594217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An ${\\cal O}(n\\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $\\alpha(G) \\ge 4$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Antonio Sassano, Paolo Nobili","submitted_at":"2015-01-23T16:04:19Z","abstract_excerpt":"In this paper we show that a connected {claw, net}-free graph $G(V, E)$ with $\\alpha(G) \\ge 4$ is the union of a strongly bisimplicial clique $Q$ and at most two clique-strips. A clique is strongly bisimplicial if its neighborhood is partitioned into two cliques which are mutually non-adjacent and a clique-strip is a sequence of cliques $\\{H_0, \\dots, H_p\\}$ with the property that $H_i$ is adjacent only to $H_{i-1}$ and $H_{i+1}$. By exploiting such a structure we show how to solve the Maximum Weight Stable Set Problem in such a graph in time ${\\cal O}(|V|\\sqrt{|E|})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05851","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":""},"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":"1501.05851","created_at":"2026-05-18T01:29:29.594340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05851v2","created_at":"2026-05-18T01:29:29.594340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05851","created_at":"2026-05-18T01:29:29.594340+00:00"},{"alias_kind":"pith_short_12","alias_value":"TO4N4V4PDG7Z","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TO4N4V4PDG7ZFSQQ","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TO4N4V4P","created_at":"2026-05-18T12:29:42.218222+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/TO4N4V4PDG7ZFSQQ3MRZRLLR7N","json":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N.json","graph_json":"https://pith.science/api/pith-number/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/graph.json","events_json":"https://pith.science/api/pith-number/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/events.json","paper":"https://pith.science/paper/TO4N4V4P"},"agent_actions":{"view_html":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N","download_json":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N.json","view_paper":"https://pith.science/paper/TO4N4V4P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05851&json=true","fetch_graph":"https://pith.science/api/pith-number/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/graph.json","fetch_events":"https://pith.science/api/pith-number/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/action/storage_attestation","attest_author":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/action/author_attestation","sign_citation":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/action/citation_signature","submit_replication":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/action/replication_record"}},"created_at":"2026-05-18T01:29:29.594340+00:00","updated_at":"2026-05-18T01:29:29.594340+00:00"}