{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:PKXJBTYYD3O5BMCBVX2MLKX7WF","short_pith_number":"pith:PKXJBTYY","schema_version":"1.0","canonical_sha256":"7aae90cf181eddd0b041adf4c5aaffb16352c1f1b8de15c9178a10d0f98057e7","source":{"kind":"arxiv","id":"1907.03863","version":1},"attestation_state":"computed","paper":{"title":"The Densest k Subgraph Problem in b-Outerplanar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sean Gonzales, Theresa Migler","submitted_at":"2019-07-08T20:45:56Z","abstract_excerpt":"We give an exact $O(nk^2)$ algorithm for finding the densest k subgraph in outerplanar graphs. We extend this to an exact $O(nk^2 8^b)$ algorithm for finding the densest k subgraph in b-outerplanar graphs. Finally, we hypothesize that Baker's PTAS technique will not work for the densest k subgraph problem in planar graphs."},"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":"1907.03863","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-08T20:45:56Z","cross_cats_sorted":[],"title_canon_sha256":"3eba0b6227d5369af6ddf5364a2c6843ae28a2e7594a3db98df2587e5b287a61","abstract_canon_sha256":"fdb60f02c3f0356a80bc4995282ceaa4ad56baf95fa9ac4b12f25a4a596b4e76"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:06.545458Z","signature_b64":"RJeYm4SBLa4oJzZBpyLaAdm+nyGuPNUo424LcWs7X49Q1EV2r6fI2qNpGoRFY8GYo7+XC9xF53u2qByJf6j9Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aae90cf181eddd0b041adf4c5aaffb16352c1f1b8de15c9178a10d0f98057e7","last_reissued_at":"2026-05-17T23:41:06.544734Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:06.544734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Densest k Subgraph Problem in b-Outerplanar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sean Gonzales, Theresa Migler","submitted_at":"2019-07-08T20:45:56Z","abstract_excerpt":"We give an exact $O(nk^2)$ algorithm for finding the densest k subgraph in outerplanar graphs. We extend this to an exact $O(nk^2 8^b)$ algorithm for finding the densest k subgraph in b-outerplanar graphs. Finally, we hypothesize that Baker's PTAS technique will not work for the densest k subgraph problem in planar graphs."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03863","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":"1907.03863","created_at":"2026-05-17T23:41:06.544836+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03863v1","created_at":"2026-05-17T23:41:06.544836+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03863","created_at":"2026-05-17T23:41:06.544836+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKXJBTYYD3O5","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKXJBTYYD3O5BMCB","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKXJBTYY","created_at":"2026-05-18T12:33:24.271573+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/PKXJBTYYD3O5BMCBVX2MLKX7WF","json":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF.json","graph_json":"https://pith.science/api/pith-number/PKXJBTYYD3O5BMCBVX2MLKX7WF/graph.json","events_json":"https://pith.science/api/pith-number/PKXJBTYYD3O5BMCBVX2MLKX7WF/events.json","paper":"https://pith.science/paper/PKXJBTYY"},"agent_actions":{"view_html":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF","download_json":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF.json","view_paper":"https://pith.science/paper/PKXJBTYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03863&json=true","fetch_graph":"https://pith.science/api/pith-number/PKXJBTYYD3O5BMCBVX2MLKX7WF/graph.json","fetch_events":"https://pith.science/api/pith-number/PKXJBTYYD3O5BMCBVX2MLKX7WF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF/action/storage_attestation","attest_author":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF/action/author_attestation","sign_citation":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF/action/citation_signature","submit_replication":"https://pith.science/pith/PKXJBTYYD3O5BMCBVX2MLKX7WF/action/replication_record"}},"created_at":"2026-05-17T23:41:06.544836+00:00","updated_at":"2026-05-17T23:41:06.544836+00:00"}