{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:TO4N4V4PDG7ZFSQQ3MRZRLLR7N","short_pith_number":"pith:TO4N4V4P","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"},"canonical_sha256":"9bb8de578f19bf92ca10db2398ad71fb6169a1835c944c9161c7749333d33f5c","source":{"kind":"arxiv","id":"1501.05851","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05851","created_at":"2026-05-18T01:29:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05851v2","created_at":"2026-05-18T01:29:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05851","created_at":"2026-05-18T01:29:29Z"},{"alias_kind":"pith_short_12","alias_value":"TO4N4V4PDG7Z","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TO4N4V4PDG7ZFSQQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TO4N4V4P","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:TO4N4V4PDG7ZFSQQ3MRZRLLR7N","target":"record","payload":{"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"},"canonical_sha256":"9bb8de578f19bf92ca10db2398ad71fb6169a1835c944c9161c7749333d33f5c","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"},"source_kind":"arxiv","source_id":"1501.05851","source_version":2,"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-18T01:29:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gM4JAirfqmTeoDkd7UYbZVDzurUslhiOGx71H1jTrwXiFZ4JgVPlEO7y4DUygajn9bYsrubfiWGGmr7Jk4EuCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:57:23.806169Z"},"content_sha256":"44b061004497b3bb9a24fe290483a488b5190a68733199f16ab84b706d35a4d2","schema_version":"1.0","event_id":"sha256:44b061004497b3bb9a24fe290483a488b5190a68733199f16ab84b706d35a4d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:TO4N4V4PDG7ZFSQQ3MRZRLLR7N","target":"graph","payload":{"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"},"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-18T01:29:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qq8tCLZ3Oq4cU0ePKbf+v4zHmtRYm+7Maicwx4pKBT/9PkjUq5tRHbWv/efYulUN1ZQymbuq2hh0+QWrqlJMDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T22:57:23.806522Z"},"content_sha256":"b2ed8684840d802fc778d6bee40d5966677bd5b9fc1aaaf40f8e879265eeb4ea","schema_version":"1.0","event_id":"sha256:b2ed8684840d802fc778d6bee40d5966677bd5b9fc1aaaf40f8e879265eeb4ea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/bundle.json","state_url":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/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-07-03T22:57:23Z","links":{"resolver":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N","bundle":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/bundle.json","state":"https://pith.science/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TO4N4V4PDG7ZFSQQ3MRZRLLR7N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:TO4N4V4PDG7ZFSQQ3MRZRLLR7N","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":"fbac95c116edd601544876ddf7afc1e3a70cfe37130a4604aa201b298600b76b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T16:04:19Z","title_canon_sha256":"c7fa8b278698054438e5c98e58bd4ef7a05d5b0dd3355c1187728c1aa57f57ab"},"schema_version":"1.0","source":{"id":"1501.05851","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05851","created_at":"2026-05-18T01:29:29Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05851v2","created_at":"2026-05-18T01:29:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05851","created_at":"2026-05-18T01:29:29Z"},{"alias_kind":"pith_short_12","alias_value":"TO4N4V4PDG7Z","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"TO4N4V4PDG7ZFSQQ","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"TO4N4V4P","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:b2ed8684840d802fc778d6bee40d5966677bd5b9fc1aaaf40f8e879265eeb4ea","target":"graph","created_at":"2026-05-18T01:29:29Z","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":"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|})$.","authors_text":"Antonio Sassano, Paolo Nobili","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T16:04:19Z","title":"An ${\\cal O}(n\\sqrt{m})$ algorithm for the weighted stable set problem in {claw, net}-free graphs with $\\alpha(G) \\ge 4$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05851","kind":"arxiv","version":2},"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:44b061004497b3bb9a24fe290483a488b5190a68733199f16ab84b706d35a4d2","target":"record","created_at":"2026-05-18T01:29:29Z","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":"fbac95c116edd601544876ddf7afc1e3a70cfe37130a4604aa201b298600b76b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-23T16:04:19Z","title_canon_sha256":"c7fa8b278698054438e5c98e58bd4ef7a05d5b0dd3355c1187728c1aa57f57ab"},"schema_version":"1.0","source":{"id":"1501.05851","kind":"arxiv","version":2}},"canonical_sha256":"9bb8de578f19bf92ca10db2398ad71fb6169a1835c944c9161c7749333d33f5c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9bb8de578f19bf92ca10db2398ad71fb6169a1835c944c9161c7749333d33f5c","first_computed_at":"2026-05-18T01:29:29.594217Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:29:29.594217Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KQ4xN064CWxm51/Ms3JhqPwhR/G+Ud+nbJ8uvbLoZlQSv4FX4k9XRXqru+kPJ5/m5cu+yumI64wcjp67V8EqDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:29:29.594896Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05851","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44b061004497b3bb9a24fe290483a488b5190a68733199f16ab84b706d35a4d2","sha256:b2ed8684840d802fc778d6bee40d5966677bd5b9fc1aaaf40f8e879265eeb4ea"],"state_sha256":"b09a88e5b3b8592cc85ac89799ccd4e6125e88bcf1de9feb4a23571de9a0a245"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U3Pi6IpzNPKKc8ZPi8+lMgI5UL0JSnH0c3poArcAiJkxjBx3iqqt3+LOVeVaQFDfe8++XdBhuF0jGitP/Z2rCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T22:57:23.808400Z","bundle_sha256":"265fd9c08786a861a7a138aa206878c5d3679fd66c42505d2a5ce7b07ad3cab2"}}