{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:UIKHBZNWIIGMSZQCJX6WZDYQHO","short_pith_number":"pith:UIKHBZNW","schema_version":"1.0","canonical_sha256":"a21470e5b6420cc966024dfd6c8f103baca3ed09ecaede4e5cf8b5c3941b3680","source":{"kind":"arxiv","id":"1609.06961","version":2},"attestation_state":"computed","paper":{"title":"Graphs vertex-partitionable into strong cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ademir Hujdurovi\\'c, Bernard Ries, Martin Milani\\v{c}","submitted_at":"2016-09-22T13:18:56Z","abstract_excerpt":"A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called localizable graphs and defined as graphs having a partition of the vertex set into strong cliques, where a clique in a graph is strong if it intersects all maximal independent sets. Yamashita and Kameda observed that all well-covered trees are localizable, pointed out that the converse inclusion fails in general, and asked for a characterization of localizable graphs.\n  In this paper we obtain several structural and algo"},"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":"1609.06961","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-09-22T13:18:56Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"8b3313c91e150e07d4a4a3544d3c962aab4fa95d654a5985e05e556de38131ed","abstract_canon_sha256":"2e8c791c836c5a211e98f8cb18121bc2d00a65e19ec1aadc829a44f9d8932d4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:17.191996Z","signature_b64":"4Gm9Mg5wMIG9VJJq8ZzdQ5u9ApfwLvvOI02wMuQnrqXXKvFbu/quqmWgYtt7fgls8O5TXMaYyodnabAzJMndBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a21470e5b6420cc966024dfd6c8f103baca3ed09ecaede4e5cf8b5c3941b3680","last_reissued_at":"2026-05-18T00:53:17.191297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:17.191297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs vertex-partitionable into strong cliques","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Ademir Hujdurovi\\'c, Bernard Ries, Martin Milani\\v{c}","submitted_at":"2016-09-22T13:18:56Z","abstract_excerpt":"A graph is said to be well-covered if all its maximal independent sets are of the same size. In 1999, Yamashita and Kameda introduced a subclass of well-covered graphs, called localizable graphs and defined as graphs having a partition of the vertex set into strong cliques, where a clique in a graph is strong if it intersects all maximal independent sets. Yamashita and Kameda observed that all well-covered trees are localizable, pointed out that the converse inclusion fails in general, and asked for a characterization of localizable graphs.\n  In this paper we obtain several structural and algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.06961","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":"1609.06961","created_at":"2026-05-18T00:53:17.191433+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.06961v2","created_at":"2026-05-18T00:53:17.191433+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.06961","created_at":"2026-05-18T00:53:17.191433+00:00"},{"alias_kind":"pith_short_12","alias_value":"UIKHBZNWIIGM","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"UIKHBZNWIIGMSZQC","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"UIKHBZNW","created_at":"2026-05-18T12:30:46.583412+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/UIKHBZNWIIGMSZQCJX6WZDYQHO","json":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO.json","graph_json":"https://pith.science/api/pith-number/UIKHBZNWIIGMSZQCJX6WZDYQHO/graph.json","events_json":"https://pith.science/api/pith-number/UIKHBZNWIIGMSZQCJX6WZDYQHO/events.json","paper":"https://pith.science/paper/UIKHBZNW"},"agent_actions":{"view_html":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO","download_json":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO.json","view_paper":"https://pith.science/paper/UIKHBZNW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.06961&json=true","fetch_graph":"https://pith.science/api/pith-number/UIKHBZNWIIGMSZQCJX6WZDYQHO/graph.json","fetch_events":"https://pith.science/api/pith-number/UIKHBZNWIIGMSZQCJX6WZDYQHO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO/action/storage_attestation","attest_author":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO/action/author_attestation","sign_citation":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO/action/citation_signature","submit_replication":"https://pith.science/pith/UIKHBZNWIIGMSZQCJX6WZDYQHO/action/replication_record"}},"created_at":"2026-05-18T00:53:17.191433+00:00","updated_at":"2026-05-18T00:53:17.191433+00:00"}