{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:QOUJD6MXC3LIFWLXXOWF3TGUF4","short_pith_number":"pith:QOUJD6MX","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"},"canonical_sha256":"83a891f99716d682d977bbac5dccd42f18c7b17d968199560fcca3e73431c866","source":{"kind":"arxiv","id":"1410.3302","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3302","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3302v6","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3302","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"QOUJD6MXC3LI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOUJD6MXC3LIFWLX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOUJD6MX","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:QOUJD6MXC3LIFWLXXOWF3TGUF4","target":"record","payload":{"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"},"canonical_sha256":"83a891f99716d682d977bbac5dccd42f18c7b17d968199560fcca3e73431c866","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"},"source_kind":"arxiv","source_id":"1410.3302","source_version":6,"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-18T00:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1/OnRO6F2BoocVovZr+Ntbg0ee61dI/gENsGPz3R1UXcA5zEseFiFOIs+5oS0z8r51qSXr67+IPL0QhyyQ06AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:28:17.366866Z"},"content_sha256":"42569a6fbd930e0105f2744aa248caf9cc3783fbbbe384b696300bd081609dc4","schema_version":"1.0","event_id":"sha256:42569a6fbd930e0105f2744aa248caf9cc3783fbbbe384b696300bd081609dc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:QOUJD6MXC3LIFWLXXOWF3TGUF4","target":"graph","payload":{"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"},"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-18T00:34:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DB3H/2VpEZytV639/vumsqm1foqidMrnzK9ZGxnUsxsF5L7DphSK/2ih1kIlKi68fhG+SFqWOF+c0rWewP9lAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:28:17.367605Z"},"content_sha256":"804827cc5b1a53518aad2c3722ff430d1e1ac597ef6603b232b0c4d30d2846b6","schema_version":"1.0","event_id":"sha256:804827cc5b1a53518aad2c3722ff430d1e1ac597ef6603b232b0c4d30d2846b6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/bundle.json","state_url":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/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-06-11T01:28:17Z","links":{"resolver":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4","bundle":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/bundle.json","state":"https://pith.science/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QOUJD6MXC3LIFWLXXOWF3TGUF4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:QOUJD6MXC3LIFWLXXOWF3TGUF4","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":"8d30575412574db40cbb9dd41a315e59df67b5d13d3ec52a08776ab7b2f9ae3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-13T13:38:47Z","title_canon_sha256":"8fbcfabc9edd92724768fc3c20b61d7b57fb122a5b94a4dd421b729787efb7a5"},"schema_version":"1.0","source":{"id":"1410.3302","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.3302","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1410.3302v6","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.3302","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"QOUJD6MXC3LI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"QOUJD6MXC3LIFWLX","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"QOUJD6MX","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:804827cc5b1a53518aad2c3722ff430d1e1ac597ef6603b232b0c4d30d2846b6","target":"graph","created_at":"2026-05-18T00:34:45Z","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":"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 ","authors_text":"George Manoussakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-13T13:38:47Z","title":"The clique problem on inductive $k$-independent graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.3302","kind":"arxiv","version":6},"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:42569a6fbd930e0105f2744aa248caf9cc3783fbbbe384b696300bd081609dc4","target":"record","created_at":"2026-05-18T00:34:45Z","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":"8d30575412574db40cbb9dd41a315e59df67b5d13d3ec52a08776ab7b2f9ae3c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-10-13T13:38:47Z","title_canon_sha256":"8fbcfabc9edd92724768fc3c20b61d7b57fb122a5b94a4dd421b729787efb7a5"},"schema_version":"1.0","source":{"id":"1410.3302","kind":"arxiv","version":6}},"canonical_sha256":"83a891f99716d682d977bbac5dccd42f18c7b17d968199560fcca3e73431c866","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83a891f99716d682d977bbac5dccd42f18c7b17d968199560fcca3e73431c866","first_computed_at":"2026-05-18T00:34:45.201592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:45.201592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VPcihXC0C00Ep4n5Yd0sHvYZfl8uFNXTMdRvDCw2qgaLOvFm5fijuuM/NXAzvGF6CYMg9PGjHkMYJmxeOofaDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:45.202342Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.3302","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:42569a6fbd930e0105f2744aa248caf9cc3783fbbbe384b696300bd081609dc4","sha256:804827cc5b1a53518aad2c3722ff430d1e1ac597ef6603b232b0c4d30d2846b6"],"state_sha256":"80f8233c49215b50f4c75469db4190550217dd19ed25222f5641c18e73dc687a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AYppXhLHeJ24zZlh8rtdymPSCFz3cUZMlhVP/poNsa/cWjYVn4PmzQH/n8fXWAo73maD+416yxR3BygQgAy2Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:28:17.371939Z","bundle_sha256":"519e32fd2a8d3f02597c6429104a17100b95559059c3b5082c6295ed9c046d3a"}}