{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:QOUJD6MXC3LIFWLXXOWF3TGUF4","short_pith_number":"pith:QOUJD6MX","schema_version":"1.0","canonical_sha256":"83a891f99716d682d977bbac5dccd42f18c7b17d968199560fcca3e73431c866","source":{"kind":"arxiv","id":"1410.3302","version":6},"attestation_state":"computed","paper":{"title":"The clique problem on inductive $k$-independent graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"George Manoussakis","submitted_at":"2014-10-13T13:38:47Z","abstract_excerpt":"A graph is inductive $k$-independent if there exists and ordering of its vertices $v_{1},...,v_{n}$ such that $\\alpha(G[N(v_{i})\\cap V_{i}])\\leq k $ where $N(v_{i})$ is the neighborhood of $v_{i}$, $V_{i}=\\{v_{i},...,v_{n}\\}$ and $\\alpha$ is the independence number. In this article, by answering to a question of [Y.Ye, A.Borodin, Elimination graphs, ACM Trans. Algorithms 8 (2) (2012) 14:1-14:23], we design a polynomial time approximation algorithm with ratio {$\\overline{\\Delta} \\slash log(log(\\overline{ \\Delta}) \\slash k)$ for the maximum clique and also show that the decision version of this "},"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":"1410.3302","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-13T13:38:47Z","cross_cats_sorted":[],"title_canon_sha256":"8fbcfabc9edd92724768fc3c20b61d7b57fb122a5b94a4dd421b729787efb7a5","abstract_canon_sha256":"8d30575412574db40cbb9dd41a315e59df67b5d13d3ec52a08776ab7b2f9ae3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:45.202342Z","signature_b64":"VPcihXC0C00Ep4n5Yd0sHvYZfl8uFNXTMdRvDCw2qgaLOvFm5fijuuM/NXAzvGF6CYMg9PGjHkMYJmxeOofaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a891f99716d682d977bbac5dccd42f18c7b17d968199560fcca3e73431c866","last_reissued_at":"2026-05-18T00:34:45.201592Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:45.201592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The clique problem on inductive $k$-independent graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"George Manoussakis","submitted_at":"2014-10-13T13:38:47Z","abstract_excerpt":"A graph is inductive $k$-independent if there exists and ordering of its vertices $v_{1},...,v_{n}$ such that $\\alpha(G[N(v_{i})\\cap V_{i}])\\leq k $ where $N(v_{i})$ is the neighborhood of $v_{i}$, $V_{i}=\\{v_{i},...,v_{n}\\}$ and $\\alpha$ is the independence number. In this article, by answering to a question of [Y.Ye, A.Borodin, Elimination graphs, ACM Trans. Algorithms 8 (2) (2012) 14:1-14:23], we design a polynomial time approximation algorithm with ratio {$\\overline{\\Delta} \\slash log(log(\\overline{ \\Delta}) \\slash k)$ for the maximum clique and also show that the decision version of this "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3302","kind":"arxiv","version":6},"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":"1410.3302","created_at":"2026-05-18T00:34:45.201717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.3302v6","created_at":"2026-05-18T00:34:45.201717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3302","created_at":"2026-05-18T00:34:45.201717+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOUJD6MXC3LI","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOUJD6MXC3LIFWLX","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOUJD6MX","created_at":"2026-05-18T12:28:46.137349+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/QOUJD6MXC3LIFWLXXOWF3TGUF4","json":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4.json","graph_json":"https://pith.science/api/pith-number/QOUJD6MXC3LIFWLXXOWF3TGUF4/graph.json","events_json":"https://pith.science/api/pith-number/QOUJD6MXC3LIFWLXXOWF3TGUF4/events.json","paper":"https://pith.science/paper/QOUJD6MX"},"agent_actions":{"view_html":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4","download_json":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4.json","view_paper":"https://pith.science/paper/QOUJD6MX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.3302&json=true","fetch_graph":"https://pith.science/api/pith-number/QOUJD6MXC3LIFWLXXOWF3TGUF4/graph.json","fetch_events":"https://pith.science/api/pith-number/QOUJD6MXC3LIFWLXXOWF3TGUF4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/action/storage_attestation","attest_author":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/action/author_attestation","sign_citation":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/action/citation_signature","submit_replication":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/action/replication_record"}},"created_at":"2026-05-18T00:34:45.201717+00:00","updated_at":"2026-05-18T00:34:45.201717+00:00"}