{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LWNBWG2B2OLKORBYCTGU7DZ4VJ","short_pith_number":"pith:LWNBWG2B","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"},"canonical_sha256":"5d9a1b1b41d396a7443814cd4f8f3caa76ad61648468ef812b9c6efd622dc606","source":{"kind":"arxiv","id":"1501.01819","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01819","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01819v5","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01819","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"LWNBWG2B2OLK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWNBWG2B2OLKORBY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWNBWG2B","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LWNBWG2B2OLKORBYCTGU7DZ4VJ","target":"record","payload":{"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"},"canonical_sha256":"5d9a1b1b41d396a7443814cd4f8f3caa76ad61648468ef812b9c6efd622dc606","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"},"source_kind":"arxiv","source_id":"1501.01819","source_version":5,"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":"lZB+hS0etnGvRTqUN6wkvnkGL172+MSRpFmxF1cniU/CSJubp54RJIf1EOwLvlPqIHcvQjMEJafDdZskV8qgCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:24:24.412994Z"},"content_sha256":"4593a96649ab33ee310b8020a779116a78e29411746fd09acdb09826463285a1","schema_version":"1.0","event_id":"sha256:4593a96649ab33ee310b8020a779116a78e29411746fd09acdb09826463285a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LWNBWG2B2OLKORBYCTGU7DZ4VJ","target":"graph","payload":{"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"},"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":"MwhKcAwDMQL2KZ0iSB2PRIht2HNvxlk6yh3Azy+ZGXBeZ8VcA5ZPdJHhRmzdM33gZeUSEmVHsmuZWrPmyoaNCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T19:24:24.413353Z"},"content_sha256":"bde1ebfdaa5e379c0a948944b7eabdc28732767cdf3ec6198059ab358dca7c41","schema_version":"1.0","event_id":"sha256:bde1ebfdaa5e379c0a948944b7eabdc28732767cdf3ec6198059ab358dca7c41"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/bundle.json","state_url":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/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-10T19:24:24Z","links":{"resolver":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ","bundle":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/bundle.json","state":"https://pith.science/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LWNBWG2B2OLKORBYCTGU7DZ4VJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LWNBWG2B2OLKORBYCTGU7DZ4VJ","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":"fbfc1f28c7e3a08840c06d7815676b4f8b889541d66d7c6f0017a90ec611cd53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-08T12:36:42Z","title_canon_sha256":"c364c60f0fdf030a572f693fb7ce2807fe6c7bee22b15c39658ddd714ddd9f40"},"schema_version":"1.0","source":{"id":"1501.01819","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01819","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01819v5","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01819","created_at":"2026-05-18T00:34:45Z"},{"alias_kind":"pith_short_12","alias_value":"LWNBWG2B2OLK","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LWNBWG2B2OLKORBY","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LWNBWG2B","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:bde1ebfdaa5e379c0a948944b7eabdc28732767cdf3ec6198059ab358dca7c41","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 $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})$,","authors_text":"George Manoussakis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-08T12:36:42Z","title":"New algorithms for $k$-degenerate graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01819","kind":"arxiv","version":5},"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:4593a96649ab33ee310b8020a779116a78e29411746fd09acdb09826463285a1","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":"fbfc1f28c7e3a08840c06d7815676b4f8b889541d66d7c6f0017a90ec611cd53","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-01-08T12:36:42Z","title_canon_sha256":"c364c60f0fdf030a572f693fb7ce2807fe6c7bee22b15c39658ddd714ddd9f40"},"schema_version":"1.0","source":{"id":"1501.01819","kind":"arxiv","version":5}},"canonical_sha256":"5d9a1b1b41d396a7443814cd4f8f3caa76ad61648468ef812b9c6efd622dc606","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d9a1b1b41d396a7443814cd4f8f3caa76ad61648468ef812b9c6efd622dc606","first_computed_at":"2026-05-18T00:34:45.182230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:45.182230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i+bmbFckgYqZ60aLrobMTcKx9nl/bFAszdQvMGR0e4CvF3nTLZhERxQrqQZl18zMtdjZQ5Y+vxaKREfbcFRzCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:45.183019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01819","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4593a96649ab33ee310b8020a779116a78e29411746fd09acdb09826463285a1","sha256:bde1ebfdaa5e379c0a948944b7eabdc28732767cdf3ec6198059ab358dca7c41"],"state_sha256":"381f5f4c532dedb9111aa593b5b1a04c74137145e081b0a6651d6103f59175af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lybj09cY7Z/aKHwL49xbp7LSNLFG5r+8hQU+DZl4bd2NrftVUGQJvt1I5SiUl7R5z2c9k3tmop3jxc28TL5xAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T19:24:24.415381Z","bundle_sha256":"d710b568150892b2e554ecc75ae197743a310cb7befdb433552ddfd09cb5d92a"}}