{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:2IVCYOOHO3O66JQBLCJNASKGU7","short_pith_number":"pith:2IVCYOOH","schema_version":"1.0","canonical_sha256":"d22a2c39c776ddef26015892d04946a7eb3cab6f9493ec0d6a8e6e82b8172f11","source":{"kind":"arxiv","id":"1103.2601","version":1},"attestation_state":"computed","paper":{"title":"A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Claudia Snels, Gianpaolo Oriolo, Yuri Faenza","submitted_at":"2011-03-14T08:20:40Z","abstract_excerpt":"We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a simple algorithm that in at most |E(G)| steps builds a new graph G' without proper and homogeneous pairs of cliques, and such that G and G' agree on the value of some relevant invariant (or property)."},"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":"1103.2601","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-03-14T08:20:40Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e1681a47be9b1664f417ae14766728cf130de9d6aa0c4302f424d5dd3408900b","abstract_canon_sha256":"ffaa00dc0e569c2470ca6c7cc81c1dcaaf4730d494890ec338044d0388507c9a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:26:55.026203Z","signature_b64":"ltb7XJbf0MctwG0Q6kEiM19FbfCJmr9wWug7xckySzk45cP/KEiHKQOIUjVnqjUpgtKJKWG43Kcgkc+6mA2aCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d22a2c39c776ddef26015892d04946a7eb3cab6f9493ec0d6a8e6e82b8172f11","last_reissued_at":"2026-05-18T04:26:55.025491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:26:55.025491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast algorithm to remove proper and homogenous pairs of cliques (while preserving some graph invariants)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"math.OC","authors_text":"Claudia Snels, Gianpaolo Oriolo, Yuri Faenza","submitted_at":"2011-03-14T08:20:40Z","abstract_excerpt":"We introduce a family of reductions for removing proper and homogeneous pairs of cliques from a graph G. This family generalizes some routines presented in the literature, mostly in the context of claw-free graphs. These reductions can be embedded in a simple algorithm that in at most |E(G)| steps builds a new graph G' without proper and homogeneous pairs of cliques, and such that G and G' agree on the value of some relevant invariant (or property)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.2601","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1103.2601","created_at":"2026-05-18T04:26:55.025619+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.2601v1","created_at":"2026-05-18T04:26:55.025619+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.2601","created_at":"2026-05-18T04:26:55.025619+00:00"},{"alias_kind":"pith_short_12","alias_value":"2IVCYOOHO3O6","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"2IVCYOOHO3O66JQB","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"2IVCYOOH","created_at":"2026-05-18T12:26:18.847500+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/2IVCYOOHO3O66JQBLCJNASKGU7","json":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7.json","graph_json":"https://pith.science/api/pith-number/2IVCYOOHO3O66JQBLCJNASKGU7/graph.json","events_json":"https://pith.science/api/pith-number/2IVCYOOHO3O66JQBLCJNASKGU7/events.json","paper":"https://pith.science/paper/2IVCYOOH"},"agent_actions":{"view_html":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7","download_json":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7.json","view_paper":"https://pith.science/paper/2IVCYOOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.2601&json=true","fetch_graph":"https://pith.science/api/pith-number/2IVCYOOHO3O66JQBLCJNASKGU7/graph.json","fetch_events":"https://pith.science/api/pith-number/2IVCYOOHO3O66JQBLCJNASKGU7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7/action/storage_attestation","attest_author":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7/action/author_attestation","sign_citation":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7/action/citation_signature","submit_replication":"https://pith.science/pith/2IVCYOOHO3O66JQBLCJNASKGU7/action/replication_record"}},"created_at":"2026-05-18T04:26:55.025619+00:00","updated_at":"2026-05-18T04:26:55.025619+00:00"}