{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KAJ4ER3PVQGQUR6XNCDWKA3X2M","short_pith_number":"pith:KAJ4ER3P","schema_version":"1.0","canonical_sha256":"5013c2476fac0d0a47d76887650377d3276327d08b86fdb9a7fedb3fb6a8f046","source":{"kind":"arxiv","id":"1505.04300","version":1},"attestation_state":"computed","paper":{"title":"A Graph Theoretical Analysis of the Number of Edges in k-dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Escuardo, Karl R.B. Schmitt, Linda Eroh, Ralucca Gera, Samuel Prahlow","submitted_at":"2015-05-16T17:44:46Z","abstract_excerpt":"Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important. Motivated by the idea of community (or sub-graph) detection within a network/graph, we focused on finding characterizations of k-dense communities. For each edge $uv\\in E(G)$, the {\\bf edge multiplicity} of $uv$ in $G$ is given by $m_G(uv)=|N_{G}(u)\\cap N_{G}(v)|.$ For an integer $k$ with $k\\ge 2$, a {\\bf $k$-dense community} of a graph $G$, denoted by $DC_k(G)$, is a maximal connected subgraph of $G$ induced by the vertex set $$V_"},"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":"1505.04300","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-05-16T17:44:46Z","cross_cats_sorted":[],"title_canon_sha256":"0c1215aceb9431edfe01382d81419569e71bf366f34ab3cafafd4fb48d205bee","abstract_canon_sha256":"ce78b1441340c3a180889713592c369105a5c9f2ee7b6d915c2d2f51d78bdb42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:25.805408Z","signature_b64":"vCPOKp4Fr2XlDSuLgDwxYp5E6ADSZslP/YmcTHgrLS7HXY4JGyNERIO9cyjRqKKzc5ALXSDDYwj8uRZtEw9zBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5013c2476fac0d0a47d76887650377d3276327d08b86fdb9a7fedb3fb6a8f046","last_reissued_at":"2026-05-18T02:07:25.805022Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:25.805022Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Graph Theoretical Analysis of the Number of Edges in k-dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henry Escuardo, Karl R.B. Schmitt, Linda Eroh, Ralucca Gera, Samuel Prahlow","submitted_at":"2015-05-16T17:44:46Z","abstract_excerpt":"Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important. Motivated by the idea of community (or sub-graph) detection within a network/graph, we focused on finding characterizations of k-dense communities. For each edge $uv\\in E(G)$, the {\\bf edge multiplicity} of $uv$ in $G$ is given by $m_G(uv)=|N_{G}(u)\\cap N_{G}(v)|.$ For an integer $k$ with $k\\ge 2$, a {\\bf $k$-dense community} of a graph $G$, denoted by $DC_k(G)$, is a maximal connected subgraph of $G$ induced by the vertex set $$V_"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.04300","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":"1505.04300","created_at":"2026-05-18T02:07:25.805083+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.04300v1","created_at":"2026-05-18T02:07:25.805083+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.04300","created_at":"2026-05-18T02:07:25.805083+00:00"},{"alias_kind":"pith_short_12","alias_value":"KAJ4ER3PVQGQ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KAJ4ER3PVQGQUR6X","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KAJ4ER3P","created_at":"2026-05-18T12:29:27.538025+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/KAJ4ER3PVQGQUR6XNCDWKA3X2M","json":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M.json","graph_json":"https://pith.science/api/pith-number/KAJ4ER3PVQGQUR6XNCDWKA3X2M/graph.json","events_json":"https://pith.science/api/pith-number/KAJ4ER3PVQGQUR6XNCDWKA3X2M/events.json","paper":"https://pith.science/paper/KAJ4ER3P"},"agent_actions":{"view_html":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M","download_json":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M.json","view_paper":"https://pith.science/paper/KAJ4ER3P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.04300&json=true","fetch_graph":"https://pith.science/api/pith-number/KAJ4ER3PVQGQUR6XNCDWKA3X2M/graph.json","fetch_events":"https://pith.science/api/pith-number/KAJ4ER3PVQGQUR6XNCDWKA3X2M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/action/storage_attestation","attest_author":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/action/author_attestation","sign_citation":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/action/citation_signature","submit_replication":"https://pith.science/pith/KAJ4ER3PVQGQUR6XNCDWKA3X2M/action/replication_record"}},"created_at":"2026-05-18T02:07:25.805083+00:00","updated_at":"2026-05-18T02:07:25.805083+00:00"}