{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:N7CKK63J732B45YEOA6YCMHLA2","short_pith_number":"pith:N7CKK63J","schema_version":"1.0","canonical_sha256":"6fc4a57b69fef41e7704703d8130eb0696ed93ae2e9860d90cf3089c2465ba7d","source":{"kind":"arxiv","id":"1405.1477","version":3},"attestation_state":"computed","paper":{"title":"A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis","submitted_at":"2014-05-07T00:28:23Z","abstract_excerpt":"Many graph mining applications rely on detecting subgraphs which are near-cliques. There exists a dichotomy between the results in the existing work related to this problem: on the one hand the densest subgraph problem (DSP) which maximizes the average degree over all subgraphs is solvable in polynomial time but for many networks fails to find subgraphs which are near-cliques. On the other hand, formulations that are geared towards finding near-cliques are NP-hard and frequently inapproximable due to connections with the Maximum Clique problem.\n  In this work, we propose a formulation which co"},"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":"1405.1477","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-05-07T00:28:23Z","cross_cats_sorted":["cs.DM","cs.SI"],"title_canon_sha256":"90954462a150a46c4fccaece9536bed4627414d52de76ea9cedaa4895ef40cff","abstract_canon_sha256":"8d4557f5e1e332fc01c8661cd15c41adfd3b99cd1d3abc28a6fc20e38f6ef757"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:24.807308Z","signature_b64":"DrcXFuQlTwOrHOhmzqsfHmvStS1r9qBgqRLGd/TYmPPWwLfndTcrRbL0N/4IUphjmjpHsvoprixdET5LpRgLCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fc4a57b69fef41e7704703d8130eb0696ed93ae2e9860d90cf3089c2465ba7d","last_reissued_at":"2026-05-18T02:51:24.806602Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:24.806602Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Approach to Finding Near-Cliques: The Triangle-Densest Subgraph Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis","submitted_at":"2014-05-07T00:28:23Z","abstract_excerpt":"Many graph mining applications rely on detecting subgraphs which are near-cliques. There exists a dichotomy between the results in the existing work related to this problem: on the one hand the densest subgraph problem (DSP) which maximizes the average degree over all subgraphs is solvable in polynomial time but for many networks fails to find subgraphs which are near-cliques. On the other hand, formulations that are geared towards finding near-cliques are NP-hard and frequently inapproximable due to connections with the Maximum Clique problem.\n  In this work, we propose a formulation which co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.1477","kind":"arxiv","version":3},"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":"1405.1477","created_at":"2026-05-18T02:51:24.806721+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.1477v3","created_at":"2026-05-18T02:51:24.806721+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.1477","created_at":"2026-05-18T02:51:24.806721+00:00"},{"alias_kind":"pith_short_12","alias_value":"N7CKK63J732B","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"N7CKK63J732B45YE","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"N7CKK63J","created_at":"2026-05-18T12:28:41.024544+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/N7CKK63J732B45YEOA6YCMHLA2","json":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2.json","graph_json":"https://pith.science/api/pith-number/N7CKK63J732B45YEOA6YCMHLA2/graph.json","events_json":"https://pith.science/api/pith-number/N7CKK63J732B45YEOA6YCMHLA2/events.json","paper":"https://pith.science/paper/N7CKK63J"},"agent_actions":{"view_html":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2","download_json":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2.json","view_paper":"https://pith.science/paper/N7CKK63J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.1477&json=true","fetch_graph":"https://pith.science/api/pith-number/N7CKK63J732B45YEOA6YCMHLA2/graph.json","fetch_events":"https://pith.science/api/pith-number/N7CKK63J732B45YEOA6YCMHLA2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2/action/storage_attestation","attest_author":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2/action/author_attestation","sign_citation":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2/action/citation_signature","submit_replication":"https://pith.science/pith/N7CKK63J732B45YEOA6YCMHLA2/action/replication_record"}},"created_at":"2026-05-18T02:51:24.806721+00:00","updated_at":"2026-05-18T02:51:24.806721+00:00"}