{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LWNBWG2B2OLKORBYCTGU7DZ4VJ","short_pith_number":"pith:LWNBWG2B","schema_version":"1.0","canonical_sha256":"5d9a1b1b41d396a7443814cd4f8f3caa76ad61648468ef812b9c6efd622dc606","source":{"kind":"arxiv","id":"1501.01819","version":5},"attestation_state":"computed","paper":{"title":"New algorithms for $k$-degenerate graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"George Manoussakis","submitted_at":"2015-01-08T12:36:42Z","abstract_excerpt":"A graph is $k$-degenerate if any induced subgraph has a vertex of degree at most $k$. In this paper we prove new algorithms for cliques and similar structures for these graphs. We design linear time Fixed-Parameter Tractable algorithms for induced and non induced bicliques. We prove an algorithm listing all maximal bicliques in time $\\mathcal{O}(k^{3}(n-k)2^{k})$, improving the result of [D. Eppstein, Arboricity and bipartite subgraph listing algorithms, Information Processing Letters, (1994)]. We construct an algorithm listing all cliques of size $l$ in time $\\mathcal{O}(l(n-k)k(k-1)^{l-2})$,"},"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":"1501.01819","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-08T12:36:42Z","cross_cats_sorted":[],"title_canon_sha256":"c364c60f0fdf030a572f693fb7ce2807fe6c7bee22b15c39658ddd714ddd9f40","abstract_canon_sha256":"fbfc1f28c7e3a08840c06d7815676b4f8b889541d66d7c6f0017a90ec611cd53"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:45.183019Z","signature_b64":"i+bmbFckgYqZ60aLrobMTcKx9nl/bFAszdQvMGR0e4CvF3nTLZhERxQrqQZl18zMtdjZQ5Y+vxaKREfbcFRzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d9a1b1b41d396a7443814cd4f8f3caa76ad61648468ef812b9c6efd622dc606","last_reissued_at":"2026-05-18T00:34:45.182230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:45.182230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New algorithms for $k$-degenerate graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"George Manoussakis","submitted_at":"2015-01-08T12:36:42Z","abstract_excerpt":"A graph is $k$-degenerate if any induced subgraph has a vertex of degree at most $k$. In this paper we prove new algorithms for cliques and similar structures for these graphs. We design linear time Fixed-Parameter Tractable algorithms for induced and non induced bicliques. We prove an algorithm listing all maximal bicliques in time $\\mathcal{O}(k^{3}(n-k)2^{k})$, improving the result of [D. Eppstein, Arboricity and bipartite subgraph listing algorithms, Information Processing Letters, (1994)]. We construct an algorithm listing all cliques of size $l$ in time $\\mathcal{O}(l(n-k)k(k-1)^{l-2})$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01819","kind":"arxiv","version":5},"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":"1501.01819","created_at":"2026-05-18T00:34:45.182382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01819v5","created_at":"2026-05-18T00:34:45.182382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01819","created_at":"2026-05-18T00:34:45.182382+00:00"},{"alias_kind":"pith_short_12","alias_value":"LWNBWG2B2OLK","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LWNBWG2B2OLKORBY","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LWNBWG2B","created_at":"2026-05-18T12:29:29.992203+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/LWNBWG2B2OLKORBYCTGU7DZ4VJ","json":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ.json","graph_json":"https://pith.science/api/pith-number/LWNBWG2B2OLKORBYCTGU7DZ4VJ/graph.json","events_json":"https://pith.science/api/pith-number/LWNBWG2B2OLKORBYCTGU7DZ4VJ/events.json","paper":"https://pith.science/paper/LWNBWG2B"},"agent_actions":{"view_html":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ","download_json":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ.json","view_paper":"https://pith.science/paper/LWNBWG2B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01819&json=true","fetch_graph":"https://pith.science/api/pith-number/LWNBWG2B2OLKORBYCTGU7DZ4VJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LWNBWG2B2OLKORBYCTGU7DZ4VJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/action/storage_attestation","attest_author":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/action/author_attestation","sign_citation":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/action/citation_signature","submit_replication":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/action/replication_record"}},"created_at":"2026-05-18T00:34:45.182382+00:00","updated_at":"2026-05-18T00:34:45.182382+00:00"}